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

Theorem elon2 6262
Description: An ordinal number is an ordinal set. (Contributed by NM, 8-Feb-2004.)
Assertion
Ref Expression
elon2 (𝐴 ∈ On ↔ (Ord 𝐴𝐴 ∈ V))

Proof of Theorem elon2
StepHypRef Expression
1 elex 3440 . . 3 (𝐴 ∈ On → 𝐴 ∈ V)
2 elong 6259 . . 3 (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
31, 2biadanii 818 . 2 (𝐴 ∈ On ↔ (𝐴 ∈ V ∧ Ord 𝐴))
43biancomi 462 1 (𝐴 ∈ On ↔ (Ord 𝐴𝐴 ∈ V))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395  wcel 2108  Vcvv 3422  Ord word 6250  Oncon0 6251
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-v 3424  df-in 3890  df-ss 3900  df-uni 4837  df-tr 5188  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254  df-on 6255
This theorem is referenced by:  sucelon  7639  tfrlem12  8191  tfrlem13  8192  gruina  10505  bdayimaon  33823  noeta2  33906  etasslt2  33935  oldlim  33996
  Copyright terms: Public domain W3C validator