Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfned | Unicode version |
Description: Bound-variable hypothesis builder for inequality. (Contributed by NM, 10-Nov-2007.) (Revised by Mario Carneiro, 7-Oct-2016.) |
Ref | Expression |
---|---|
nfned.1 | |
nfned.2 |
Ref | Expression |
---|---|
nfned |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ne 2246 | . 2 | |
2 | nfned.1 | . . . 4 | |
3 | nfned.2 | . . . 4 | |
4 | 2, 3 | nfeqd 2233 | . . 3 |
5 | 4 | nfnd 1587 | . 2 |
6 | 1, 5 | nfxfrd 1404 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wceq 1284 wnf 1389 wnfc 2206 wne 2245 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie2 1423 ax-4 1440 ax-17 1459 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-fal 1290 df-nf 1390 df-cleq 2074 df-nfc 2208 df-ne 2246 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |