Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfeqf1 | Structured version Visualization version GIF version |
Description: An equation between setvar is free of any other setvar. (Contributed by Wolf Lammen, 10-Jun-2019.) |
Ref | Expression |
---|---|
nfeqf1 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦 = 𝑧) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfeqf2 2388 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦) | |
2 | equcom 2016 | . . 3 ⊢ (𝑧 = 𝑦 ↔ 𝑦 = 𝑧) | |
3 | 2 | nfbii 1843 | . 2 ⊢ (Ⅎ𝑥 𝑧 = 𝑦 ↔ Ⅎ𝑥 𝑦 = 𝑧) |
4 | 1, 3 | sylib 219 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦 = 𝑧) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1526 Ⅎwnf 1775 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-10 2136 ax-13 2383 |
This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1772 df-nf 1776 |
This theorem is referenced by: dveeq1 2391 sbal2 2569 sbal2OLD 2570 nfmod2 2638 nfiotad 6313 wl-mo2df 34688 wl-eudf 34690 |
Copyright terms: Public domain | W3C validator |