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

Theorem elon 6331
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 6330 . 2 (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
31, 2ax-mp 5 1 (𝐴 ∈ On ↔ Ord 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wcel 2107  Vcvv 3448  Ord word 6321  Oncon0 6322
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2708
This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2715  df-cleq 2729  df-clel 2815  df-ral 3066  df-v 3450  df-in 3922  df-ss 3932  df-uni 4871  df-tr 5228  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-ord 6325  df-on 6326
This theorem is referenced by:  tron  6345  0elon  6376  smogt  8318  dfrecs3  8323  dfrecs3OLD  8324  rdglim2  8383  omeulem1  8534  naddcllem  8627  isfinite2  9252  r0weon  9955  cflim3  10205  inar1  10718  addsproplem7  27309  ellimits  34524  dford3lem2  41380
  Copyright terms: Public domain W3C validator