Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfrexdxy | Unicode version |
Description: Not-free for restricted existential quantification where and are distinct. See nfrexdya 2502 for a version with and distinct instead. (Contributed by Jim Kingdon, 30-May-2018.) |
Ref | Expression |
---|---|
nfraldxy.2 | |
nfraldxy.3 | |
nfraldxy.4 |
Ref | Expression |
---|---|
nfrexdxy |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rex 2450 | . 2 | |
2 | nfraldxy.2 | . . 3 | |
3 | nfcv 2308 | . . . . . 6 | |
4 | 3 | a1i 9 | . . . . 5 |
5 | nfraldxy.3 | . . . . 5 | |
6 | 4, 5 | nfeld 2324 | . . . 4 |
7 | nfraldxy.4 | . . . 4 | |
8 | 6, 7 | nfand 1556 | . . 3 |
9 | 2, 8 | nfexd 1749 | . 2 |
10 | 1, 9 | nfxfrd 1463 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wnf 1448 wex 1480 wcel 2136 wnfc 2295 wrex 2445 |
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-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-4 1498 ax-17 1514 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-nf 1449 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rex 2450 |
This theorem is referenced by: nfrexdya 2502 nfrexxy 2505 nfunid 3796 strcollnft 13866 |
Copyright terms: Public domain | W3C validator |