xaddge0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xaddge0		Structured version Visualization version GIF version

Theorem xaddge0 13296

Description: The sum of nonnegative extended reals is nonnegative. (Contributed by Mario Carneiro, 21-Aug-2015.)

**Assertion**
Ref	Expression
xaddge0	⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 0 ≤ (𝐴 +_𝑒 𝐵))

**Proof of Theorem xaddge0**
Step	Hyp	Ref	Expression
1		0xr 11267	. . 3 ⊢ 0 ∈ ℝ^*
2	1	a1i 11	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 0 ∈ ℝ^)
3		simplr 781	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ∈ ℝ^)
4		xaddcl 13277	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐴 +_𝑒 𝐵) ∈ ℝ^)
5	4	adantr 486	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → (𝐴 +_𝑒 𝐵) ∈ ℝ^)
6		simprr 785	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 0 ≤ 𝐵)
7		xaddlid 13280	. . . 4 ⊢ (𝐵 ∈ ℝ^* → (0 +_𝑒 𝐵) = 𝐵)
8	3, 7	syl 18	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → (0 +_𝑒 𝐵) = 𝐵)
9		simpll 779	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 𝐴 ∈ ℝ^)
10		simprl 783	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 0 ≤ 𝐴)
11		xleadd1a 13291	. . . 4 ⊢ (((0 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ 0 ≤ 𝐴) → (0 +_𝑒 𝐵) ≤ (𝐴 +_𝑒 𝐵))
12	2, 9, 3, 10, 11	syl31anc 1400	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → (0 +_𝑒 𝐵) ≤ (𝐴 +_𝑒 𝐵))
13	8, 12	eqbrtrrd 5137	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 𝐵 ≤ (𝐴 +_𝑒 𝐵))
14	2, 3, 5, 6, 13	xrletrd 13199	1 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 0 ≤ 𝐵)) → 0 ≤ (𝐴 +_𝑒 𝐵))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 class class class wbr 5111 (class class class)co 7416 0cc0 11111 ℝ^*cxr 11253 ≤ cle 11255 +_𝑒 cxad 13147

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-xadd 13150

This theorem is used by: ge0xaddcl 13501 xrge0addcld 33153

W3C validator