Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfreudxy | Unicode version |
Description: Not-free deduction for restricted uniqueness. This is a version where and are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.) |
Ref | Expression |
---|---|
nfreudxy.1 | |
nfreudxy.2 | |
nfreudxy.3 |
Ref | Expression |
---|---|
nfreudxy |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfreudxy.1 | . . 3 | |
2 | nfcv 2258 | . . . . . 6 | |
3 | 2 | a1i 9 | . . . . 5 |
4 | nfreudxy.2 | . . . . 5 | |
5 | 3, 4 | nfeld 2274 | . . . 4 |
6 | nfreudxy.3 | . . . 4 | |
7 | 5, 6 | nfand 1532 | . . 3 |
8 | 1, 7 | nfeud 1993 | . 2 |
9 | df-reu 2400 | . . 3 | |
10 | 9 | nfbii 1434 | . 2 |
11 | 8, 10 | sylibr 133 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wnf 1421 wcel 1465 weu 1977 wnfc 2245 wreu 2395 |
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 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-tru 1319 df-nf 1422 df-sb 1721 df-eu 1980 df-cleq 2110 df-clel 2113 df-nfc 2247 df-reu 2400 |
This theorem is referenced by: nfreuxy 2582 |
Copyright terms: Public domain | W3C validator |