![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nfcvf | GIF version |
Description: If 𝑥 and 𝑦 are distinct, then 𝑥 is not free in 𝑦. (Contributed by Mario Carneiro, 8-Oct-2016.) |
Ref | Expression |
---|---|
nfcvf | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2319 | . 2 ⊢ Ⅎ𝑥𝑧 | |
2 | nfcv 2319 | . 2 ⊢ Ⅎ𝑧𝑦 | |
3 | id 19 | . 2 ⊢ (𝑧 = 𝑦 → 𝑧 = 𝑦) | |
4 | 1, 2, 3 | dvelimc 2341 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1351 Ⅎwnfc 2306 |
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-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-cleq 2170 df-clel 2173 df-nfc 2308 |
This theorem is referenced by: nfcvf2 2343 |
Copyright terms: Public domain | W3C validator |