| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 2shfti | Unicode version | ||
| Description: Composite shift operations. (Contributed by NM, 19-Aug-2005.) (Revised by Mario Carneiro, 5-Nov-2013.) |
| Ref | Expression |
|---|---|
| shftfval.1 |
|
| Ref | Expression |
|---|---|
| 2shfti |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | shftfval.1 |
. . . . . . . . 9
| |
| 2 | 1 | shftfval 11347 |
. . . . . . . 8
|
| 3 | 2 | breqd 4094 |
. . . . . . 7
|
| 4 | 3 | ad2antrr 488 |
. . . . . 6
|
| 5 | simpr 110 |
. . . . . . . 8
| |
| 6 | simplr 528 |
. . . . . . . 8
| |
| 7 | 5, 6 | subcld 8468 |
. . . . . . 7
|
| 8 | vex 2802 |
. . . . . . 7
| |
| 9 | eleq1 2292 |
. . . . . . . . 9
| |
| 10 | oveq1 6014 |
. . . . . . . . . 10
| |
| 11 | 10 | breq1d 4093 |
. . . . . . . . 9
|
| 12 | 9, 11 | anbi12d 473 |
. . . . . . . 8
|
| 13 | breq2 4087 |
. . . . . . . . 9
| |
| 14 | 13 | anbi2d 464 |
. . . . . . . 8
|
| 15 | eqid 2229 |
. . . . . . . 8
| |
| 16 | 12, 14, 15 | brabg 4357 |
. . . . . . 7
|
| 17 | 7, 8, 16 | sylancl 413 |
. . . . . 6
|
| 18 | 4, 17 | bitrd 188 |
. . . . 5
|
| 19 | subcl 8356 |
. . . . . . . 8
| |
| 20 | 19 | biantrurd 305 |
. . . . . . 7
|
| 21 | 20 | ancoms 268 |
. . . . . 6
|
| 22 | 21 | adantll 476 |
. . . . 5
|
| 23 | sub32 8391 |
. . . . . . . . 9
| |
| 24 | subsub4 8390 |
. . . . . . . . 9
| |
| 25 | 23, 24 | eqtr3d 2264 |
. . . . . . . 8
|
| 26 | 25 | 3expb 1228 |
. . . . . . 7
|
| 27 | 26 | ancoms 268 |
. . . . . 6
|
| 28 | 27 | breq1d 4093 |
. . . . 5
|
| 29 | 18, 22, 28 | 3bitr2d 216 |
. . . 4
|
| 30 | 29 | pm5.32da 452 |
. . 3
|
| 31 | 30 | opabbidv 4150 |
. 2
|
| 32 | ovshftex 11345 |
. . . . 5
| |
| 33 | 1, 32 | mpan 424 |
. . . 4
|
| 34 | shftfvalg 11344 |
. . . 4
| |
| 35 | 33, 34 | sylan2 286 |
. . 3
|
| 36 | 35 | ancoms 268 |
. 2
|
| 37 | addcl 8135 |
. . 3
| |
| 38 | 1 | shftfval 11347 |
. . 3
|
| 39 | 37, 38 | syl 14 |
. 2
|
| 40 | 31, 36, 39 | 3eqtr4d 2272 |
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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-distr 8114 ax-i2m1 8115 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-sub 8330 df-shft 11341 |
| This theorem is referenced by: shftcan1 11360 |
| Copyright terms: Public domain | W3C validator |