| 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 3262 |
. 2
| |
| 2 | findcard2sd.a |
. . . 4
| |
| 3 | 2 | adantr 276 |
. . 3
|
| 4 | sseq1 3265 |
. . . . . 6
| |
| 5 | 4 | anbi2d 464 |
. . . . 5
|
| 6 | findcard2sd.ch |
. . . . 5
| |
| 7 | 5, 6 | imbi12d 234 |
. . . 4
|
| 8 | sseq1 3265 |
. . . . . 6
| |
| 9 | 8 | anbi2d 464 |
. . . . 5
|
| 10 | findcard2sd.th |
. . . . 5
| |
| 11 | 9, 10 | imbi12d 234 |
. . . 4
|
| 12 | sseq1 3265 |
. . . . . 6
| |
| 13 | 12 | anbi2d 464 |
. . . . 5
|
| 14 | findcard2sd.ta |
. . . . 5
| |
| 15 | 13, 14 | imbi12d 234 |
. . . 4
|
| 16 | sseq1 3265 |
. . . . . 6
| |
| 17 | 16 | anbi2d 464 |
. . . . 5
|
| 18 | findcard2sd.et |
. . . . 5
| |
| 19 | 17, 18 | imbi12d 234 |
. . . 4
|
| 20 | findcard2sd.z |
. . . . 5
| |
| 21 | 20 | adantr 276 |
. . . 4
|
| 22 | simprl 531 |
. . . . . . . 8
| |
| 23 | simprr 533 |
. . . . . . . . 9
| |
| 24 | 23 | unssad 3400 |
. . . . . . . 8
|
| 25 | 22, 24 | jca 306 |
. . . . . . 7
|
| 26 | simpll 527 |
. . . . . . . 8
| |
| 27 | id 19 |
. . . . . . . . . . 11
| |
| 28 | vsnid 3727 |
. . . . . . . . . . . 12
| |
| 29 | elun2 3391 |
. . . . . . . . . . . 12
| |
| 30 | 28, 29 | mp1i 10 |
. . . . . . . . . . 11
|
| 31 | 27, 30 | sseldd 3243 |
. . . . . . . . . 10
|
| 32 | 31 | ad2antll 491 |
. . . . . . . . 9
|
| 33 | simplr 529 |
. . . . . . . . 9
| |
| 34 | 32, 33 | eldifd 3224 |
. . . . . . . 8
|
| 35 | findcard2sd.i |
. . . . . . . 8
| |
| 36 | 22, 26, 24, 34, 35 | syl22anc 1275 |
. . . . . . 7
|
| 37 | 25, 36 | embantd 56 |
. . . . . 6
|
| 38 | 37 | ex 115 |
. . . . 5
|
| 39 | 38 | com23 78 |
. . . 4
|
| 40 | 7, 11, 15, 19, 21, 39 | findcard2s 7161 |
. . 3
|
| 41 | 3, 40 | mpcom 36 |
. 2
|
| 42 | 1, 41 | mpan2 425 |
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-coll 4231 ax-sep 4234 ax-nul 4242 ax-pow 4293 ax-pr 4328 ax-un 4560 ax-setind 4665 ax-iinf 4716 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 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-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3626 df-pw 3677 df-sn 3701 df-pr 3702 df-op 3704 df-uni 3921 df-int 3956 df-iun 3999 df-br 4116 df-opab 4178 df-mpt 4179 df-tr 4215 df-id 4420 df-iord 4493 df-on 4495 df-suc 4498 df-iom 4719 df-xp 4761 df-rel 4762 df-cnv 4763 df-co 4764 df-dm 4765 df-rn 4766 df-res 4767 df-ima 4768 df-iota 5318 df-fun 5360 df-fn 5361 df-f 5362 df-f1 5363 df-fo 5364 df-f1o 5365 df-fv 5366 df-er 6781 df-en 6990 df-fin 6992 |
| This theorem is referenced by: fimax2gtri 7173 finexdc 7174 elssdc 7176 unfidisj 7196 undifdc 7198 ssfirab 7211 fnfi 7217 mapfi 7228 fissfi 7230 dcfi 7282 difinfinf 7406 hashunlem 11197 hashxp 11220 fsumconst 12170 fsumrelem 12187 fprodcl2lem 12321 fprodconst 12336 fprodap0 12337 fprodrec 12345 fprodap0f 12352 fprodle 12356 fprodmodd 12357 ballotfilemcdc 13172 gfsumz 14114 gfsumcl 14115 iuncld 15111 fsumcncntop 15563 |
| Copyright terms: Public domain | W3C validator |