Theorem equvini 1731

Description: A variable introduction law for equality. Lemma 15 of [Monk2] p. 109, however we do not require 𝑧 to be distinct from 𝑥 and 𝑦 (making the proof longer). (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Assertion

Ref	Expression
equvini	⊢ (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))

Proof of Theorem equvini

Step	Hyp	Ref	Expression
1		ax12or 1490	. 2 ⊢ (∀𝑧 𝑧 = 𝑥 ∨ (∀𝑧 𝑧 = 𝑦 ∨ ∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)))
2		equcomi 1680	. . . . . . 7 ⊢ (𝑧 = 𝑥 → 𝑥 = 𝑧)
3	2	alimi 1431	. . . . . 6 ⊢ (∀𝑧 𝑧 = 𝑥 → ∀𝑧 𝑥 = 𝑧)
4		a9e 1674	. . . . . 6 ⊢ ∃𝑧 𝑧 = 𝑦
5	3, 4	jctir 311	. . . . 5 ⊢ (∀𝑧 𝑧 = 𝑥 → (∀𝑧 𝑥 = 𝑧 ∧ ∃𝑧 𝑧 = 𝑦))
6	5	a1d 22	. . . 4 ⊢ (∀𝑧 𝑧 = 𝑥 → (𝑥 = 𝑦 → (∀𝑧 𝑥 = 𝑧 ∧ ∃𝑧 𝑧 = 𝑦)))
7		19.29 1599	. . . 4 ⊢ ((∀𝑧 𝑥 = 𝑧 ∧ ∃𝑧 𝑧 = 𝑦) → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))
8	6, 7	syl6 33	. . 3 ⊢ (∀𝑧 𝑧 = 𝑥 → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
9		a9e 1674	. . . . . . . 8 ⊢ ∃𝑧 𝑧 = 𝑥
10	2	eximi 1579	. . . . . . . 8 ⊢ (∃𝑧 𝑧 = 𝑥 → ∃𝑧 𝑥 = 𝑧)
11	9, 10	ax-mp 5	. . . . . . 7 ⊢ ∃𝑧 𝑥 = 𝑧
12	11	2a1i 27	. . . . . 6 ⊢ (∀𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → ∃𝑧 𝑥 = 𝑧))
13	12	anc2ri 328	. . . . 5 ⊢ (∀𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → (∃𝑧 𝑥 = 𝑧 ∧ ∀𝑧 𝑧 = 𝑦)))
14		19.29r 1600	. . . . 5 ⊢ ((∃𝑧 𝑥 = 𝑧 ∧ ∀𝑧 𝑧 = 𝑦) → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))
15	13, 14	syl6 33	. . . 4 ⊢ (∀𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
16		ax-8 1482	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑦 → 𝑧 = 𝑦))
17	16	anc2li 327	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑦 → (𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
18	17	equcoms 1684	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑥 = 𝑦 → (𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
19	18	com12 30	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑧 = 𝑥 → (𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
20	19	alimi 1431	. . . . . . . 8 ⊢ (∀𝑧 𝑥 = 𝑦 → ∀𝑧(𝑧 = 𝑥 → (𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
21		exim 1578	. . . . . . . 8 ⊢ (∀𝑧(𝑧 = 𝑥 → (𝑥 = 𝑧 ∧ 𝑧 = 𝑦)) → (∃𝑧 𝑧 = 𝑥 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
22	20, 21	syl 14	. . . . . . 7 ⊢ (∀𝑧 𝑥 = 𝑦 → (∃𝑧 𝑧 = 𝑥 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
23	9, 22	mpi 15	. . . . . 6 ⊢ (∀𝑧 𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))
24	23	imim2i 12	. . . . 5 ⊢ ((𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
25	24	sps 1517	. . . 4 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
26	15, 25	jaoi 705	. . 3 ⊢ ((∀𝑧 𝑧 = 𝑦 ∨ ∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)) → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
27	8, 26	jaoi 705	. 2 ⊢ ((∀𝑧 𝑧 = 𝑥 ∨ (∀𝑧 𝑧 = 𝑦 ∨ ∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))) → (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦)))
28	1, 27	ax-mp 5	1 ⊢ (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑧 = 𝑦))

Syntax hints:   → wi 4   ∧ wa 103   ∨ wo 697  ∀wal 1329   = wceq 1331  ∃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:  sbequi  1811  equvin  1835