Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > isumlessdc | GIF version |
Description: A finite sum of nonnegative numbers is less than or equal to its limit. (Contributed by Mario Carneiro, 24-Apr-2014.) |
Ref | Expression |
---|---|
isumless.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
isumless.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
isumless.3 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
isumless.4 | ⊢ (𝜑 → 𝐴 ⊆ 𝑍) |
isumless.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) |
isumless.dc | ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 DECID 𝑘 ∈ 𝐴) |
isumless.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ) |
isumless.7 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ 𝐵) |
isumless.8 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) |
Ref | Expression |
---|---|
isumlessdc | ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 ≤ Σ𝑘 ∈ 𝑍 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isumless.4 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝑍) | |
2 | isumless.dc | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 DECID 𝑘 ∈ 𝐴) | |
3 | 1 | sselda 3097 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝑍) |
4 | isumless.6 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ) | |
5 | 4 | recnd 7799 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) |
6 | 3, 5 | syldan 280 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
7 | 6 | ralrimiva 2505 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ) |
8 | isumless.2 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
9 | isumless.1 | . . . . . . 7 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
10 | 9 | eqimssi 3153 | . . . . . 6 ⊢ 𝑍 ⊆ (ℤ≥‘𝑀) |
11 | 10 | a1i 9 | . . . . 5 ⊢ (𝜑 → 𝑍 ⊆ (ℤ≥‘𝑀)) |
12 | 9 | eleq2i 2206 | . . . . . . . . . 10 ⊢ (𝑘 ∈ 𝑍 ↔ 𝑘 ∈ (ℤ≥‘𝑀)) |
13 | 12 | biimpri 132 | . . . . . . . . 9 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → 𝑘 ∈ 𝑍) |
14 | 13 | orcd 722 | . . . . . . . 8 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ 𝑍 ∨ ¬ 𝑘 ∈ 𝑍)) |
15 | df-dc 820 | . . . . . . . 8 ⊢ (DECID 𝑘 ∈ 𝑍 ↔ (𝑘 ∈ 𝑍 ∨ ¬ 𝑘 ∈ 𝑍)) | |
16 | 14, 15 | sylibr 133 | . . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → DECID 𝑘 ∈ 𝑍) |
17 | 16 | rgen 2485 | . . . . . 6 ⊢ ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍 |
18 | 17 | a1i 9 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍) |
19 | 8, 11, 18 | 3jca 1161 | . . . 4 ⊢ (𝜑 → (𝑀 ∈ ℤ ∧ 𝑍 ⊆ (ℤ≥‘𝑀) ∧ ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍)) |
20 | 19 | orcd 722 | . . 3 ⊢ (𝜑 → ((𝑀 ∈ ℤ ∧ 𝑍 ⊆ (ℤ≥‘𝑀) ∧ ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍) ∨ 𝑍 ∈ Fin)) |
21 | 1, 2, 7, 20 | isumss2 11167 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ 𝑍 if(𝑘 ∈ 𝐴, 𝐵, 0)) |
22 | simpr 109 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ 𝑍) | |
23 | isumless.5 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
24 | 23, 4 | eqeltrd 2216 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) |
25 | 24 | adantr 274 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ ℝ) |
26 | 0red 7772 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ ¬ 𝑘 ∈ 𝐴) → 0 ∈ ℝ) | |
27 | 2 | r19.21bi 2520 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → DECID 𝑘 ∈ 𝐴) |
28 | 25, 26, 27 | ifcldadc 3501 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) ∈ ℝ) |
29 | eleq1w 2200 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴)) | |
30 | fveq2 5421 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘)) | |
31 | 29, 30 | ifbieq1d 3494 | . . . . . 6 ⊢ (𝑗 = 𝑘 → if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0)) |
32 | eqid 2139 | . . . . . 6 ⊢ (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0)) = (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0)) | |
33 | 31, 32 | fvmptg 5497 | . . . . 5 ⊢ ((𝑘 ∈ 𝑍 ∧ if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) ∈ ℝ) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0)) |
34 | 22, 28, 33 | syl2anc 408 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0)) |
35 | 23 | ifeq1d 3489 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) = if(𝑘 ∈ 𝐴, 𝐵, 0)) |
36 | 34, 35 | eqtrd 2172 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, 𝐵, 0)) |
37 | 35, 28 | eqeltrrd 2217 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, 𝐵, 0) ∈ ℝ) |
38 | 4 | leidd 8281 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ≤ 𝐵) |
39 | isumless.7 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ 𝐵) | |
40 | breq1 3932 | . . . . 5 ⊢ (𝐵 = if(𝑘 ∈ 𝐴, 𝐵, 0) → (𝐵 ≤ 𝐵 ↔ if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵)) | |
41 | breq1 3932 | . . . . 5 ⊢ (0 = if(𝑘 ∈ 𝐴, 𝐵, 0) → (0 ≤ 𝐵 ↔ if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵)) | |
42 | 40, 41 | ifbothdc 3504 | . . . 4 ⊢ ((𝐵 ≤ 𝐵 ∧ 0 ≤ 𝐵 ∧ DECID 𝑘 ∈ 𝐴) → if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵) |
43 | 38, 39, 27, 42 | syl3anc 1216 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵) |
44 | isumless.3 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
45 | 13, 27 | sylan2 284 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → DECID 𝑘 ∈ 𝐴) |
46 | 9, 8, 44, 1, 45, 36, 6 | fsum3cvg3 11170 | . . 3 ⊢ (𝜑 → seq𝑀( + , (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))) ∈ dom ⇝ ) |
47 | isumless.8 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
48 | 9, 8, 36, 37, 23, 4, 43, 46, 47 | isumle 11269 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ Σ𝑘 ∈ 𝑍 𝐵) |
49 | 21, 48 | eqbrtrd 3950 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 ≤ Σ𝑘 ∈ 𝑍 𝐵) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∨ wo 697 DECID wdc 819 ∧ w3a 962 = wceq 1331 ∈ wcel 1480 ∀wral 2416 ⊆ wss 3071 ifcif 3474 class class class wbr 3929 ↦ cmpt 3989 dom cdm 4539 ‘cfv 5123 Fincfn 6634 ℂcc 7623 ℝcr 7624 0cc0 7625 + caddc 7628 ≤ cle 7806 ℤcz 9059 ℤ≥cuz 9331 seqcseq 10223 ⇝ cli 11052 Σcsu 11127 |
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 7716 ax-resscn 7717 ax-1cn 7718 ax-1re 7719 ax-icn 7720 ax-addcl 7721 ax-addrcl 7722 ax-mulcl 7723 ax-mulrcl 7724 ax-addcom 7725 ax-mulcom 7726 ax-addass 7727 ax-mulass 7728 ax-distr 7729 ax-i2m1 7730 ax-0lt1 7731 ax-1rid 7732 ax-0id 7733 ax-rnegex 7734 ax-precex 7735 ax-cnre 7736 ax-pre-ltirr 7737 ax-pre-ltwlin 7738 ax-pre-lttrn 7739 ax-pre-apti 7740 ax-pre-ltadd 7741 ax-pre-mulgt0 7742 ax-pre-mulext 7743 ax-arch 7744 ax-caucvg 7745 |
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-rmo 2424 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-po 4218 df-iso 4219 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-isom 5132 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-irdg 6267 df-frec 6288 df-1o 6313 df-oadd 6317 df-er 6429 df-en 6635 df-dom 6636 df-fin 6637 df-sup 6871 df-pnf 7807 df-mnf 7808 df-xr 7809 df-ltxr 7810 df-le 7811 df-sub 7940 df-neg 7941 df-reap 8342 df-ap 8349 df-div 8438 df-inn 8726 df-2 8784 df-3 8785 df-4 8786 df-n0 8983 df-z 9060 df-uz 9332 df-q 9417 df-rp 9447 df-fz 9796 df-fzo 9925 df-seqfrec 10224 df-exp 10298 df-ihash 10527 df-cj 10619 df-re 10620 df-im 10621 df-rsqrt 10775 df-abs 10776 df-clim 11053 df-sumdc 11128 |
This theorem is referenced by: mertenslemi1 11309 |
Copyright terms: Public domain | W3C validator |