![]() |
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 3028 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝑍) |
4 | isumless.6 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ) | |
5 | 4 | recnd 7579 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ) |
6 | 3, 5 | syldan 277 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
7 | 6 | ralrimiva 2447 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ) |
8 | isumless.2 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
9 | isumless.1 | . . . . . . 7 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
10 | 9 | eqimssi 3083 | . . . . . 6 ⊢ 𝑍 ⊆ (ℤ≥‘𝑀) |
11 | 10 | a1i 9 | . . . . 5 ⊢ (𝜑 → 𝑍 ⊆ (ℤ≥‘𝑀)) |
12 | 9 | eleq2i 2155 | . . . . . . . . . 10 ⊢ (𝑘 ∈ 𝑍 ↔ 𝑘 ∈ (ℤ≥‘𝑀)) |
13 | 12 | biimpri 132 | . . . . . . . . 9 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → 𝑘 ∈ 𝑍) |
14 | 13 | orcd 688 | . . . . . . . 8 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝑘 ∈ 𝑍 ∨ ¬ 𝑘 ∈ 𝑍)) |
15 | df-dc 782 | . . . . . . . 8 ⊢ (DECID 𝑘 ∈ 𝑍 ↔ (𝑘 ∈ 𝑍 ∨ ¬ 𝑘 ∈ 𝑍)) | |
16 | 14, 15 | sylibr 133 | . . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → DECID 𝑘 ∈ 𝑍) |
17 | 16 | rgen 2429 | . . . . . 6 ⊢ ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍 |
18 | 17 | a1i 9 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍) |
19 | 8, 11, 18 | 3jca 1124 | . . . 4 ⊢ (𝜑 → (𝑀 ∈ ℤ ∧ 𝑍 ⊆ (ℤ≥‘𝑀) ∧ ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍)) |
20 | 19 | orcd 688 | . . 3 ⊢ (𝜑 → ((𝑀 ∈ ℤ ∧ 𝑍 ⊆ (ℤ≥‘𝑀) ∧ ∀𝑘 ∈ (ℤ≥‘𝑀)DECID 𝑘 ∈ 𝑍) ∨ 𝑍 ∈ Fin)) |
21 | 1, 2, 7, 20 | isumss2 10848 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ 𝑍 if(𝑘 ∈ 𝐴, 𝐵, 0)) |
22 | simpr 109 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ 𝑍) | |
23 | isumless.5 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵) | |
24 | 23, 4 | eqeltrd 2165 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) |
25 | 24 | adantr 271 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ ℝ) |
26 | 0red 7552 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ ¬ 𝑘 ∈ 𝐴) → 0 ∈ ℝ) | |
27 | 2 | r19.21bi 2462 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → DECID 𝑘 ∈ 𝐴) |
28 | 25, 26, 27 | ifcldadc 3426 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) ∈ ℝ) |
29 | eleq1w 2149 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴)) | |
30 | fveq2 5320 | . . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘)) | |
31 | 29, 30 | ifbieq1d 3419 | . . . . . 6 ⊢ (𝑗 = 𝑘 → if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0)) |
32 | eqid 2089 | . . . . . 6 ⊢ (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0)) = (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0)) | |
33 | 31, 32 | fvmptg 5395 | . . . . 5 ⊢ ((𝑘 ∈ 𝑍 ∧ if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) ∈ ℝ) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0)) |
34 | 22, 28, 33 | syl2anc 404 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0)) |
35 | 23 | ifeq1d 3414 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) = if(𝑘 ∈ 𝐴, 𝐵, 0)) |
36 | 34, 35 | eqtrd 2121 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, 𝐵, 0)) |
37 | 35, 28 | eqeltrrd 2166 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, 𝐵, 0) ∈ ℝ) |
38 | 4 | leidd 8055 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ≤ 𝐵) |
39 | isumless.7 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ 𝐵) | |
40 | breq1 3856 | . . . . 5 ⊢ (𝐵 = if(𝑘 ∈ 𝐴, 𝐵, 0) → (𝐵 ≤ 𝐵 ↔ if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵)) | |
41 | breq1 3856 | . . . . 5 ⊢ (0 = if(𝑘 ∈ 𝐴, 𝐵, 0) → (0 ≤ 𝐵 ↔ if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵)) | |
42 | 40, 41 | ifbothdc 3429 | . . . 4 ⊢ ((𝐵 ≤ 𝐵 ∧ 0 ≤ 𝐵 ∧ DECID 𝑘 ∈ 𝐴) → if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵) |
43 | 38, 39, 27, 42 | syl3anc 1175 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵) |
44 | isumless.3 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
45 | 13, 27 | sylan2 281 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → DECID 𝑘 ∈ 𝐴) |
46 | 9, 8, 44, 1, 45, 36, 6 | fsum3cvg3 10852 | . . 3 ⊢ (𝜑 → seq𝑀( + , (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))) ∈ dom ⇝ ) |
47 | isumless.8 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
48 | 9, 8, 36, 37, 23, 4, 43, 46, 47 | isumle 10952 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ Σ𝑘 ∈ 𝑍 𝐵) |
49 | 21, 48 | eqbrtrd 3873 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 ≤ Σ𝑘 ∈ 𝑍 𝐵) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∨ wo 665 DECID wdc 781 ∧ w3a 925 = wceq 1290 ∈ wcel 1439 ∀wral 2360 ⊆ wss 3002 ifcif 3399 class class class wbr 3853 ↦ cmpt 3907 dom cdm 4454 ‘cfv 5030 Fincfn 6513 ℂcc 7411 ℝcr 7412 0cc0 7413 + caddc 7416 ≤ cle 7586 ℤcz 8813 ℤ≥cuz 9082 seqcseq 9915 ⇝ cli 10729 Σcsu 10805 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 580 ax-in2 581 ax-io 666 ax-5 1382 ax-7 1383 ax-gen 1384 ax-ie1 1428 ax-ie2 1429 ax-8 1441 ax-10 1442 ax-11 1443 ax-i12 1444 ax-bndl 1445 ax-4 1446 ax-13 1450 ax-14 1451 ax-17 1465 ax-i9 1469 ax-ial 1473 ax-i5r 1474 ax-ext 2071 ax-coll 3962 ax-sep 3965 ax-nul 3973 ax-pow 4017 ax-pr 4047 ax-un 4271 ax-setind 4368 ax-iinf 4418 ax-cnex 7499 ax-resscn 7500 ax-1cn 7501 ax-1re 7502 ax-icn 7503 ax-addcl 7504 ax-addrcl 7505 ax-mulcl 7506 ax-mulrcl 7507 ax-addcom 7508 ax-mulcom 7509 ax-addass 7510 ax-mulass 7511 ax-distr 7512 ax-i2m1 7513 ax-0lt1 7514 ax-1rid 7515 ax-0id 7516 ax-rnegex 7517 ax-precex 7518 ax-cnre 7519 ax-pre-ltirr 7520 ax-pre-ltwlin 7521 ax-pre-lttrn 7522 ax-pre-apti 7523 ax-pre-ltadd 7524 ax-pre-mulgt0 7525 ax-pre-mulext 7526 ax-arch 7527 ax-caucvg 7528 |
This theorem depends on definitions: df-bi 116 df-dc 782 df-3or 926 df-3an 927 df-tru 1293 df-fal 1296 df-nf 1396 df-sb 1694 df-eu 1952 df-mo 1953 df-clab 2076 df-cleq 2082 df-clel 2085 df-nfc 2218 df-ne 2257 df-nel 2352 df-ral 2365 df-rex 2366 df-reu 2367 df-rmo 2368 df-rab 2369 df-v 2624 df-sbc 2844 df-csb 2937 df-dif 3004 df-un 3006 df-in 3008 df-ss 3015 df-nul 3290 df-if 3400 df-pw 3437 df-sn 3458 df-pr 3459 df-op 3461 df-uni 3662 df-int 3697 df-iun 3740 df-br 3854 df-opab 3908 df-mpt 3909 df-tr 3945 df-id 4131 df-po 4134 df-iso 4135 df-iord 4204 df-on 4206 df-ilim 4207 df-suc 4209 df-iom 4421 df-xp 4460 df-rel 4461 df-cnv 4462 df-co 4463 df-dm 4464 df-rn 4465 df-res 4466 df-ima 4467 df-iota 4995 df-fun 5032 df-fn 5033 df-f 5034 df-f1 5035 df-fo 5036 df-f1o 5037 df-fv 5038 df-isom 5039 df-riota 5624 df-ov 5671 df-oprab 5672 df-mpt2 5673 df-1st 5927 df-2nd 5928 df-recs 6086 df-irdg 6151 df-frec 6172 df-1o 6197 df-oadd 6201 df-er 6308 df-en 6514 df-dom 6515 df-fin 6516 df-sup 6735 df-pnf 7587 df-mnf 7588 df-xr 7589 df-ltxr 7590 df-le 7591 df-sub 7718 df-neg 7719 df-reap 8115 df-ap 8122 df-div 8203 df-inn 8486 df-2 8544 df-3 8545 df-4 8546 df-n0 8737 df-z 8814 df-uz 9083 df-q 9168 df-rp 9198 df-fz 9488 df-fzo 9617 df-iseq 9916 df-seq3 9917 df-exp 10018 df-ihash 10247 df-cj 10339 df-re 10340 df-im 10341 df-rsqrt 10494 df-abs 10495 df-clim 10730 df-isum 10806 |
This theorem is referenced by: mertenslemi1 10992 |
Copyright terms: Public domain | W3C validator |