| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ordtriexmid | Unicode version | ||
| Description: Ordinal trichotomy
implies the law of the excluded middle (that is,
decidability of an arbitrary proposition).
This theorem is stated in "Constructive ordinals", [Crosilla], p. "Set-theoretic principles incompatible with intuitionistic logic". Also see exmidontri 7500 which is much the same theorem but biconditionalized and using the EXMID notation. (Contributed by Mario Carneiro and Jim Kingdon, 14-Nov-2018.) |
| Ref | Expression |
|---|---|
| ordtriexmid.1 |
|
| Ref | Expression |
|---|---|
| ordtriexmid |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | noel 3500 |
. . . 4
| |
| 2 | ordtriexmidlem 4623 |
. . . . . 6
| |
| 3 | eleq1 2294 |
. . . . . . . 8
| |
| 4 | eqeq1 2238 |
. . . . . . . 8
| |
| 5 | eleq2 2295 |
. . . . . . . 8
| |
| 6 | 3, 4, 5 | 3orbi123d 1348 |
. . . . . . 7
|
| 7 | 0elon 4495 |
. . . . . . . 8
| |
| 8 | 0ex 4221 |
. . . . . . . . 9
| |
| 9 | eleq1 2294 |
. . . . . . . . . . 11
| |
| 10 | 9 | anbi2d 464 |
. . . . . . . . . 10
|
| 11 | eleq2 2295 |
. . . . . . . . . . 11
| |
| 12 | eqeq2 2241 |
. . . . . . . . . . 11
| |
| 13 | eleq1 2294 |
. . . . . . . . . . 11
| |
| 14 | 11, 12, 13 | 3orbi123d 1348 |
. . . . . . . . . 10
|
| 15 | 10, 14 | imbi12d 234 |
. . . . . . . . 9
|
| 16 | ordtriexmid.1 |
. . . . . . . . . 10
| |
| 17 | 16 | rspec2 2622 |
. . . . . . . . 9
|
| 18 | 8, 15, 17 | vtocl 2859 |
. . . . . . . 8
|
| 19 | 7, 18 | mpan2 425 |
. . . . . . 7
|
| 20 | 6, 19 | vtoclga 2871 |
. . . . . 6
|
| 21 | 2, 20 | ax-mp 5 |
. . . . 5
|
| 22 | 3orass 1008 |
. . . . 5
| |
| 23 | 21, 22 | mpbi 145 |
. . . 4
|
| 24 | 1, 23 | mtpor 1470 |
. . 3
|
| 25 | ordtriexmidlem2 4624 |
. . . 4
| |
| 26 | 8 | snid 3704 |
. . . . . 6
|
| 27 | biidd 172 |
. . . . . . 7
| |
| 28 | 27 | elrab3 2964 |
. . . . . 6
|
| 29 | 26, 28 | ax-mp 5 |
. . . . 5
|
| 30 | 29 | biimpi 120 |
. . . 4
|
| 31 | 25, 30 | orim12i 767 |
. . 3
|
| 32 | 24, 31 | ax-mp 5 |
. 2
|
| 33 | orcom 736 |
. 2
| |
| 34 | 32, 33 | mpbir 146 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-14 2205 ax-ext 2213 ax-sep 4212 ax-nul 4220 ax-pow 4270 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-rab 2520 df-v 2805 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-uni 3899 df-tr 4193 df-iord 4469 df-on 4471 df-suc 4474 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |