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

Theorem equvini 2334
 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 1946 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 1935 . . . 4 (𝑧 = 𝑥 → (𝑥 = 𝑦𝑧 = 𝑦))
2 equeuclr 1937 . . . . 5 (𝑧 = 𝑦 → (𝑥 = 𝑦𝑥 = 𝑧))
32anc2ri 579 . . . 4 (𝑧 = 𝑦 → (𝑥 = 𝑦 → (𝑥 = 𝑧𝑧 = 𝑦)))
41, 3syli 38 . . 3 (𝑧 = 𝑥 → (𝑥 = 𝑦 → (𝑥 = 𝑧𝑧 = 𝑦)))
5 19.8a 2039 . . 3 ((𝑥 = 𝑧𝑧 = 𝑦) → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦))
64, 5syl6 34 . 2 (𝑧 = 𝑥 → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦)))
7 ax13 2237 . . 3 𝑧 = 𝑥 → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
8 ax6e 2238 . . . . 5 𝑧 𝑧 = 𝑦
98, 3eximii 1754 . . . 4 𝑧(𝑥 = 𝑦 → (𝑥 = 𝑧𝑧 = 𝑦))
10919.35i 1795 . . 3 (∀𝑧 𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦))
117, 10syl6 34 . 2 𝑧 = 𝑥 → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦)))
126, 11pm2.61i 175 1 (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧𝑧 = 𝑦))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383  ∀wal 1473  ∃wex 1695 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-12 2034  ax-13 2234 This theorem depends on definitions:  df-bi 196  df-an 385  df-ex 1696 This theorem is referenced by:  2ax6elem  2437
 Copyright terms: Public domain W3C validator