| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfnaew | Structured version Visualization version GIF version | ||
| Description: All variables are effectively bound in a distinct variable specifier. Version of nfnae 2468 with a disjoint variable condition, which does not require ax-13 2406. (Contributed by Mario Carneiro, 11-Aug-2016.) Avoid ax-13 2406. (Revised by GG, 10-Jan-2024.) (Proof shortened by Wolf Lammen, 25-Sep-2024.) |
| Ref | Expression |
|---|---|
| nfnaew | ⊢ Ⅎ𝑧 ¬ ∀𝑥 𝑥 = 𝑦 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hbnaev 2097 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑧 ¬ ∀𝑥 𝑥 = 𝑦) | |
| 2 | 1 | nf5i 2184 | 1 ⊢ Ⅎ𝑧 ¬ ∀𝑥 𝑥 = 𝑦 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∀wal 1568 Ⅎwnf 1816 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-10 2179 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-nf 1817 |
| This theorem is used by: nfriotadw 7384 |
| Copyright terms: Public domain | W3C validator |