Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfeqf2 | Structured version Visualization version GIF version |
Description: An equation between setvar is free of any other setvar. Usage of this theorem is discouraged because it depends on ax-13 2386. (Contributed by Wolf Lammen, 9-Jun-2019.) Remove dependency on ax-12 2173. (Revised by Wolf Lammen, 16-Dec-2022.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nfeqf2 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | exnal 1823 | . 2 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 ↔ ¬ ∀𝑥 𝑥 = 𝑦) | |
2 | hbe1 2143 | . . . . 5 ⊢ (∃𝑥 𝑧 = 𝑦 → ∀𝑥∃𝑥 𝑧 = 𝑦) | |
3 | ax13lem2 2390 | . . . . . 6 ⊢ (¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → 𝑧 = 𝑦)) | |
4 | ax13lem1 2388 | . . . . . 6 ⊢ (¬ 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) | |
5 | 3, 4 | syldc 48 | . . . . 5 ⊢ (∃𝑥 𝑧 = 𝑦 → (¬ 𝑥 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) |
6 | 2, 5 | eximdh 1861 | . . . 4 ⊢ (∃𝑥 𝑧 = 𝑦 → (∃𝑥 ¬ 𝑥 = 𝑦 → ∃𝑥∀𝑥 𝑧 = 𝑦)) |
7 | hbe1a 2144 | . . . 4 ⊢ (∃𝑥∀𝑥 𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦) | |
8 | 6, 7 | syl6com 37 | . . 3 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 → (∃𝑥 𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) |
9 | 8 | nfd 1787 | . 2 ⊢ (∃𝑥 ¬ 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦) |
10 | 1, 9 | sylbir 237 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1531 ∃wex 1776 Ⅎwnf 1780 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-10 2141 ax-13 2386 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 df-nf 1781 |
This theorem is referenced by: dveeq2 2392 nfeqf1 2393 sb4b 2495 sb4bOLD 2496 sbal1 2568 copsexg 5381 axrepndlem1 10013 axpowndlem2 10019 axpowndlem3 10020 bj-dvelimdv 34175 bj-dvelimdv1 34176 wl-equsb3 34791 wl-sbcom2d-lem1 34794 wl-mo2df 34805 wl-eudf 34807 wl-euequf 34809 |
Copyright terms: Public domain | W3C validator |