Theorem onprc 7725

Description: No set contains all ordinal numbers. Proposition 7.13 of [TakeutiZaring] p. 38, but without using the Axiom of Regularity. This is also known as the Burali-Forti paradox (remark in [Enderton] p. 194). In 1897, Cesare Burali-Forti noticed that since the "set" of all ordinal numbers is an ordinal class (ordon 7724), it must be both an element of the set of all ordinal numbers yet greater than every such element. ZF set theory resolves this paradox by not allowing the class of all ordinal numbers to be a set (so instead it is a proper class). Here we prove the denial of its existence. (Contributed by NM, 18-May-1994.)

Assertion

Ref	Expression
onprc	⊢ ¬ On ∈ V

Proof of Theorem onprc

Step	Hyp	Ref	Expression
1		ordon 7724	. . 3 ⊢ Ord On
2		ordirr 6335	. . 3 ⊢ (Ord On → ¬ On ∈ On)
3	1, 2	ax-mp 5	. 2 ⊢ ¬ On ∈ On
4		elong 6325	. . 3 ⊢ (On ∈ V → (On ∈ On ↔ Ord On))
5	1, 4	mpbiri 258	. 2 ⊢ (On ∈ V → On ∈ On)
6	3, 5	mto 197	1 ⊢ ¬ On ∈ V

Syntax hints:  ¬ wn 3   ∈ wcel 2114  Vcvv 3430  Ord word 6316  Oncon0 6317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-tr 5194  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-ord 6320  df-on 6321

This theorem is referenced by:  ordeleqon  7729  ssonprc  7734  sucon  7750  orduninsuc  7787  omelon2  7823  tfr2b  8328  tz7.48-3  8376  infensuc  9086  ordfin  9143  zorn2lem4  10412  noprc  27762  xoromon  35248  fineqvomonb  35279  onvf1od  35305