![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > onprc | GIF version |
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 4410), 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.) |
Ref | Expression |
---|---|
onprc | ⊢ ¬ On ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordon 4410 | . . 3 ⊢ Ord On | |
2 | ordirr 4465 | . . 3 ⊢ (Ord On → ¬ On ∈ On) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ ¬ On ∈ On |
4 | elong 4303 | . . 3 ⊢ (On ∈ V → (On ∈ On ↔ Ord On)) | |
5 | 1, 4 | mpbiri 167 | . 2 ⊢ (On ∈ V → On ∈ On) |
6 | 3, 5 | mto 652 | 1 ⊢ ¬ On ∈ V |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 ∈ wcel 1481 Vcvv 2689 Ord word 4292 Oncon0 4293 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-setind 4460 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-v 2691 df-dif 3078 df-in 3082 df-ss 3089 df-sn 3538 df-uni 3745 df-tr 4035 df-iord 4296 df-on 4298 |
This theorem is referenced by: sucon 4476 |
Copyright terms: Public domain | W3C validator |