Theorem wl-ax11-lem1 35473

Description: A transitive law for variable identifying expressions. (Contributed by Wolf Lammen, 30-Jun-2019.)

Assertion

Ref	Expression
wl-ax11-lem1	⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 ↔ ∀𝑦 𝑦 = 𝑧))

Proof of Theorem wl-ax11-lem1

Step	Hyp	Ref	Expression
1		wl-aetr 35425	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑧))
2		wl-aetr 35425	. . 3 ⊢ (∀𝑦 𝑦 = 𝑥 → (∀𝑦 𝑦 = 𝑧 → ∀𝑥 𝑥 = 𝑧))
3	2	aecoms 2427	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦 𝑦 = 𝑧 → ∀𝑥 𝑥 = 𝑧))
4	1, 3	impbid 215	1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 ↔ ∀𝑦 𝑦 = 𝑧))

Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-10 2141  ax-12 2175  ax-13 2371

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1788  df-nf 1792

This theorem is referenced by:  wl-ax11-lem8  35480