![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sge0prle | Structured version Visualization version GIF version |
Description: The sum of a pair of nonnegative extended reals is less than or equal their extended addition. When it is a distinct pair, than equality holds, see sge0pr 45679. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
Ref | Expression |
---|---|
sge0prle.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
sge0prle.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
sge0prle.d | ⊢ (𝜑 → 𝐷 ∈ (0[,]+∞)) |
sge0prle.e | ⊢ (𝜑 → 𝐸 ∈ (0[,]+∞)) |
sge0prle.cd | ⊢ (𝑘 = 𝐴 → 𝐶 = 𝐷) |
sge0prle.ce | ⊢ (𝑘 = 𝐵 → 𝐶 = 𝐸) |
Ref | Expression |
---|---|
sge0prle | ⊢ (𝜑 → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) ≤ (𝐷 +𝑒 𝐸)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preq1 4732 | . . . . . . . 8 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐵, 𝐵}) | |
2 | dfsn2 4636 | . . . . . . . . . 10 ⊢ {𝐵} = {𝐵, 𝐵} | |
3 | 2 | eqcomi 2735 | . . . . . . . . 9 ⊢ {𝐵, 𝐵} = {𝐵} |
4 | 3 | a1i 11 | . . . . . . . 8 ⊢ (𝐴 = 𝐵 → {𝐵, 𝐵} = {𝐵}) |
5 | 1, 4 | eqtrd 2766 | . . . . . . 7 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐵}) |
6 | 5 | mpteq1d 5236 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶) = (𝑘 ∈ {𝐵} ↦ 𝐶)) |
7 | 6 | fveq2d 6889 | . . . . 5 ⊢ (𝐴 = 𝐵 → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) = (Σ^‘(𝑘 ∈ {𝐵} ↦ 𝐶))) |
8 | 7 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) = (Σ^‘(𝑘 ∈ {𝐵} ↦ 𝐶))) |
9 | sge0prle.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
10 | sge0prle.e | . . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (0[,]+∞)) | |
11 | sge0prle.ce | . . . . . 6 ⊢ (𝑘 = 𝐵 → 𝐶 = 𝐸) | |
12 | 9, 10, 11 | sge0snmpt 45668 | . . . . 5 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ {𝐵} ↦ 𝐶)) = 𝐸) |
13 | 12 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (Σ^‘(𝑘 ∈ {𝐵} ↦ 𝐶)) = 𝐸) |
14 | 8, 13 | eqtrd 2766 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) = 𝐸) |
15 | iccssxr 13413 | . . . . . . . 8 ⊢ (0[,]+∞) ⊆ ℝ* | |
16 | 15, 10 | sselid 3975 | . . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ℝ*) |
17 | 16 | xaddlidd 44598 | . . . . . 6 ⊢ (𝜑 → (0 +𝑒 𝐸) = 𝐸) |
18 | 17 | eqcomd 2732 | . . . . 5 ⊢ (𝜑 → 𝐸 = (0 +𝑒 𝐸)) |
19 | 0xr 11265 | . . . . . . 7 ⊢ 0 ∈ ℝ* | |
20 | 19 | a1i 11 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ*) |
21 | sge0prle.d | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (0[,]+∞)) | |
22 | 15, 21 | sselid 3975 | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ ℝ*) |
23 | pnfxr 11272 | . . . . . . . 8 ⊢ +∞ ∈ ℝ* | |
24 | 23 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → +∞ ∈ ℝ*) |
25 | iccgelb 13386 | . . . . . . 7 ⊢ ((0 ∈ ℝ* ∧ +∞ ∈ ℝ* ∧ 𝐷 ∈ (0[,]+∞)) → 0 ≤ 𝐷) | |
26 | 20, 24, 21, 25 | syl3anc 1368 | . . . . . 6 ⊢ (𝜑 → 0 ≤ 𝐷) |
27 | 20, 22, 16, 26 | xleadd1d 44608 | . . . . 5 ⊢ (𝜑 → (0 +𝑒 𝐸) ≤ (𝐷 +𝑒 𝐸)) |
28 | 18, 27 | eqbrtrd 5163 | . . . 4 ⊢ (𝜑 → 𝐸 ≤ (𝐷 +𝑒 𝐸)) |
29 | 28 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐸 ≤ (𝐷 +𝑒 𝐸)) |
30 | 14, 29 | eqbrtrd 5163 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) ≤ (𝐷 +𝑒 𝐸)) |
31 | sge0prle.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
32 | 31 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ∈ 𝑉) |
33 | 9 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ∈ 𝑊) |
34 | 21 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐷 ∈ (0[,]+∞)) |
35 | 10 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐸 ∈ (0[,]+∞)) |
36 | sge0prle.cd | . . . 4 ⊢ (𝑘 = 𝐴 → 𝐶 = 𝐷) | |
37 | neqne 2942 | . . . . 5 ⊢ (¬ 𝐴 = 𝐵 → 𝐴 ≠ 𝐵) | |
38 | 37 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ≠ 𝐵) |
39 | 32, 33, 34, 35, 36, 11, 38 | sge0pr 45679 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) = (𝐷 +𝑒 𝐸)) |
40 | 22, 16 | xaddcld 13286 | . . . . 5 ⊢ (𝜑 → (𝐷 +𝑒 𝐸) ∈ ℝ*) |
41 | 40 | xrleidd 13137 | . . . 4 ⊢ (𝜑 → (𝐷 +𝑒 𝐸) ≤ (𝐷 +𝑒 𝐸)) |
42 | 41 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐷 +𝑒 𝐸) ≤ (𝐷 +𝑒 𝐸)) |
43 | 39, 42 | eqbrtrd 5163 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) ≤ (𝐷 +𝑒 𝐸)) |
44 | 30, 43 | pm2.61dan 810 | 1 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ {𝐴, 𝐵} ↦ 𝐶)) ≤ (𝐷 +𝑒 𝐸)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ≠ wne 2934 {csn 4623 {cpr 4625 class class class wbr 5141 ↦ cmpt 5224 ‘cfv 6537 (class class class)co 7405 0cc0 11112 +∞cpnf 11249 ℝ*cxr 11251 ≤ cle 11253 +𝑒 cxad 13096 [,]cicc 13333 Σ^csumge0 45647 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-inf2 9638 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-oi 9507 df-card 9936 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-rp 12981 df-xadd 13099 df-ico 13336 df-icc 13337 df-fz 13491 df-fzo 13634 df-seq 13973 df-exp 14033 df-hash 14296 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-clim 15438 df-sum 15639 df-sumge0 45648 |
This theorem is referenced by: omeunle 45801 |
Copyright terms: Public domain | W3C validator |