 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 32496
 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 1930 . . 3 (𝑥 = 𝑦 → (𝑥 = 𝑧𝑦 = 𝑧))
21al2imi 1733 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑥 𝑦 = 𝑧))
3 axc11 2302 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑦 = 𝑧 → ∀𝑦 𝑦 = 𝑧))
42, 3syld 46 1 (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑧))
 Colors of variables: wff setvar class Syntax hints:   → wi 4  ∀wal 1473 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-12 2034  ax-13 2234 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701 This theorem is referenced by:  wl-ax11-lem1  32541  wl-ax11-lem3  32543
 Copyright terms: Public domain W3C validator