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

Theorem elon 6344
Description: An ordinal number is an ordinal set. (Contributed by NM, 5-Jun-1994.)
Hypothesis
Ref Expression
elon.1 𝐴 ∈ V
Assertion
Ref Expression
elon (𝐴 ∈ On ↔ Ord 𝐴)

Proof of Theorem elon
StepHypRef Expression
1 elon.1 . 2 𝐴 ∈ V
2 elong 6343 . 2 (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
31, 2ax-mp 5 1 (𝐴 ∈ On ↔ Ord 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wcel 2109  Vcvv 3450  Ord word 6334  Oncon0 6335
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-v 3452  df-ss 3934  df-uni 4875  df-tr 5218  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-ord 6338  df-on 6339
This theorem is referenced by:  tron  6358  0elon  6390  smogt  8339  dfrecs3  8344  rdglim2  8403  omeulem1  8549  naddcllem  8643  isfinite2  9252  r0weon  9972  cflim3  10222  inar1  10735  addsproplem7  27889  ellimits  35905  dford3lem2  43023
  Copyright terms: Public domain W3C validator