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

Theorem equvini 2344
Description: A variable introduction law for equality. Lemma 15 of [Monk2] p. 109, however we do not require 𝑧 to be distinct from 𝑥 and 𝑦. See equvinv 1957 for a shorter proof requiring fewer axioms when 𝑧 is required to be distinct from 𝑥 and 𝑦. (Contributed by NM, 10-Jan-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 15-Sep-2018.)
Assertion
Ref Expression
equvini (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦))

Proof of Theorem equvini
StepHypRef Expression
1 equtr 1946 . . . 4 (𝑧 = 𝑥 → (𝑥 = 𝑦𝑧 = 𝑦))
2 equeuclr 1948 . . . . 5 (𝑧 = 𝑦 → (𝑥 = 𝑦𝑥 = 𝑧))
32anc2ri 580 . . . 4 (𝑧 = 𝑦 → (𝑥 = 𝑦 → (𝑥 = 𝑧𝑧 = 𝑦)))
41, 3syli 39 . . 3 (𝑧 = 𝑥 → (𝑥 = 𝑦 → (𝑥 = 𝑧𝑧 = 𝑦)))
5 19.8a 2050 . . 3 ((𝑥 = 𝑧𝑧 = 𝑦) → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦))
64, 5syl6 35 . 2 (𝑧 = 𝑥 → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦)))
7 ax13 2247 . . 3 𝑧 = 𝑥 → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
8 ax6e 2248 . . . . 5 𝑧 𝑧 = 𝑦
98, 3eximii 1762 . . . 4 𝑧(𝑥 = 𝑦 → (𝑥 = 𝑧𝑧 = 𝑦))
10919.35i 1804 . . 3 (∀𝑧 𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦))
117, 10syl6 35 . 2 𝑧 = 𝑥 → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦)))
126, 11pm2.61i 176 1 (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  wal 1479  wex 1702
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-12 2045  ax-13 2244
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1703
This theorem is referenced by:  2ax6elem  2447
  Copyright terms: Public domain W3C validator