| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > unfiexmid | Unicode version | ||
| Description: If the union of any two finite sets is finite, excluded middle follows. Remark 8.1.17 of [AczelRathjen], p. 74. (Contributed by Mario Carneiro and Jim Kingdon, 5-Mar-2022.) |
| Ref | Expression |
|---|---|
| unfiexmid.1 |
|
| Ref | Expression |
|---|---|
| unfiexmid |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pr 3701 |
. . . . 5
| |
| 2 | unfiexmid.1 |
. . . . . . 7
| |
| 3 | 2 | rgen2a 2598 |
. . . . . 6
|
| 4 | df1o2 6674 |
. . . . . . . . . 10
| |
| 5 | rabeq 2807 |
. . . . . . . . . 10
| |
| 6 | 4, 5 | ax-mp 5 |
. . . . . . . . 9
|
| 7 | ordtriexmidlem 4646 |
. . . . . . . . 9
| |
| 8 | 6, 7 | eqeltri 2307 |
. . . . . . . 8
|
| 9 | snfig 7069 |
. . . . . . . 8
| |
| 10 | 8, 9 | ax-mp 5 |
. . . . . . 7
|
| 11 | 1onn 6766 |
. . . . . . . 8
| |
| 12 | snfig 7069 |
. . . . . . . 8
| |
| 13 | 11, 12 | ax-mp 5 |
. . . . . . 7
|
| 14 | uneq1 3370 |
. . . . . . . . 9
| |
| 15 | 14 | eleq1d 2303 |
. . . . . . . 8
|
| 16 | uneq2 3371 |
. . . . . . . . 9
| |
| 17 | 16 | eleq1d 2303 |
. . . . . . . 8
|
| 18 | 15, 17 | rspc2v 2937 |
. . . . . . 7
|
| 19 | 10, 13, 18 | mp2an 426 |
. . . . . 6
|
| 20 | 3, 19 | ax-mp 5 |
. . . . 5
|
| 21 | 1, 20 | eqeltri 2307 |
. . . 4
|
| 22 | 8 | elexi 2828 |
. . . . 5
|
| 23 | 22 | prid1 3802 |
. . . 4
|
| 24 | 11 | elexi 2828 |
. . . . 5
|
| 25 | 24 | prid2 3803 |
. . . 4
|
| 26 | fidceq 7137 |
. . . 4
| |
| 27 | 21, 23, 25, 26 | mp3an 1374 |
. . 3
|
| 28 | exmiddc 844 |
. . 3
| |
| 29 | 27, 28 | ax-mp 5 |
. 2
|
| 30 | 4 | eqeq2i 2245 |
. . . 4
|
| 31 | 0ex 4242 |
. . . . 5
| |
| 32 | biidd 172 |
. . . . 5
| |
| 33 | 31, 32 | rabsnt 3771 |
. . . 4
|
| 34 | 30, 33 | sylbi 121 |
. . 3
|
| 35 | df-rab 2531 |
. . . . 5
| |
| 36 | iba 300 |
. . . . . 6
| |
| 37 | 36 | abbi2dv 2355 |
. . . . 5
|
| 38 | 35, 37 | eqtr4id 2286 |
. . . 4
|
| 39 | 38 | con3i 637 |
. . 3
|
| 40 | 34, 39 | orim12i 767 |
. 2
|
| 41 | 29, 40 | ax-mp 5 |
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-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3046 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-br 4115 df-opab 4177 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-1o 6660 df-en 6989 df-fin 6991 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |