Users' Mathboxes Mathbox for Wolf Lammen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wl-aetr Structured version   Visualization version   GIF version

Theorem wl-aetr 38279
Description: A transitive law for variable identifying expressions. (Contributed by Wolf Lammen, 30-Jun-2019.)
Assertion
Ref Expression
wl-aetr (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑧))

Proof of Theorem wl-aetr
StepHypRef Expression
1 ax7 2049 . . 3 (𝑥 = 𝑦 → (𝑥 = 𝑧𝑦 = 𝑧))
21al2imi 1848 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑥 𝑦 = 𝑧))
3 axc11 2461 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑦 = 𝑧 → ∀𝑦 𝑦 = 𝑧))
42, 3syld 48 1 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑧))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wal 1568
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-10 2178  ax-12 2215  ax-13 2403
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator