Theorem equvin 1835

Description: A variable introduction law for equality. Lemma 15 of [Monk2] p. 109. (Contributed by NM, 5-Aug-1993.)

Assertion

Ref	Expression
equvin	⊢ (𝑥 = 𝑦 ↔ ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))

Distinct variable groups:   𝑥,𝑧   𝑦,𝑧

Proof of Theorem equvin

Step	Hyp	Ref	Expression
1		equvini 1731	. 2 ⊢ (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))
2		ax-17 1506	. . 3 ⊢ (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)
3		equtr 1685	. . . 4 ⊢ (𝑥 = 𝑧 → (𝑧 = 𝑦 → 𝑥 = 𝑦))
4	3	imp 123	. . 3 ⊢ ((𝑥 = 𝑧 ∧ 𝑧 = 𝑦) → 𝑥 = 𝑦)
5	2, 4	exlimih 1572	. 2 ⊢ (∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦) → 𝑥 = 𝑦)
6	1, 5	impbii 125	1 ⊢ (𝑥 = 𝑦 ↔ ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))

Syntax hints:   ∧ wa 103   ↔ wb 104  ∃wex 1468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-i12 1485  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514

This theorem depends on definitions:  df-bi 116

This theorem is referenced by: (None)