| 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 2466 with a disjoint variable condition, which does not require ax-13 2404. (Contributed by Mario Carneiro, 11-Aug-2016.) Avoid ax-13 2404. (Revised by GG, 10-Jan-2024.) (Proof shortened by Wolf Lammen, 25-Sep-2024.) |
| Ref | Expression |
|---|---|
| nfnaew | ⊢ Ⅎ𝑧 ¬ ∀𝑥 𝑥 = 𝑦 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hbnaev 2094 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑧 ¬ ∀𝑥 𝑥 = 𝑦) | |
| 2 | 1 | nf5i 2181 | 1 ⊢ Ⅎ𝑧 ¬ ∀𝑥 𝑥 = 𝑦 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∀wal 1568 Ⅎwnf 1813 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-10 2176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1810 df-nf 1814 |
| This theorem is referenced by: nfriotadw 7375 |
| Copyright terms: Public domain | W3C validator |