![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sumrb | Structured version Visualization version GIF version |
Description: Rebase the starting point of a sum. (Contributed by Mario Carneiro, 14-Jul-2013.) (Revised by Mario Carneiro, 9-Apr-2014.) |
Ref | Expression |
---|---|
summo.1 | ⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 0)) |
summo.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
sumrb.4 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
sumrb.5 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
sumrb.6 | ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑀)) |
sumrb.7 | ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑁)) |
Ref | Expression |
---|---|
sumrb | ⊢ (𝜑 → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sumrb.5 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
2 | 1 | adantr 482 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ) |
3 | seqex 13914 | . . . 4 ⊢ seq𝑀( + , 𝐹) ∈ V | |
4 | climres 15463 | . . . 4 ⊢ ((𝑁 ∈ ℤ ∧ seq𝑀( + , 𝐹) ∈ V) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) ⇝ 𝐶 ↔ seq𝑀( + , 𝐹) ⇝ 𝐶)) | |
5 | 2, 3, 4 | sylancl 587 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) ⇝ 𝐶 ↔ seq𝑀( + , 𝐹) ⇝ 𝐶)) |
6 | sumrb.7 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑁)) | |
7 | summo.1 | . . . . . 6 ⊢ 𝐹 = (𝑘 ∈ ℤ ↦ if(𝑘 ∈ 𝐴, 𝐵, 0)) | |
8 | summo.2 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
9 | 8 | adantlr 714 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
10 | simpr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ (ℤ≥‘𝑀)) | |
11 | 7, 9, 10 | sumrblem 15601 | . . . . 5 ⊢ (((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ 𝐴 ⊆ (ℤ≥‘𝑁)) → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) = seq𝑁( + , 𝐹)) |
12 | 6, 11 | mpidan 688 | . . . 4 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) = seq𝑁( + , 𝐹)) |
13 | 12 | breq1d 5116 | . . 3 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝑁)) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
14 | 5, 13 | bitr3d 281 | . 2 ⊢ ((𝜑 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
15 | sumrb.6 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ (ℤ≥‘𝑀)) | |
16 | 8 | adantlr 714 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
17 | simpr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ (ℤ≥‘𝑁)) | |
18 | 7, 16, 17 | sumrblem 15601 | . . . . 5 ⊢ (((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) ∧ 𝐴 ⊆ (ℤ≥‘𝑀)) → (seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) = seq𝑀( + , 𝐹)) |
19 | 15, 18 | mpidan 688 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → (seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) = seq𝑀( + , 𝐹)) |
20 | 19 | breq1d 5116 | . . 3 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → ((seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) ⇝ 𝐶 ↔ seq𝑀( + , 𝐹) ⇝ 𝐶)) |
21 | sumrb.4 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
22 | 21 | adantr 482 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → 𝑀 ∈ ℤ) |
23 | seqex 13914 | . . . 4 ⊢ seq𝑁( + , 𝐹) ∈ V | |
24 | climres 15463 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ seq𝑁( + , 𝐹) ∈ V) → ((seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) | |
25 | 22, 23, 24 | sylancl 587 | . . 3 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → ((seq𝑁( + , 𝐹) ↾ (ℤ≥‘𝑀)) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
26 | 20, 25 | bitr3d 281 | . 2 ⊢ ((𝜑 ∧ 𝑀 ∈ (ℤ≥‘𝑁)) → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
27 | uztric 12792 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ∨ 𝑀 ∈ (ℤ≥‘𝑁))) | |
28 | 21, 1, 27 | syl2anc 585 | . 2 ⊢ (𝜑 → (𝑁 ∈ (ℤ≥‘𝑀) ∨ 𝑀 ∈ (ℤ≥‘𝑁))) |
29 | 14, 26, 28 | mpjaodan 958 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ⇝ 𝐶 ↔ seq𝑁( + , 𝐹) ⇝ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 Vcvv 3444 ⊆ wss 3911 ifcif 4487 class class class wbr 5106 ↦ cmpt 5189 ↾ cres 5636 ‘cfv 6497 ℂcc 11054 0cc0 11056 + caddc 11059 ℤcz 12504 ℤ≥cuz 12768 seqcseq 13912 ⇝ cli 15372 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5243 ax-sep 5257 ax-nul 5264 ax-pow 5321 ax-pr 5385 ax-un 7673 ax-inf2 9582 ax-cnex 11112 ax-resscn 11113 ax-1cn 11114 ax-icn 11115 ax-addcl 11116 ax-addrcl 11117 ax-mulcl 11118 ax-mulrcl 11119 ax-mulcom 11120 ax-addass 11121 ax-mulass 11122 ax-distr 11123 ax-i2m1 11124 ax-1ne0 11125 ax-1rid 11126 ax-rnegex 11127 ax-rrecex 11128 ax-cnre 11129 ax-pre-lttri 11130 ax-pre-lttrn 11131 ax-pre-ltadd 11132 ax-pre-mulgt0 11133 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3741 df-csb 3857 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3930 df-nul 4284 df-if 4488 df-pw 4563 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-iun 4957 df-br 5107 df-opab 5169 df-mpt 5190 df-tr 5224 df-id 5532 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5589 df-we 5591 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6254 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6499 df-fn 6500 df-f 6501 df-f1 6502 df-fo 6503 df-f1o 6504 df-fv 6505 df-riota 7314 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7804 df-1st 7922 df-2nd 7923 df-frecs 8213 df-wrecs 8244 df-recs 8318 df-rdg 8357 df-er 8651 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11196 df-mnf 11197 df-xr 11198 df-ltxr 11199 df-le 11200 df-sub 11392 df-neg 11393 df-nn 12159 df-n0 12419 df-z 12505 df-uz 12769 df-fz 13431 df-seq 13913 df-clim 15376 |
This theorem is referenced by: summo 15607 zsum 15608 |
Copyright terms: Public domain | W3C validator |