Theorem ax13 2410

Description: Derive ax-13 2407 from ax13v 2408 and Tarski's FOL. This shows that the weakening in ax13v 2408 is still sufficient for a complete system. Preferably, use the weaker ax13w 2174 to avoid the propagation of ax-13 2407. (Contributed by NM, 21-Dec-2015.) (Proof shortened by Wolf Lammen, 31-Jan-2018.) Reduce axiom usage. (Revised by Wolf Lammen, 2-Jun-2021.) (New usage is discouraged.)

Assertion

Ref	Expression
ax13	⊢ (¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))

Proof of Theorem ax13

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		equvinv 2062	. . . 4 ⊢ (𝑦 = 𝑧 ↔ ∃𝑤(𝑤 = 𝑦 ∧ 𝑤 = 𝑧))
2		ax13lem1 2409	. . . . . . . . 9 ⊢ (¬ 𝑥 = 𝑦 → (𝑤 = 𝑦 → ∀𝑥 𝑤 = 𝑦))
3	2	imp 412	. . . . . . . 8 ⊢ ((¬ 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) → ∀𝑥 𝑤 = 𝑦)
4		ax13lem1 2409	. . . . . . . . 9 ⊢ (¬ 𝑥 = 𝑧 → (𝑤 = 𝑧 → ∀𝑥 𝑤 = 𝑧))
5	4	imp 412	. . . . . . . 8 ⊢ ((¬ 𝑥 = 𝑧 ∧ 𝑤 = 𝑧) → ∀𝑥 𝑤 = 𝑧)
6		ax7v1 2043	. . . . . . . . . 10 ⊢ (𝑤 = 𝑦 → (𝑤 = 𝑧 → 𝑦 = 𝑧))
7	6	imp 412	. . . . . . . . 9 ⊢ ((𝑤 = 𝑦 ∧ 𝑤 = 𝑧) → 𝑦 = 𝑧)
8	7	alanimi 1849	. . . . . . . 8 ⊢ ((∀𝑥 𝑤 = 𝑦 ∧ ∀𝑥 𝑤 = 𝑧) → ∀𝑥 𝑦 = 𝑧)
9	3, 5, 8	syl2an 608	. . . . . . 7 ⊢ (((¬ 𝑥 = 𝑦 ∧ 𝑤 = 𝑦) ∧ (¬ 𝑥 = 𝑧 ∧ 𝑤 = 𝑧)) → ∀𝑥 𝑦 = 𝑧)
10	9	an4s 673	. . . . . 6 ⊢ (((¬ 𝑥 = 𝑦 ∧ ¬ 𝑥 = 𝑧) ∧ (𝑤 = 𝑦 ∧ 𝑤 = 𝑧)) → ∀𝑥 𝑦 = 𝑧)
11	10	ex 418	. . . . 5 ⊢ ((¬ 𝑥 = 𝑦 ∧ ¬ 𝑥 = 𝑧) → ((𝑤 = 𝑦 ∧ 𝑤 = 𝑧) → ∀𝑥 𝑦 = 𝑧))
12	11	exlimdv 1966	. . . 4 ⊢ ((¬ 𝑥 = 𝑦 ∧ ¬ 𝑥 = 𝑧) → (∃𝑤(𝑤 = 𝑦 ∧ 𝑤 = 𝑧) → ∀𝑥 𝑦 = 𝑧))
13	1, 12	biimtrid 245	. . 3 ⊢ ((¬ 𝑥 = 𝑦 ∧ ¬ 𝑥 = 𝑧) → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))
14	13	ex 418	. 2 ⊢ (¬ 𝑥 = 𝑦 → (¬ 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)))
15		ax13b 2065	. 2 ⊢ ((¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) ↔ (¬ 𝑥 = 𝑦 → (¬ 𝑥 = 𝑧 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))))
16	14, 15	mpbir 234	1 ⊢ (¬ 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ∃wex 1812

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-13 2407

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813

This theorem is used by:  equvini  2490