![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nfrexya | Unicode version |
Description: Not-free for restricted
existential quantification where ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
nfralya.1 |
![]() ![]() ![]() ![]() |
nfralya.2 |
![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
nfrexya |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1443 |
. . 3
![]() ![]() ![]() ![]() | |
2 | nfralya.1 |
. . . 4
![]() ![]() ![]() ![]() | |
3 | 2 | a1i 9 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
4 | nfralya.2 |
. . . 4
![]() ![]() ![]() ![]() | |
5 | 4 | a1i 9 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 1, 3, 5 | nfrexdya 2473 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 6 | mptru 1341 |
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 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-cleq 2133 df-clel 2136 df-nfc 2271 df-rex 2423 |
This theorem is referenced by: nfiunya 3849 nffrec 6301 nfsup 6887 caucvgsrlemgt1 7627 nfsum1 11157 zsupcllemstep 11674 bezout 11735 |
Copyright terms: Public domain | W3C validator |