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

Theorem elon 6341
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 6340 . 2 (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
31, 2ax-mp 5 1 (𝐴 ∈ On ↔ Ord 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wcel 2109  Vcvv 3447  Ord word 6331  Oncon0 6332
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 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-v 3449  df-ss 3931  df-uni 4872  df-tr 5215  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-ord 6335  df-on 6336
This theorem is referenced by:  tron  6355  0elon  6387  smogt  8336  dfrecs3  8341  rdglim2  8400  omeulem1  8546  naddcllem  8640  isfinite2  9245  r0weon  9965  cflim3  10215  inar1  10728  addsproplem7  27882  ellimits  35898  dford3lem2  43016
  Copyright terms: Public domain W3C validator