| 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 2375 | . 2 ⊢ Ⅎ𝑥𝑧 | |
| 2 | nfcv 2375 | . 2 ⊢ Ⅎ𝑧𝑦 | |
| 3 | id 19 | . 2 ⊢ (𝑧 = 𝑦 → 𝑧 = 𝑦) | |
| 4 | 1, 2, 3 | dvelimc 2397 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1396 Ⅎwnfc 2362 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-cleq 2224 df-clel 2227 df-nfc 2364 |
| This theorem is referenced by: nfcvf2 2399 |
| Copyright terms: Public domain | W3C validator |