Theorem ax7 2035

Description: Proof of ax-7 2027 from ax7v1 2029 and ax7v2 2030 (and earlier axioms), proving sufficiency of the conjunction of the latter two weakened versions of ax7v 2028, which is itself a weakened version of ax-7 2027.

Note that the weakened version of ax-7 2027 obtained by adding a disjoint variable condition on 𝑥, 𝑧 (resp. on 𝑦, 𝑧) does not permit, together with the other axioms, to prove reflexivity (resp. symmetry). (Contributed by BJ, 7-Dec-2020.)

Assertion

Ref	Expression
ax7	⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 → 𝑦 = 𝑧))

Proof of Theorem ax7

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax7v2 2030	. . . 4 ⊢ (𝑥 = 𝑡 → (𝑥 = 𝑦 → 𝑡 = 𝑦))
2		ax7v2 2030	. . . 4 ⊢ (𝑥 = 𝑡 → (𝑥 = 𝑧 → 𝑡 = 𝑧))
3		ax7v1 2029	. . . . . 6 ⊢ (𝑡 = 𝑦 → (𝑡 = 𝑧 → 𝑦 = 𝑧))
4	3	imp 410	. . . . 5 ⊢ ((𝑡 = 𝑦 ∧ 𝑡 = 𝑧) → 𝑦 = 𝑧)
5	4	a1i 11	. . . 4 ⊢ (𝑥 = 𝑡 → ((𝑡 = 𝑦 ∧ 𝑡 = 𝑧) → 𝑦 = 𝑧))
6	1, 2, 5	syl2and 617	. . 3 ⊢ (𝑥 = 𝑡 → ((𝑥 = 𝑦 ∧ 𝑥 = 𝑧) → 𝑦 = 𝑧))
7		ax6evr 2034	. . 3 ⊢ ∃𝑡 𝑥 = 𝑡
8	6, 7	exlimiiv 1950	. 2 ⊢ ((𝑥 = 𝑦 ∧ 𝑥 = 𝑧) → 𝑦 = 𝑧)
9	8	ex 416	1 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 → 𝑦 = 𝑧))

Syntax hints:   → wi 4   ∧ wa 399

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1799

This theorem is referenced by:  equcomi  2036  equtr  2040  equequ1  2044  cbvaev  2074  aeveq  2077  axc16i  2466  equvel  2486  mo4  2592  axextnd  10546  in-ax8  36548  ss-ax8  36549  wl-aetr  37996  wl-exeq  38001  wl-aleq  38002  wl-nfeqfb  38003  equcomi1  39488  hbequid  39497  equidqe  39510  aev-o  39519  ax6e2eq  45097  ax6e2eqVD  45446  et-equeucl  47410  2reu8i  47671