Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  onprc Unicode version

Theorem onprc 4276
 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 4212), 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

Proof of Theorem onprc
StepHypRef Expression
1 ordon 4212 . . 3
2 ordirr 4267 . . 3
31, 2ax-mp 7 . 2
4 elong 4110 . . 3
51, 4mpbiri 157 . 2
63, 5mto 588 1
 Colors of variables: wff set class Syntax hints:   wn 3   wcel 1393  cvv 2557   word 4099  con0 4100 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-setind 4262 This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-v 2559  df-dif 2920  df-in 2924  df-ss 2931  df-sn 3381  df-uni 3581  df-tr 3855  df-iord 4103  df-on 4105 This theorem is referenced by:  sucon  4277
 Copyright terms: Public domain W3C validator