Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfraldxy | Unicode version |
Description: Not-free for restricted universal quantification where and are distinct. See nfraldya 2467 for a version with and distinct instead. (Contributed by Jim Kingdon, 29-May-2018.) |
Ref | Expression |
---|---|
nfraldxy.2 | |
nfraldxy.3 | |
nfraldxy.4 |
Ref | Expression |
---|---|
nfraldxy |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ral 2419 | . 2 | |
2 | nfraldxy.2 | . . 3 | |
3 | nfcv 2279 | . . . . . 6 | |
4 | 3 | a1i 9 | . . . . 5 |
5 | nfraldxy.3 | . . . . 5 | |
6 | 4, 5 | nfeld 2295 | . . . 4 |
7 | nfraldxy.4 | . . . 4 | |
8 | 6, 7 | nfimd 1564 | . . 3 |
9 | 2, 8 | nfald 1733 | . 2 |
10 | 1, 9 | nfxfrd 1451 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wal 1329 wnf 1436 wcel 1480 wnfc 2266 wral 2414 |
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 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-4 1487 ax-17 1506 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 |
This theorem is referenced by: nfraldya 2467 nfralxy 2469 |
Copyright terms: Public domain | W3C validator |