Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > unfidisj | Unicode version |
Description: The union of two disjoint finite sets is finite. (Contributed by Jim Kingdon, 25-Feb-2022.) |
Ref | Expression |
---|---|
unfidisj |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uneq2 3224 | . . 3 | |
2 | 1 | eleq1d 2208 | . 2 |
3 | uneq2 3224 | . . 3 | |
4 | 3 | eleq1d 2208 | . 2 |
5 | uneq2 3224 | . . 3 | |
6 | 5 | eleq1d 2208 | . 2 |
7 | uneq2 3224 | . . 3 | |
8 | 7 | eleq1d 2208 | . 2 |
9 | un0 3396 | . . 3 | |
10 | simp1 981 | . . 3 | |
11 | 9, 10 | eqeltrid 2226 | . 2 |
12 | unass 3233 | . . . 4 | |
13 | simpr 109 | . . . . 5 | |
14 | vex 2689 | . . . . . 6 | |
15 | 14 | a1i 9 | . . . . 5 |
16 | simplrr 525 | . . . . . . . . 9 | |
17 | 16 | eldifad 3082 | . . . . . . . 8 |
18 | simp3 983 | . . . . . . . . 9 | |
19 | 18 | ad3antrrr 483 | . . . . . . . 8 |
20 | minel 3424 | . . . . . . . 8 | |
21 | 17, 19, 20 | syl2anc 408 | . . . . . . 7 |
22 | 16 | eldifbd 3083 | . . . . . . 7 |
23 | ioran 741 | . . . . . . 7 | |
24 | 21, 22, 23 | sylanbrc 413 | . . . . . 6 |
25 | elun 3217 | . . . . . 6 | |
26 | 24, 25 | sylnibr 666 | . . . . 5 |
27 | unsnfi 6807 | . . . . 5 | |
28 | 13, 15, 26, 27 | syl3anc 1216 | . . . 4 |
29 | 12, 28 | eqeltrrid 2227 | . . 3 |
30 | 29 | ex 114 | . 2 |
31 | simp2 982 | . 2 | |
32 | 2, 4, 6, 8, 11, 30, 31 | findcard2sd 6786 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 103 wo 697 w3a 962 wceq 1331 wcel 1480 cvv 2686 cdif 3068 cun 3069 cin 3070 wss 3071 c0 3363 csn 3527 cfn 6634 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-iord 4288 df-on 4290 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-1o 6313 df-er 6429 df-en 6635 df-fin 6637 |
This theorem is referenced by: unfiin 6814 prfidisj 6815 tpfidisj 6816 xpfi 6818 iunfidisj 6834 hashunlem 10550 hashun 10551 fsumsplitsnun 11188 fsum2dlemstep 11203 fsumconst 11223 |
Copyright terms: Public domain | W3C validator |