esumpinfval - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > esumpinfval		Structured version Visualization version GIF version

Theorem esumpinfval 34036

Description: The value of the extended sum of nonnegative terms, with at least one infinite term. (Contributed by Thierry Arnoux, 19-Jun-2017.)

**Hypotheses**
Ref	Expression
esumpinfval.0	⊢ Ⅎ𝑘𝜑
esumpinfval.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
esumpinfval.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ (0[,]+∞))
esumpinfval.3	⊢ (𝜑 → ∃𝑘 ∈ 𝐴 𝐵 = +∞)

**Assertion**
Ref	Expression
esumpinfval	⊢ (𝜑 → Σ^*𝑘 ∈ 𝐴𝐵 = +∞)

Distinct variable groups: 𝐴,𝑘 𝑘,𝑉 Allowed substitution hints: 𝜑(𝑘) 𝐵(𝑘)

**Proof of Theorem esumpinfval**
Step	Hyp	Ref	Expression
1		iccssxr 13367	. . 3 ⊢ (0[,]+∞) ⊆ ℝ^*
2		esumpinfval.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
3		esumpinfval.0	. . . . 5 ⊢ Ⅎ𝑘𝜑
4		esumpinfval.2	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ (0[,]+∞))
5	4	ex 412	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝐴 → 𝐵 ∈ (0[,]+∞)))
6	3, 5	ralrimi 3233	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ (0[,]+∞))
7		nfcv 2891	. . . . 5 ⊢ Ⅎ𝑘𝐴
8	7	esumcl 33993	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐴 𝐵 ∈ (0[,]+∞)) → Σ^*𝑘 ∈ 𝐴𝐵 ∈ (0[,]+∞))
9	2, 6, 8	syl2anc 584	. . 3 ⊢ (𝜑 → Σ^*𝑘 ∈ 𝐴𝐵 ∈ (0[,]+∞))
10	1, 9	sselid 3941	. 2 ⊢ (𝜑 → Σ^𝑘 ∈ 𝐴𝐵 ∈ ℝ^)
11		nfrab1 3423	. . . . 5 ⊢ Ⅎ𝑘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}
12		ssrab2 4039	. . . . . 6 ⊢ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ⊆ 𝐴
13	12	a1i 11	. . . . 5 ⊢ (𝜑 → {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ⊆ 𝐴)
14		0xr 11197	. . . . . . . 8 ⊢ 0 ∈ ℝ^*
15		pnfxr 11204	. . . . . . . 8 ⊢ +∞ ∈ ℝ^*
16		0lepnf 13069	. . . . . . . 8 ⊢ 0 ≤ +∞
17		ubicc2 13402	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 0 ≤ +∞) → +∞ ∈ (0[,]+∞))
18	14, 15, 16, 17	mp3an 1463	. . . . . . 7 ⊢ +∞ ∈ (0[,]+∞)
19	18	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝐵 = +∞) → +∞ ∈ (0[,]+∞))
20		0e0iccpnf 13396	. . . . . . 7 ⊢ 0 ∈ (0[,]+∞)
21	20	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ ¬ 𝐵 = +∞) → 0 ∈ (0[,]+∞))
22	19, 21	ifclda 4520	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝐵 = +∞, +∞, 0) ∈ (0[,]+∞))
23		eldif 3921	. . . . . . . 8 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ↔ (𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}))
24		rabid 3424	. . . . . . . . . 10 ⊢ (𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ↔ (𝑘 ∈ 𝐴 ∧ 𝐵 = +∞))
25	24	simplbi2 500	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝐴 → (𝐵 = +∞ → 𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}))
26	25	con3dimp 408	. . . . . . . 8 ⊢ ((𝑘 ∈ 𝐴 ∧ ¬ 𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) → ¬ 𝐵 = +∞)
27	23, 26	sylbi 217	. . . . . . 7 ⊢ (𝑘 ∈ (𝐴 ∖ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) → ¬ 𝐵 = +∞)
28	27	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞})) → ¬ 𝐵 = +∞)
29	28	iffalsed 4495	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞})) → if(𝐵 = +∞, +∞, 0) = 0)
30	3, 11, 7, 13, 2, 22, 29	esumss 34035	. . . 4 ⊢ (𝜑 → Σ^𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}if(𝐵 = +∞, +∞, 0) = Σ^𝑘 ∈ 𝐴if(𝐵 = +∞, +∞, 0))
31		eqidd 2730	. . . . . 6 ⊢ (𝜑 → {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} = {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞})
32	24	simprbi 496	. . . . . . . 8 ⊢ (𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} → 𝐵 = +∞)
33	32	iftrued 4492	. . . . . . 7 ⊢ (𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} → if(𝐵 = +∞, +∞, 0) = +∞)
34	33	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) → if(𝐵 = +∞, +∞, 0) = +∞)
35	3, 31, 34	esumeq12dvaf 33994	. . . . 5 ⊢ (𝜑 → Σ^𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}if(𝐵 = +∞, +∞, 0) = Σ^𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}+∞)
36	2, 13	ssexd 5274	. . . . . 6 ⊢ (𝜑 → {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ∈ V)
37		nfcv 2891	. . . . . . 7 ⊢ Ⅎ𝑘+∞
38	11, 37	esumcst 34026	. . . . . 6 ⊢ (({𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ∈ V ∧ +∞ ∈ (0[,]+∞)) → Σ^*𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}+∞ = ((♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ·_e +∞))
39	36, 18, 38	sylancl 586	. . . . 5 ⊢ (𝜑 → Σ^*𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}+∞ = ((♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ·_e +∞))
40		hashxrcl 14298	. . . . . . 7 ⊢ ({𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ∈ V → (♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ∈ ℝ^*)
41	36, 40	syl 17	. . . . . 6 ⊢ (𝜑 → (♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ∈ ℝ^*)
42		esumpinfval.3	. . . . . . . 8 ⊢ (𝜑 → ∃𝑘 ∈ 𝐴 𝐵 = +∞)
43		rabn0 4348	. . . . . . . 8 ⊢ ({𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ≠ ∅ ↔ ∃𝑘 ∈ 𝐴 𝐵 = +∞)
44	42, 43	sylibr 234	. . . . . . 7 ⊢ (𝜑 → {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ≠ ∅)
45		hashgt0 14329	. . . . . . 7 ⊢ (({𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ∈ V ∧ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞} ≠ ∅) → 0 < (♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}))
46	36, 44, 45	syl2anc 584	. . . . . 6 ⊢ (𝜑 → 0 < (♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}))
47		xmulpnf1 13210	. . . . . 6 ⊢ (((♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ∈ ℝ^* ∧ 0 < (♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞})) → ((♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ·_e +∞) = +∞)
48	41, 46, 47	syl2anc 584	. . . . 5 ⊢ (𝜑 → ((♯‘{𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}) ·_e +∞) = +∞)
49	35, 39, 48	3eqtrd 2768	. . . 4 ⊢ (𝜑 → Σ^*𝑘 ∈ {𝑘 ∈ 𝐴 ∣ 𝐵 = +∞}if(𝐵 = +∞, +∞, 0) = +∞)
50	30, 49	eqtr3d 2766	. . 3 ⊢ (𝜑 → Σ^*𝑘 ∈ 𝐴if(𝐵 = +∞, +∞, 0) = +∞)
51		breq1 5105	. . . . 5 ⊢ (+∞ = if(𝐵 = +∞, +∞, 0) → (+∞ ≤ 𝐵 ↔ if(𝐵 = +∞, +∞, 0) ≤ 𝐵))
52		breq1 5105	. . . . 5 ⊢ (0 = if(𝐵 = +∞, +∞, 0) → (0 ≤ 𝐵 ↔ if(𝐵 = +∞, +∞, 0) ≤ 𝐵))
53		pnfge 13066	. . . . . . . 8 ⊢ (+∞ ∈ ℝ^* → +∞ ≤ +∞)
54	15, 53	ax-mp 5	. . . . . . 7 ⊢ +∞ ≤ +∞
55		breq2 5106	. . . . . . 7 ⊢ (𝐵 = +∞ → (+∞ ≤ 𝐵 ↔ +∞ ≤ +∞))
56	54, 55	mpbiri 258	. . . . . 6 ⊢ (𝐵 = +∞ → +∞ ≤ 𝐵)
57	56	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ 𝐵 = +∞) → +∞ ≤ 𝐵)
58	4	adantr 480	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ ¬ 𝐵 = +∞) → 𝐵 ∈ (0[,]+∞))
59		iccgelb 13339	. . . . . . 7 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 𝐵 ∈ (0[,]+∞)) → 0 ≤ 𝐵)
60	14, 15, 59	mp3an12 1453	. . . . . 6 ⊢ (𝐵 ∈ (0[,]+∞) → 0 ≤ 𝐵)
61	58, 60	syl 17	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ ¬ 𝐵 = +∞) → 0 ≤ 𝐵)
62	51, 52, 57, 61	ifbothda 4523	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → if(𝐵 = +∞, +∞, 0) ≤ 𝐵)
63	3, 7, 2, 22, 4, 62	esumlef 34025	. . 3 ⊢ (𝜑 → Σ^𝑘 ∈ 𝐴if(𝐵 = +∞, +∞, 0) ≤ Σ^𝑘 ∈ 𝐴𝐵)
64	50, 63	eqbrtrrd 5126	. 2 ⊢ (𝜑 → +∞ ≤ Σ^*𝑘 ∈ 𝐴𝐵)
65		xgepnf 13101	. . 3 ⊢ (Σ^𝑘 ∈ 𝐴𝐵 ∈ ℝ^ → (+∞ ≤ Σ^𝑘 ∈ 𝐴𝐵 ↔ Σ^𝑘 ∈ 𝐴𝐵 = +∞))
66	65	biimpd 229	. 2 ⊢ (Σ^𝑘 ∈ 𝐴𝐵 ∈ ℝ^ → (+∞ ≤ Σ^𝑘 ∈ 𝐴𝐵 → Σ^𝑘 ∈ 𝐴𝐵 = +∞))
67	10, 64, 66	sylc 65	1 ⊢ (𝜑 → Σ^*𝑘 ∈ 𝐴𝐵 = +∞)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 {crab 3402 Vcvv 3444 ∖ cdif 3908 ⊆ wss 3911 ∅c0 4292 ifcif 4484 class class class wbr 5102 ‘cfv 6499 (class class class)co 7369 0cc0 11044 +∞cpnf 11181 ℝ^*cxr 11183 < clt 11184 ≤ cle 11185 ·_e cxmu 13047 [,]cicc 13285 ♯chash 14271 Σ^*cesum 33990

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-inf2 9570 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 ax-addf 11123 ax-mulf 11124

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-of 7633 df-om 7823 df-1st 7947 df-2nd 7948 df-supp 8117 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-oadd 8415 df-er 8648 df-map 8778 df-pm 8779 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9289 df-fi 9338 df-sup 9369 df-inf 9370 df-oi 9439 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-9 12232 df-n0 12419 df-xnn0 12492 df-z 12506 df-dec 12626 df-uz 12770 df-q 12884 df-rp 12928 df-xneg 13048 df-xadd 13049 df-xmul 13050 df-ioo 13286 df-ioc 13287 df-ico 13288 df-icc 13289 df-fz 13445 df-fzo 13592 df-fl 13730 df-mod 13808 df-seq 13943 df-exp 14003 df-fac 14215 df-bc 14244 df-hash 14272 df-shft 15009 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-limsup 15413 df-clim 15430 df-rlim 15431 df-sum 15629 df-ef 16009 df-sin 16011 df-cos 16012 df-pi 16014 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-starv 17211 df-sca 17212 df-vsca 17213 df-ip 17214 df-tset 17215 df-ple 17216 df-ds 17218 df-unif 17219 df-hom 17220 df-cco 17221 df-rest 17361 df-topn 17362 df-0g 17380 df-gsum 17381 df-topgen 17382 df-pt 17383 df-prds 17386 df-ordt 17440 df-xrs 17441 df-qtop 17446 df-imas 17447 df-xps 17449 df-mre 17523 df-mrc 17524 df-acs 17526 df-ps 18501 df-tsr 18502 df-plusf 18542 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-mhm 18686 df-submnd 18687 df-grp 18844 df-minusg 18845 df-sbg 18846 df-mulg 18976 df-subg 19031 df-cntz 19225 df-cmn 19688 df-abl 19689 df-mgp 20026 df-rng 20038 df-ur 20067 df-ring 20120 df-cring 20121 df-subrng 20431 df-subrg 20455 df-abv 20694 df-lmod 20744 df-scaf 20745 df-sra 21056 df-rgmod 21057 df-psmet 21232 df-xmet 21233 df-met 21234 df-bl 21235 df-mopn 21236 df-fbas 21237 df-fg 21238 df-cnfld 21241 df-top 22757 df-topon 22774 df-topsp 22796 df-bases 22809 df-cld 22882 df-ntr 22883 df-cls 22884 df-nei 22961 df-lp 22999 df-perf 23000 df-cn 23090 df-cnp 23091 df-haus 23178 df-tx 23425 df-hmeo 23618 df-fil 23709 df-fm 23801 df-flim 23802 df-flf 23803 df-tmd 23935 df-tgp 23936 df-tsms 23990 df-trg 24023 df-xms 24184 df-ms 24185 df-tms 24186 df-nm 24446 df-ngp 24447 df-nrg 24449 df-nlm 24450 df-ii 24746 df-cncf 24747 df-limc 25743 df-dv 25744 df-log 26441 df-esum 33991

This theorem is referenced by: hasheuni 34048 esumcvg 34049 esumcvgre 34054 voliune 34192 volfiniune 34193

W3C validator