Theorem onprc 4673

Description: No set contains all ordinal numbers. Proposition 7.13 of [TakeutiZaring] p. 38. 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 4607), 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 4607	. . 3 ⊢ Ord On
2		ordirr 4663	. . 3 ⊢ (Ord On → ¬ On ∈ On)
3	1, 2	ax-mp 5	. 2 ⊢ ¬ On ∈ On
4		elong 4493	. . 3 ⊢ (On ∈ V → (On ∈ On ↔ Ord On))
5	1, 4	mpbiri 168	. 2 ⊢ (On ∈ V → On ∈ On)
6	3, 5	mto 668	1 ⊢ ¬ On ∈ V

Syntax hints:  ¬ wn 3   ∈ wcel 2203  Vcvv 2812  Ord word 4482  Oncon0 4483

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214  ax-setind 4658

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-v 2814  df-dif 3212  df-in 3216  df-ss 3223  df-sn 3694  df-uni 3914  df-tr 4208  df-iord 4486  df-on 4488

This theorem is referenced by:  sucon  4674