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

Theorem wetrep 5645
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 5643 . . 3 ( E We 𝐴 → E Or 𝐴)
2 sotr 5585 . . 3 (( E Or 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
31, 2sylan 591 . 2 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
4 epel 5555 . . 3 (𝑥 E 𝑦𝑥𝑦)
5 epel 5555 . . 3 (𝑦 E 𝑧𝑦𝑧)
64, 5anbi12i 639 . 2 ((𝑥 E 𝑦𝑦 E 𝑧) ↔ (𝑥𝑦𝑦𝑧))
7 epel 5555 . 2 (𝑥 E 𝑧𝑥𝑧)
83, 6, 73imtr3g 298 1 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101  wcel 2145   class class class wbr 5105   E cep 5551   Or wor 5559   We wwe 5604
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-eprel 5552  df-po 5560  df-so 5561  df-we 5607
This theorem is referenced by:  wefrc  5646  ordelord  6372
  Copyright terms: Public domain W3C validator