Theorem equveli 1642

Description: A variable elimination law for equality with no distinct variable requirements. (Compare equvini 1641.) (Contributed by NM, 1-Mar-2013.) (Revised by NM, 3-Feb-2015.)

Assertion

Ref	Expression
equveli	⊢ (∀𝑧(𝑧 = 𝑥 ↔ 𝑧 = 𝑦) → 𝑥 = 𝑦)

Proof of Theorem equveli

Step	Hyp	Ref	Expression
1		albiim 1376	. 2 ⊢ (∀𝑧(𝑧 = 𝑥 ↔ 𝑧 = 𝑦) ↔ (∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ∧ ∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥)))
2		ax12or 1403	. . 3 ⊢ (∀𝑧 𝑧 = 𝑥 ∨ (∀𝑧 𝑧 = 𝑦 ∨ ∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)))
3		equequ1 1598	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝑧 = 𝑥 ↔ 𝑥 = 𝑥))
4		equequ1 1598	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝑧 = 𝑦 ↔ 𝑥 = 𝑦))
5	3, 4	imbi12d 223	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) ↔ (𝑥 = 𝑥 → 𝑥 = 𝑦)))
6	5	sps 1430	. . . . . . 7 ⊢ (∀𝑧 𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) ↔ (𝑥 = 𝑥 → 𝑥 = 𝑦)))
7	6	dral2 1619	. . . . . 6 ⊢ (∀𝑧 𝑧 = 𝑥 → (∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ↔ ∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦)))
8		equid 1589	. . . . . . . . 9 ⊢ 𝑥 = 𝑥
9	8	a1bi 232	. . . . . . . 8 ⊢ (𝑥 = 𝑦 ↔ (𝑥 = 𝑥 → 𝑥 = 𝑦))
10	9	biimpri 124	. . . . . . 7 ⊢ ((𝑥 = 𝑥 → 𝑥 = 𝑦) → 𝑥 = 𝑦)
11	10	sps 1430	. . . . . 6 ⊢ (∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦) → 𝑥 = 𝑦)
12	7, 11	syl6bi 152	. . . . 5 ⊢ (∀𝑧 𝑧 = 𝑥 → (∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) → 𝑥 = 𝑦))
13	12	adantrd 264	. . . 4 ⊢ (∀𝑧 𝑧 = 𝑥 → ((∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ∧ ∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥)) → 𝑥 = 𝑦))
14		equequ1 1598	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝑧 = 𝑦 ↔ 𝑦 = 𝑦))
15		equequ1 1598	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝑧 = 𝑥 ↔ 𝑦 = 𝑥))
16	14, 15	imbi12d 223	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → ((𝑧 = 𝑦 → 𝑧 = 𝑥) ↔ (𝑦 = 𝑦 → 𝑦 = 𝑥)))
17	16	sps 1430	. . . . . . . 8 ⊢ (∀𝑧 𝑧 = 𝑦 → ((𝑧 = 𝑦 → 𝑧 = 𝑥) ↔ (𝑦 = 𝑦 → 𝑦 = 𝑥)))
18	17	dral1 1618	. . . . . . 7 ⊢ (∀𝑧 𝑧 = 𝑦 → (∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥) ↔ ∀𝑦(𝑦 = 𝑦 → 𝑦 = 𝑥)))
19		equid 1589	. . . . . . . . 9 ⊢ 𝑦 = 𝑦
20		ax-4 1400	. . . . . . . . 9 ⊢ (∀𝑦(𝑦 = 𝑦 → 𝑦 = 𝑥) → (𝑦 = 𝑦 → 𝑦 = 𝑥))
21	19, 20	mpi 15	. . . . . . . 8 ⊢ (∀𝑦(𝑦 = 𝑦 → 𝑦 = 𝑥) → 𝑦 = 𝑥)
22		equcomi 1592	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → 𝑥 = 𝑦)
23	21, 22	syl 14	. . . . . . 7 ⊢ (∀𝑦(𝑦 = 𝑦 → 𝑦 = 𝑥) → 𝑥 = 𝑦)
24	18, 23	syl6bi 152	. . . . . 6 ⊢ (∀𝑧 𝑧 = 𝑦 → (∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥) → 𝑥 = 𝑦))
25	24	adantld 263	. . . . 5 ⊢ (∀𝑧 𝑧 = 𝑦 → ((∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ∧ ∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥)) → 𝑥 = 𝑦))
26		hba1 1433	. . . . . . . . . 10 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → ∀𝑧∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
27		hbequid 1406	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑥 → ∀𝑧 𝑥 = 𝑥)
28	27	a1i 9	. . . . . . . . . 10 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → (𝑥 = 𝑥 → ∀𝑧 𝑥 = 𝑥))
29		ax-4 1400	. . . . . . . . . 10 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
30	26, 28, 29	hbimd 1465	. . . . . . . . 9 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → ((𝑥 = 𝑥 → 𝑥 = 𝑦) → ∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦)))
31	30	a5i 1435	. . . . . . . 8 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → ∀𝑧((𝑥 = 𝑥 → 𝑥 = 𝑦) → ∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦)))
32		equtr 1595	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑥 = 𝑥 → 𝑧 = 𝑥))
33		ax-8 1395	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑧 = 𝑦 → 𝑥 = 𝑦))
34	32, 33	imim12d 68	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))
35	34	ax-gen 1338	. . . . . . . 8 ⊢ ∀𝑧(𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))
36		19.26 1370	. . . . . . . . 9 ⊢ (∀𝑧(((𝑥 = 𝑥 → 𝑥 = 𝑦) → ∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦)) ∧ (𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))) ↔ (∀𝑧((𝑥 = 𝑥 → 𝑥 = 𝑦) → ∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦)) ∧ ∀𝑧(𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))))
37		spimth 1623	. . . . . . . . 9 ⊢ (∀𝑧(((𝑥 = 𝑥 → 𝑥 = 𝑦) → ∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦)) ∧ (𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))) → (∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))
38	36, 37	sylbir 125	. . . . . . . 8 ⊢ ((∀𝑧((𝑥 = 𝑥 → 𝑥 = 𝑦) → ∀𝑧(𝑥 = 𝑥 → 𝑥 = 𝑦)) ∧ ∀𝑧(𝑧 = 𝑥 → ((𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))) → (∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))
39	31, 35, 38	sylancl 392	. . . . . . 7 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → (∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) → (𝑥 = 𝑥 → 𝑥 = 𝑦)))
40	8, 39	mpii 39	. . . . . 6 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → (∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) → 𝑥 = 𝑦))
41	40	adantrd 264	. . . . 5 ⊢ (∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → ((∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ∧ ∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥)) → 𝑥 = 𝑦))
42	25, 41	jaoi 636	. . . 4 ⊢ ((∀𝑧 𝑧 = 𝑦 ∨ ∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)) → ((∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ∧ ∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥)) → 𝑥 = 𝑦))
43	13, 42	jaoi 636	. . 3 ⊢ ((∀𝑧 𝑧 = 𝑥 ∨ (∀𝑧 𝑧 = 𝑦 ∨ ∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))) → ((∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ∧ ∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥)) → 𝑥 = 𝑦))
44	2, 43	ax-mp 7	. 2 ⊢ ((∀𝑧(𝑧 = 𝑥 → 𝑧 = 𝑦) ∧ ∀𝑧(𝑧 = 𝑦 → 𝑧 = 𝑥)) → 𝑥 = 𝑦)
45	1, 44	sylbi 114	1 ⊢ (∀𝑧(𝑧 = 𝑥 ↔ 𝑧 = 𝑦) → 𝑥 = 𝑦)

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   ∨ wo 629  ∀wal 1241   = wceq 1243

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428

This theorem depends on definitions:  df-bi 110

This theorem is referenced by: (None)