![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nexdv | Unicode version |
Description: Deduction for generalization rule for negated wff. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
nexdv.1 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
nexdv |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-17 1419 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | nexdv.1 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 1, 2 | nexd 1504 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-5 1336 ax-gen 1338 ax-ie2 1383 ax-17 1419 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-fal 1249 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |