Theorem elon2 6322

Description: An ordinal number is an ordinal set. Part of Definition 1.2 of [Schloeder] p. 1. (Contributed by NM, 8-Feb-2004.)

Assertion

Ref	Expression
elon2	⊢ (𝐴 ∈ On ↔ (Ord 𝐴 ∧ 𝐴 ∈ V))

Proof of Theorem elon2

Step	Hyp	Ref	Expression
1		elex 3459	. . 3 ⊢ (𝐴 ∈ On → 𝐴 ∈ V)
2		elong 6319	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
3	1, 2	biadanii 821	. 2 ⊢ (𝐴 ∈ On ↔ (𝐴 ∈ V ∧ Ord 𝐴))
4	3	biancomi 462	1 ⊢ (𝐴 ∈ On ↔ (Ord 𝐴 ∧ 𝐴 ∈ V))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∈ wcel 2109  Vcvv 3438  Ord word 6310  Oncon0 6311

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 3440  df-ss 3922  df-uni 4862  df-tr 5203  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-ord 6314  df-on 6315

This theorem is referenced by:  ordsuci  7748  onsucb  7756  tfrlem12  8318  tfrlem13  8319  gruina  10731  bdayimaon  27621  noeta2  27713  etasslt2  27743  oldlim  27819  bdayon  28196  oaltublim  43266  omord2lim  43276  oaun3lem3  43352  nadd2rabon  43363  nadd1rabon  43367