| 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 3268 |
. 2
| |
| 2 | findcard2sd.a |
. . . 4
| |
| 3 | 2 | adantr 276 |
. . 3
|
| 4 | sseq1 3271 |
. . . . . 6
| |
| 5 | 4 | anbi2d 468 |
. . . . 5
|
| 6 | findcard2sd.ch |
. . . . 5
| |
| 7 | 5, 6 | imbi12d 234 |
. . . 4
|
| 8 | sseq1 3271 |
. . . . . 6
| |
| 9 | 8 | anbi2d 468 |
. . . . 5
|
| 10 | findcard2sd.th |
. . . . 5
| |
| 11 | 9, 10 | imbi12d 234 |
. . . 4
|
| 12 | sseq1 3271 |
. . . . . 6
| |
| 13 | 12 | anbi2d 468 |
. . . . 5
|
| 14 | findcard2sd.ta |
. . . . 5
| |
| 15 | 13, 14 | imbi12d 234 |
. . . 4
|
| 16 | sseq1 3271 |
. . . . . 6
| |
| 17 | 16 | anbi2d 468 |
. . . . 5
|
| 18 | findcard2sd.et |
. . . . 5
| |
| 19 | 17, 18 | imbi12d 234 |
. . . 4
|
| 20 | findcard2sd.z |
. . . . 5
| |
| 21 | 20 | adantr 276 |
. . . 4
|
| 22 | simprl 535 |
. . . . . . . 8
| |
| 23 | simprr 537 |
. . . . . . . . 9
| |
| 24 | 23 | unssad 3406 |
. . . . . . . 8
|
| 25 | 22, 24 | jca 306 |
. . . . . . 7
|
| 26 | simpll 531 |
. . . . . . . 8
| |
| 27 | id 19 |
. . . . . . . . . . 11
| |
| 28 | vsnid 3741 |
. . . . . . . . . . . 12
| |
| 29 | elun2 3397 |
. . . . . . . . . . . 12
| |
| 30 | 28, 29 | mp1i 10 |
. . . . . . . . . . 11
|
| 31 | 27, 30 | sseldd 3249 |
. . . . . . . . . 10
|
| 32 | 31 | ad2antll 495 |
. . . . . . . . 9
|
| 33 | simplr 533 |
. . . . . . . . 9
| |
| 34 | 32, 33 | eldifd 3230 |
. . . . . . . 8
|
| 35 | findcard2sd.i |
. . . . . . . 8
| |
| 36 | 22, 26, 24, 34, 35 | syl22anc 1279 |
. . . . . . 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 7194 |
. . 3
|
| 41 | 3, 40 | mpcom 36 |
. 2
|
| 42 | 1, 41 | mpan2 429 |
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-coll 4246 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-fal 1408 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-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 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-res 4786 df-ima 4787 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-er 6807 df-en 7023 df-fin 7025 |
| This theorem is used by: fimax2gtri 7206 finexdc 7207 elssdc 7209 unfidisj 7229 undifdc 7231 ssfirab 7244 fnfi 7250 mapfi 7261 fissfi 7263 dcfi 7315 difinfinf 7441 hashunlem 11244 hashxp 11267 hashf1lem2 11286 fsumconst 12221 fsumrelem 12238 fprodcl2lem 12372 fprodconst 12387 fprodap0 12388 fprodrec 12396 fprodap0f 12403 fprodle 12407 fprodmodd 12408 ballotfilemcdc 13223 gsumzfi 14158 gsumclfi 14159 gsummptfidmadd 14161 gsumsubmclfi 14163 gsumconstcmn 14166 gsumfsum 14923 iuncld 15216 fsumcncntop 15668 |
| Copyright terms: Public domain | W3C validator |