Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfrexya | Unicode version |
Description: Not-free for restricted existential quantification where and are distinct. See nfrexxy 2470 for a version with and distinct instead. (Contributed by Jim Kingdon, 3-Jun-2018.) |
Ref | Expression |
---|---|
nfralya.1 | |
nfralya.2 |
Ref | Expression |
---|---|
nfrexya |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1442 | . . 3 | |
2 | nfralya.1 | . . . 4 | |
3 | 2 | a1i 9 | . . 3 |
4 | nfralya.2 | . . . 4 | |
5 | 4 | a1i 9 | . . 3 |
6 | 1, 3, 5 | nfrexdya 2468 | . 2 |
7 | 6 | mptru 1340 | 1 |
Colors of variables: wff set class |
Syntax hints: wtru 1332 wnf 1436 wnfc 2266 wrex 2415 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-cleq 2130 df-clel 2133 df-nfc 2268 df-rex 2420 |
This theorem is referenced by: nfiunya 3836 nffrec 6286 nfsup 6872 caucvgsrlemgt1 7596 nfsum1 11118 zsupcllemstep 11627 bezout 11688 |
Copyright terms: Public domain | W3C validator |