MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  wetrep Structured version   Visualization version   GIF version

Theorem wetrep 5652
Description: On a class well-ordered by membership, the membership predicate is transitive. (Contributed by NM, 22-Apr-1994.)
Assertion
Ref Expression
wetrep (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))

Proof of Theorem wetrep
StepHypRef Expression
1 weso 5650 . . 3 ( E We 𝐴 → E Or 𝐴)
2 sotr 5592 . . 3 (( E Or 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
31, 2sylan 591 . 2 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
4 epel 5562 . . 3 (𝑥 E 𝑦𝑥𝑦)
5 epel 5562 . . 3 (𝑦 E 𝑧𝑦𝑧)
64, 5anbi12i 639 . 2 ((𝑥 E 𝑦𝑦 E 𝑧) ↔ (𝑥𝑦𝑦𝑧))
7 epel 5562 . 2 (𝑥 E 𝑧𝑥𝑧)
83, 6, 73imtr3g 298 1 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101  wcel 2149   class class class wbr 5110   E cep 5558   Or wor 5566   We wwe 5611
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5258  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5111  df-opab 5175  df-eprel 5559  df-po 5567  df-so 5568  df-we 5614
This theorem is referenced by:  wefrc  5653  ordelord  6380
  Copyright terms: Public domain W3C validator