Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sumrbdc | GIF version |
Description: Rebase the starting point of a sum. (Contributed by Mario Carneiro, 14-Jul-2013.) (Revised by Jim Kingdon, 9-Apr-2023.) |
Ref | Expression |
---|---|
isummo.1 | ⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 0)) |
isummo.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
isumrb.4 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
isumrb.5 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
isumrb.6 | ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑀)) |
isumrb.7 | ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑁)) |
isumrb.mdc | ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → DECID 𝑘 ∈ 𝐴) |
isumrb.ndc | ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → DECID 𝑘 ∈ 𝐴) |
Ref | Expression |
---|---|
sumrbdc | ⊢ (𝜑 → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isumrb.5 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
2 | 1 | adantr 274 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ) |
3 | seqex 10220 | . . . 4 ⊢ seq𝑀( + , 𝐹) ∈ V | |
4 | climres 11072 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ seq𝑀( + , 𝐹) ∈ V) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) ⇝ 𝐶 ↔ seq𝑀( + , 𝐹) ⇝ 𝐶)) | |
5 | 2, 3, 4 | sylancl 409 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) ⇝ 𝐶 ↔ seq𝑀( + , 𝐹) ⇝ 𝐶)) |
6 | isumrb.7 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑁)) | |
7 | isummo.1 | . . . . . 6 ⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 0)) | |
8 | isummo.2 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
9 | 8 | adantlr 468 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
10 | isumrb.mdc | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → DECID 𝑘 ∈ 𝐴) | |
11 | 10 | adantlr 468 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → DECID 𝑘 ∈ 𝐴) |
12 | simpr 109 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ (ℤ≥‘𝑀)) | |
13 | 7, 9, 11, 12 | sumrbdclem 11146 | . . . . 5 ⊢ (((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ 𝐴 ⊆ (ℤ≥‘𝑁)) → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) = seq𝑁( + , 𝐹)) |
14 | 6, 13 | mpidan 419 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) = seq𝑁( + , 𝐹)) |
15 | 14 | breq1d 3939 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
16 | 5, 15 | bitr3d 189 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
17 | isumrb.6 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑀)) | |
18 | 8 | adantlr 468 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
19 | isumrb.ndc | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → DECID 𝑘 ∈ 𝐴) | |
20 | 19 | adantlr 468 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ (ℤ≥‘𝑁)) → DECID 𝑘 ∈ 𝐴) |
21 | simpr 109 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ (ℤ≥‘𝑁)) | |
22 | 7, 18, 20, 21 | sumrbdclem 11146 | . . . . 5 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) ∧ 𝐴 ⊆ (ℤ≥‘𝑀)) → (seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) = seq𝑀( + , 𝐹)) |
23 | 17, 22 | mpidan 419 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → (seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) = seq𝑀( + , 𝐹)) |
24 | 23 | breq1d 3939 | . . 3 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → ((seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) ⇝ 𝐶 ↔ seq𝑀( + , 𝐹) ⇝ 𝐶)) |
25 | isumrb.4 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
26 | 25 | adantr 274 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ ℤ) |
27 | seqex 10220 | . . . 4 ⊢ seq𝑁( + , 𝐹) ∈ V | |
28 | climres 11072 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ seq𝑁( + , 𝐹) ∈ V) → ((seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) | |
29 | 26, 27, 28 | sylancl 409 | . . 3 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → ((seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
30 | 24, 29 | bitr3d 189 | . 2 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
31 | uztric 9347 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ∨ 𝑀 ∈ (ℤ≥‘𝑁))) | |
32 | 25, 1, 31 | syl2anc 408 | . 2 ⊢ (𝜑 → (𝑁 ∈ (ℤ≥‘𝑀) ∨ 𝑀 ∈ (ℤ≥‘𝑁))) |
33 | 16, 30, 32 | mpjaodan 787 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 697 DECID wdc 819 = wceq 1331 ∈ wcel 1480 Vcvv 2686 ⊆ wss 3071 ifcif 3474 class class class wbr 3929 ↦ cmpt 3989 ↾ cres 4541 ‘cfv 5123 ℂcc 7618 0cc0 7620 + caddc 7623 ℤcz 9054 ℤ≥cuz 9326 seqcseq 10218 ⇝ cli 11047 |
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 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 |
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-nel 2404 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-ilim 4291 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-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-frec 6288 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-n0 8978 df-z 9055 df-uz 9327 df-fz 9791 df-fzo 9920 df-seqfrec 10219 df-clim 11048 |
This theorem is referenced by: summodc 11152 zsumdc 11153 |
Copyright terms: Public domain | W3C validator |