Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > diffifi | Unicode version |
Description: Subtracting one finite set from another produces a finite set. (Contributed by Jim Kingdon, 8-Sep-2021.) |
Ref | Expression |
---|---|
diffifi |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp2 982 | . 2 | |
2 | simp1 981 | . 2 | |
3 | simp3 983 | . 2 | |
4 | sseq1 3120 | . . . . . 6 | |
5 | 4 | anbi2d 459 | . . . . 5 |
6 | difeq2 3188 | . . . . . 6 | |
7 | 6 | eleq1d 2208 | . . . . 5 |
8 | 5, 7 | imbi12d 233 | . . . 4 |
9 | sseq1 3120 | . . . . . 6 | |
10 | 9 | anbi2d 459 | . . . . 5 |
11 | difeq2 3188 | . . . . . 6 | |
12 | 11 | eleq1d 2208 | . . . . 5 |
13 | 10, 12 | imbi12d 233 | . . . 4 |
14 | sseq1 3120 | . . . . . 6 | |
15 | 14 | anbi2d 459 | . . . . 5 |
16 | difeq2 3188 | . . . . . 6 | |
17 | 16 | eleq1d 2208 | . . . . 5 |
18 | 15, 17 | imbi12d 233 | . . . 4 |
19 | sseq1 3120 | . . . . . 6 | |
20 | 19 | anbi2d 459 | . . . . 5 |
21 | difeq2 3188 | . . . . . 6 | |
22 | 21 | eleq1d 2208 | . . . . 5 |
23 | 20, 22 | imbi12d 233 | . . . 4 |
24 | dif0 3433 | . . . . . . 7 | |
25 | 24 | eleq1i 2205 | . . . . . 6 |
26 | 25 | biimpri 132 | . . . . 5 |
27 | 26 | adantr 274 | . . . 4 |
28 | difun1 3336 | . . . . . 6 | |
29 | simprl 520 | . . . . . . . 8 | |
30 | simprr 521 | . . . . . . . . 9 | |
31 | 30 | unssad 3253 | . . . . . . . 8 |
32 | simplr 519 | . . . . . . . 8 | |
33 | 29, 31, 32 | mp2and 429 | . . . . . . 7 |
34 | vsnid 3557 | . . . . . . . . . 10 | |
35 | simprr 521 | . . . . . . . . . . . 12 | |
36 | 35 | unssbd 3254 | . . . . . . . . . . 11 |
37 | 36 | sseld 3096 | . . . . . . . . . 10 |
38 | 34, 37 | mpi 15 | . . . . . . . . 9 |
39 | 38 | adantllr 472 | . . . . . . . 8 |
40 | simpllr 523 | . . . . . . . 8 | |
41 | 39, 40 | eldifd 3081 | . . . . . . 7 |
42 | diffisn 6787 | . . . . . . 7 | |
43 | 33, 41, 42 | syl2anc 408 | . . . . . 6 |
44 | 28, 43 | eqeltrid 2226 | . . . . 5 |
45 | 44 | exp31 361 | . . . 4 |
46 | 8, 13, 18, 23, 27, 45 | findcard2s 6784 | . . 3 |
47 | 46 | imp 123 | . 2 |
48 | 1, 2, 3, 47 | syl12anc 1214 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 103 w3a 962 wceq 1331 wcel 1480 cdif 3068 cun 3069 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-er 6429 df-en 6635 df-fin 6637 |
This theorem is referenced by: unfiin 6814 fihashssdif 10564 hashdifpr 10566 fsumlessfi 11229 hash2iun1dif1 11249 |
Copyright terms: Public domain | W3C validator |