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

Theorem wetrep 5618
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 5616 . . 3 ( E We 𝐴 → E Or 𝐴)
2 sotr 5558 . . 3 (( E Or 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
31, 2sylan 586 . 2 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
4 epel 5528 . . 3 (𝑥 E 𝑦𝑥𝑦)
5 epel 5528 . . 3 (𝑦 E 𝑧𝑦𝑧)
64, 5anbi12i 634 . 2 ((𝑥 E 𝑦𝑦 E 𝑧) ↔ (𝑥𝑦𝑦𝑧))
7 epel 5528 . 2 (𝑥 E 𝑧𝑥𝑧)
83, 6, 73imtr3g 296 1 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1092  wcel 2119   class class class wbr 5079   E cep 5524   Or wor 5532   We wwe 5577
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-opab 5142  df-eprel 5525  df-po 5533  df-so 5534  df-we 5580
This theorem is referenced by:  wefrc  5619  ordelord  6339
  Copyright terms: Public domain W3C validator