![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nfrexxy | Unicode version |
Description: Not-free for restricted
existential quantification where ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
nfralxy.1 |
![]() ![]() ![]() ![]() |
nfralxy.2 |
![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
nfrexxy |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1464 |
. . 3
![]() ![]() ![]() ![]() | |
2 | nfralxy.1 |
. . . 4
![]() ![]() ![]() ![]() | |
3 | 2 | a1i 9 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
4 | nfralxy.2 |
. . . 4
![]() ![]() ![]() ![]() | |
5 | 4 | a1i 9 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
6 | 1, 3, 5 | nfrexdxy 2509 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 6 | mptru 1362 |
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-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-4 1508 ax-17 1524 ax-ial 1532 ax-i5r 1533 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1459 df-cleq 2168 df-clel 2171 df-nfc 2306 df-rex 2459 |
This theorem is referenced by: r19.12 2581 sbcrext 3038 nfuni 3811 nfiunxy 3908 rexxpf 4767 abrexex2g 6111 abrexex2 6115 nfrecs 6298 fimaxre2 11203 nfsum 11333 nfcprod1 11530 nfcprod 11531 bezoutlemmain 11966 ctiunctlemfo 12407 bj-findis 14300 strcollnfALT 14307 |
Copyright terms: Public domain | W3C validator |