Theorem elon2 6375

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 3478	. . 3 ⊢ (𝐴 ∈ On → 𝐴 ∈ V)
2		elong 6372	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴))
3	1, 2	biadanii 834	. 2 ⊢ (𝐴 ∈ On ↔ (𝐴 ∈ V ∧ Ord 𝐴))
4	3	biancomi 468	1 ⊢ (𝐴 ∈ On ↔ (Ord 𝐴 ∧ 𝐴 ∈ V))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∈ wcel 2146  Vcvv 3457  Ord word 6363  Oncon0 6364

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-v 3459  df-ss 3923  df-uni 4875  df-tr 5221  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-ord 6367  df-on 6368

This theorem is used by:  ordsuci  7809  onsucb  7815  tfrlem12  8378  tfrlem13  8379  gruina  10814  bdayimaon  27888  noeta2  27985  etaslts2  28018  oldlim  28111  bdayons  28500  oaltublim  44050  omord2lim  44060  oaun3lem3  44136  nadd2rabon  44147  nadd1rabon  44151