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

Theorem wecmpep 5655
Description: The elements of a class well-ordered by membership are comparable. (Contributed by NM, 17-May-1994.)
Assertion
Ref Expression
wecmpep (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦𝑥 = 𝑦𝑦𝑥))

Proof of Theorem wecmpep
StepHypRef Expression
1 weso 5654 . 2 ( E We 𝐴 → E Or 𝐴)
2 solin 5598 . . 3 (( E Or 𝐴 ∧ (𝑥𝐴𝑦𝐴)) → (𝑥 E 𝑦𝑥 = 𝑦𝑦 E 𝑥))
3 epel 5566 . . . 4 (𝑥 E 𝑦𝑥𝑦)
4 biid 264 . . . 4 (𝑥 = 𝑦𝑥 = 𝑦)
5 epel 5566 . . . 4 (𝑦 E 𝑥𝑦𝑥)
63, 4, 53orbi123i 1174 . . 3 ((𝑥 E 𝑦𝑥 = 𝑦𝑦 E 𝑥) ↔ (𝑥𝑦𝑥 = 𝑦𝑦𝑥))
72, 6sylib 221 . 2 (( E Or 𝐴 ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦𝑥 = 𝑦𝑦𝑥))
81, 7sylan 591 1 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦𝑥 = 𝑦𝑦𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3o 1102  wcel 2143   class class class wbr 5110   E cep 5562   Or wor 5570   We wwe 5615
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-eprel 5563  df-so 5572  df-we 5618
This theorem is referenced by:  tz7.7  6388
  Copyright terms: Public domain W3C validator