![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nex | Unicode version |
Description: Generalization rule for negated wff. (Contributed by NM, 18-May-1994.) |
Ref | Expression |
---|---|
nex.1 |
![]() ![]() ![]() |
Ref | Expression |
---|---|
nex |
![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | alnex 1510 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | nex.1 |
. 2
![]() ![]() ![]() | |
3 | 1, 2 | mpgbi 1463 |
1
![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-5 1458 ax-gen 1460 ax-ie2 1505 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-fal 1370 |
This theorem is referenced by: ru 2985 0nelxp 4688 0xp 4740 dm0 4877 co02 5180 0fv 5591 mpo0 5989 0npr 7545 0g0 12962 gsum0g 12982 |
Copyright terms: Public domain | W3C validator |