| 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 3716 |
. . . . 5
| |
| 2 | unfiexmid.1 |
. . . . . . 7
| |
| 3 | 2 | rgen2a 2604 |
. . . . . 6
|
| 4 | df1o2 6701 |
. . . . . . . . . 10
| |
| 5 | rabeq 2813 |
. . . . . . . . . 10
| |
| 6 | 4, 5 | ax-mp 5 |
. . . . . . . . 9
|
| 7 | ordtriexmidlem 4666 |
. . . . . . . . 9
| |
| 8 | 6, 7 | eqeltri 2311 |
. . . . . . . 8
|
| 9 | snfig 7103 |
. . . . . . . 8
| |
| 10 | 8, 9 | ax-mp 5 |
. . . . . . 7
|
| 11 | 1onn 6793 |
. . . . . . . 8
| |
| 12 | snfig 7103 |
. . . . . . . 8
| |
| 13 | 11, 12 | ax-mp 5 |
. . . . . . 7
|
| 14 | uneq1 3376 |
. . . . . . . . 9
| |
| 15 | 14 | eleq1d 2307 |
. . . . . . . 8
|
| 16 | uneq2 3377 |
. . . . . . . . 9
| |
| 17 | 16 | eleq1d 2307 |
. . . . . . . 8
|
| 18 | 15, 17 | rspc2v 2943 |
. . . . . . 7
|
| 19 | 10, 13, 18 | mp2an 430 |
. . . . . 6
|
| 20 | 3, 19 | ax-mp 5 |
. . . . 5
|
| 21 | 1, 20 | eqeltri 2311 |
. . . 4
|
| 22 | 8 | elexi 2834 |
. . . . 5
|
| 23 | 22 | prid1 3817 |
. . . 4
|
| 24 | 11 | elexi 2834 |
. . . . 5
|
| 25 | 24 | prid2 3818 |
. . . 4
|
| 26 | fidceq 7171 |
. . . 4
| |
| 27 | 21, 23, 25, 26 | mp3an 1378 |
. . 3
|
| 28 | exmiddc 848 |
. . 3
| |
| 29 | 27, 28 | ax-mp 5 |
. 2
|
| 30 | 4 | eqeq2i 2249 |
. . . 4
|
| 31 | 0ex 4260 |
. . . . 5
| |
| 32 | biidd 172 |
. . . . 5
| |
| 33 | 31, 32 | rabsnt 3786 |
. . . 4
|
| 34 | 30, 33 | sylbi 121 |
. . 3
|
| 35 | df-rab 2537 |
. . . . 5
| |
| 36 | iba 300 |
. . . . . 6
| |
| 37 | 36 | abbi2dv 2359 |
. . . . 5
|
| 38 | 35, 37 | eqtr4id 2290 |
. . . 4
|
| 39 | 38 | con3i 641 |
. . 3
|
| 40 | 34, 39 | orim12i 771 |
. 2
|
| 41 | 29, 40 | ax-mp 5 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-1o 6687 df-en 7023 df-fin 7025 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |