MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  equvel Structured version   Visualization version   GIF version

Theorem equvel 2484
Description: A variable elimination law for equality with no distinct variable requirements. Compare equvini 2483. (Contributed by NM, 1-Mar-2013.) (Proof shortened by Mario Carneiro, 17-Oct-2016.) (Proof shortened by Wolf Lammen, 15-Jun-2019.)
Assertion
Ref Expression
equvel (∀𝑧(𝑧 = 𝑥𝑧 = 𝑦) → 𝑥 = 𝑦)

Proof of Theorem equvel
StepHypRef Expression
1 albi 1895 . 2 (∀𝑧(𝑧 = 𝑥𝑧 = 𝑦) → (∀𝑧 𝑧 = 𝑥 ↔ ∀𝑧 𝑧 = 𝑦))
2 ax6e 2395 . . . 4 𝑧 𝑧 = 𝑦
3 biimpr 210 . . . . . 6 ((𝑧 = 𝑥𝑧 = 𝑦) → (𝑧 = 𝑦𝑧 = 𝑥))
4 ax7 2098 . . . . . 6 (𝑧 = 𝑥 → (𝑧 = 𝑦𝑥 = 𝑦))
53, 4syli 39 . . . . 5 ((𝑧 = 𝑥𝑧 = 𝑦) → (𝑧 = 𝑦𝑥 = 𝑦))
65com12 32 . . . 4 (𝑧 = 𝑦 → ((𝑧 = 𝑥𝑧 = 𝑦) → 𝑥 = 𝑦))
72, 6eximii 1913 . . 3 𝑧((𝑧 = 𝑥𝑧 = 𝑦) → 𝑥 = 𝑦)
8719.35i 1955 . 2 (∀𝑧(𝑧 = 𝑥𝑧 = 𝑦) → ∃𝑧 𝑥 = 𝑦)
94spsd 2204 . . . . 5 (𝑧 = 𝑥 → (∀𝑧 𝑧 = 𝑦𝑥 = 𝑦))
109sps 2202 . . . 4 (∀𝑧 𝑧 = 𝑥 → (∀𝑧 𝑧 = 𝑦𝑥 = 𝑦))
1110a1dd 50 . . 3 (∀𝑧 𝑧 = 𝑥 → (∀𝑧 𝑧 = 𝑦 → (∃𝑧 𝑥 = 𝑦𝑥 = 𝑦)))
12 nfeqf 2446 . . . . 5 ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧 𝑥 = 𝑦)
131219.9d 2217 . . . 4 ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (∃𝑧 𝑥 = 𝑦𝑥 = 𝑦))
1413ex 449 . . 3 (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → (∃𝑧 𝑥 = 𝑦𝑥 = 𝑦)))
1511, 14bija 369 . 2 ((∀𝑧 𝑧 = 𝑥 ↔ ∀𝑧 𝑧 = 𝑦) → (∃𝑧 𝑥 = 𝑦𝑥 = 𝑦))
161, 8, 15sylc 65 1 (∀𝑧(𝑧 = 𝑥𝑧 = 𝑦) → 𝑥 = 𝑦)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383  wal 1630  wex 1853
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-10 2168  ax-12 2196  ax-13 2391
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator