Theorem ax9 2127

Description: Proof of ax-9 2123 from ax9v1 2125 and ax9v2 2126, proving sufficiency of the conjunction of the latter two weakened versions of ax9v 2124, which is itself a weakened version of ax-9 2123. (Contributed by BJ, 7-Dec-2020.) (Proof shortened by Wolf Lammen, 11-Apr-2021.)

Assertion

Ref	Expression
ax9	⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦))

Proof of Theorem ax9

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		equvinv 2030	. 2 ⊢ (𝑥 = 𝑦 ↔ ∃𝑡(𝑡 = 𝑥 ∧ 𝑡 = 𝑦))
2		ax9v2 2126	. . . . 5 ⊢ (𝑥 = 𝑡 → (𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑡))
3	2	equcoms 2021	. . . 4 ⊢ (𝑡 = 𝑥 → (𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑡))
4		ax9v1 2125	. . . 4 ⊢ (𝑡 = 𝑦 → (𝑧 ∈ 𝑡 → 𝑧 ∈ 𝑦))
5	3, 4	sylan9 507	. . 3 ⊢ ((𝑡 = 𝑥 ∧ 𝑡 = 𝑦) → (𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦))
6	5	exlimiv 1931	. 2 ⊢ (∃𝑡(𝑡 = 𝑥 ∧ 𝑡 = 𝑦) → (𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦))
7	1, 6	sylbi 217	1 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦))

Syntax hints:   → wi 4   ∧ wa 395  ∃wex 1780

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-9 2123

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781

This theorem is referenced by:  elequ2  2128  elALT2  5309  fv3  6846  elirrvOLD  9491  in-ax8  36289  ss-ax8  36290  bj-ax89  36743  axc11next  44523