Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > findcard2sd | Unicode version |
Description: Deduction form of finite set induction . (Contributed by Jim Kingdon, 14-Sep-2021.) |
Ref | Expression |
---|---|
findcard2sd.ch | |
findcard2sd.th | |
findcard2sd.ta | |
findcard2sd.et | |
findcard2sd.z | |
findcard2sd.i | |
findcard2sd.a |
Ref | Expression |
---|---|
findcard2sd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssid 2964 | . 2 | |
2 | findcard2sd.a | . . . 4 | |
3 | 2 | adantr 261 | . . 3 |
4 | sseq1 2966 | . . . . . 6 | |
5 | 4 | anbi2d 437 | . . . . 5 |
6 | findcard2sd.ch | . . . . 5 | |
7 | 5, 6 | imbi12d 223 | . . . 4 |
8 | sseq1 2966 | . . . . . 6 | |
9 | 8 | anbi2d 437 | . . . . 5 |
10 | findcard2sd.th | . . . . 5 | |
11 | 9, 10 | imbi12d 223 | . . . 4 |
12 | sseq1 2966 | . . . . . 6 | |
13 | 12 | anbi2d 437 | . . . . 5 |
14 | findcard2sd.ta | . . . . 5 | |
15 | 13, 14 | imbi12d 223 | . . . 4 |
16 | sseq1 2966 | . . . . . 6 | |
17 | 16 | anbi2d 437 | . . . . 5 |
18 | findcard2sd.et | . . . . 5 | |
19 | 17, 18 | imbi12d 223 | . . . 4 |
20 | findcard2sd.z | . . . . 5 | |
21 | 20 | adantr 261 | . . . 4 |
22 | simprl 483 | . . . . . . . 8 | |
23 | simprr 484 | . . . . . . . . 9 | |
24 | 23 | unssad 3120 | . . . . . . . 8 |
25 | 22, 24 | jca 290 | . . . . . . 7 |
26 | simpll 481 | . . . . . . . 8 | |
27 | id 19 | . . . . . . . . . . 11 | |
28 | vsnid 3403 | . . . . . . . . . . . 12 | |
29 | elun2 3111 | . . . . . . . . . . . 12 | |
30 | 28, 29 | mp1i 10 | . . . . . . . . . . 11 |
31 | 27, 30 | sseldd 2946 | . . . . . . . . . 10 |
32 | 31 | ad2antll 460 | . . . . . . . . 9 |
33 | simplr 482 | . . . . . . . . 9 | |
34 | 32, 33 | eldifd 2928 | . . . . . . . 8 |
35 | findcard2sd.i | . . . . . . . 8 | |
36 | 22, 26, 24, 34, 35 | syl22anc 1136 | . . . . . . 7 |
37 | 25, 36 | embantd 50 | . . . . . 6 |
38 | 37 | ex 108 | . . . . 5 |
39 | 38 | com23 72 | . . . 4 |
40 | 7, 11, 15, 19, 21, 39 | findcard2s 6347 | . . 3 |
41 | 3, 40 | mpcom 32 | . 2 |
42 | 1, 41 | mpan2 401 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 97 wb 98 wceq 1243 wcel 1393 cdif 2914 cun 2915 wss 2917 c0 3224 csn 3375 cfn 6221 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-if 3332 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-id 4030 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-er 6106 df-en 6222 df-fin 6224 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |