Mathbox for Richard Penner < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  epelon2 Structured version   Visualization version   GIF version

Theorem epelon2 40222
 Description: Over the ordinal numbers, one may define the relation 𝐴 E 𝐵 iff 𝐴 ∈ 𝐵 and one finds that, under this ordering, On is a well-ordered class, see epweon 7481. This is a weak form of epelg 5434 which only requires that we know 𝐵 to be a set. (Contributed by RP, 27-Sep-2023.)
Assertion
Ref Expression
epelon2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 E 𝐵𝐴𝐵))

Proof of Theorem epelon2
StepHypRef Expression
1 epelg 5434 . 2 (𝐵 ∈ On → (𝐴 E 𝐵𝐴𝐵))
21adantl 485 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 E 𝐵𝐴𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∈ wcel 2112   class class class wbr 5033   E cep 5432  Oncon0 6163 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pr 5298 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-v 3446  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-br 5034  df-opab 5096  df-eprel 5433 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator