Theorem ax8 2114

Description: Proof of ax-8 2110 from ax8v1 2112 and ax8v2 2113, proving sufficiency of the conjunction of the latter two weakened versions of ax8v 2111, which is itself a weakened version of ax-8 2110. (Contributed by BJ, 7-Dec-2020.) (Proof shortened by Wolf Lammen, 11-Apr-2021.)

Assertion

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

Proof of Theorem ax8

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		equvinv 2033	. 2 ⊢ (𝑥 = 𝑦 ↔ ∃𝑡(𝑡 = 𝑥 ∧ 𝑡 = 𝑦))
2		ax8v2 2113	. . . . 5 ⊢ (𝑥 = 𝑡 → (𝑥 ∈ 𝑧 → 𝑡 ∈ 𝑧))
3	2	equcoms 2024	. . . 4 ⊢ (𝑡 = 𝑥 → (𝑥 ∈ 𝑧 → 𝑡 ∈ 𝑧))
4		ax8v1 2112	. . . 4 ⊢ (𝑡 = 𝑦 → (𝑡 ∈ 𝑧 → 𝑦 ∈ 𝑧))
5	3, 4	sylan9 507	. . 3 ⊢ ((𝑡 = 𝑥 ∧ 𝑡 = 𝑦) → (𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧))
6	5	exlimiv 1934	. 2 ⊢ (∃𝑡(𝑡 = 𝑥 ∧ 𝑡 = 𝑦) → (𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧))
7	1, 6	sylbi 216	1 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧))

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

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1784

This theorem is referenced by:  elequ1  2115  ax9ALT  2733  el  5287  axextdfeq  33679  ax8dfeq  33680  exnel  33684  bj-ax89  34786