xsubge0 - Metamath Proof Explorer

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

Theorem xsubge0 13181

Description: Extended real version of subge0 11651. (Contributed by Mario Carneiro, 24-Aug-2015.)

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

**Proof of Theorem xsubge0**
Step	Hyp	Ref	Expression
1		elxr 13036	. 2 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
2		0xr 11181	. . . . 5 ⊢ 0 ∈ ℝ^*
3		rexr 11180	. . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
4		xnegcl 13133	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → -_𝑒𝐵 ∈ ℝ^*)
5		xaddcl 13159	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ -_𝑒𝐵 ∈ ℝ^) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^)
6	4, 5	sylan2 593	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^)
7	3, 6	sylan2 593	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^*)
8		simpr 484	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
9		xleadd1 13175	. . . . 5 ⊢ ((0 ∈ ℝ^* ∧ (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ (0 +_𝑒 𝐵) ≤ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵)))
10	2, 7, 8, 9	mp3an2i 1468	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ (0 +_𝑒 𝐵) ≤ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵)))
11	3	adantl 481	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ^*)
12		xaddlid 13162	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → (0 +_𝑒 𝐵) = 𝐵)
13	11, 12	syl 17	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 +_𝑒 𝐵) = 𝐵)
14		xnpcan 13172	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) = 𝐴)
15	13, 14	breq12d 5108	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → ((0 +_𝑒 𝐵) ≤ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) ↔ 𝐵 ≤ 𝐴))
16	10, 15	bitrd 279	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
17		pnfxr 11188	. . . . . . 7 ⊢ +∞ ∈ ℝ^*
18		xrletri3 13074	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → (𝐴 = +∞ ↔ (𝐴 ≤ +∞ ∧ +∞ ≤ 𝐴)))
19	17, 18	mpan2 691	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → (𝐴 = +∞ ↔ (𝐴 ≤ +∞ ∧ +∞ ≤ 𝐴)))
20		mnflt0 13045	. . . . . . . . . . 11 ⊢ -∞ < 0
21		mnfxr 11191	. . . . . . . . . . . 12 ⊢ -∞ ∈ ℝ^*
22		xrltnle 11201	. . . . . . . . . . . 12 ⊢ ((-∞ ∈ ℝ^* ∧ 0 ∈ ℝ^*) → (-∞ < 0 ↔ ¬ 0 ≤ -∞))
23	21, 2, 22	mp2an 692	. . . . . . . . . . 11 ⊢ (-∞ < 0 ↔ ¬ 0 ≤ -∞)
24	20, 23	mpbi 230	. . . . . . . . . 10 ⊢ ¬ 0 ≤ -∞
25		xaddmnf1 13148	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ +∞) → (𝐴 +_𝑒 -∞) = -∞)
26	25	breq2d 5107	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ +∞) → (0 ≤ (𝐴 +_𝑒 -∞) ↔ 0 ≤ -∞))
27	24, 26	mtbiri 327	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ +∞) → ¬ 0 ≤ (𝐴 +_𝑒 -∞))
28	27	ex 412	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → (𝐴 ≠ +∞ → ¬ 0 ≤ (𝐴 +_𝑒 -∞)))
29	28	necon4ad 2944	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
30		0le0 12247	. . . . . . . 8 ⊢ 0 ≤ 0
31		oveq1 7360	. . . . . . . . 9 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 -∞) = (+∞ +_𝑒 -∞))
32		pnfaddmnf 13150	. . . . . . . . 9 ⊢ (+∞ +_𝑒 -∞) = 0
33	31, 32	eqtrdi 2780	. . . . . . . 8 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 -∞) = 0)
34	30, 33	breqtrrid 5133	. . . . . . 7 ⊢ (𝐴 = +∞ → 0 ≤ (𝐴 +_𝑒 -∞))
35	29, 34	impbid1 225	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 -∞) ↔ 𝐴 = +∞))
36		pnfge 13050	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ +∞)
37	36	biantrurd 532	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → (+∞ ≤ 𝐴 ↔ (𝐴 ≤ +∞ ∧ +∞ ≤ 𝐴)))
38	19, 35, 37	3bitr4d 311	. . . . 5 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 -∞) ↔ +∞ ≤ 𝐴))
39	38	adantr 480	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (0 ≤ (𝐴 +_𝑒 -∞) ↔ +∞ ≤ 𝐴))
40		xnegeq 13127	. . . . . . . 8 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -_𝑒+∞)
41		xnegpnf 13129	. . . . . . . 8 ⊢ -_𝑒+∞ = -∞
42	40, 41	eqtrdi 2780	. . . . . . 7 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -∞)
43	42	adantl 481	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → -_𝑒𝐵 = -∞)
44	43	oveq2d 7369	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (𝐴 +_𝑒 -_𝑒𝐵) = (𝐴 +_𝑒 -∞))
45	44	breq2d 5107	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 0 ≤ (𝐴 +_𝑒 -∞)))
46		breq1 5098	. . . . 5 ⊢ (𝐵 = +∞ → (𝐵 ≤ 𝐴 ↔ +∞ ≤ 𝐴))
47	46	adantl 481	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (𝐵 ≤ 𝐴 ↔ +∞ ≤ 𝐴))
48	39, 45, 47	3bitr4d 311	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
49		oveq1 7360	. . . . . . . . . 10 ⊢ (𝐴 = -∞ → (𝐴 +_𝑒 +∞) = (-∞ +_𝑒 +∞))
50		mnfaddpnf 13151	. . . . . . . . . 10 ⊢ (-∞ +_𝑒 +∞) = 0
51	49, 50	eqtrdi 2780	. . . . . . . . 9 ⊢ (𝐴 = -∞ → (𝐴 +_𝑒 +∞) = 0)
52	51	adantl 481	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 = -∞) → (𝐴 +_𝑒 +∞) = 0)
53	30, 52	breqtrrid 5133	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 = -∞) → 0 ≤ (𝐴 +_𝑒 +∞))
54		0lepnf 13053	. . . . . . . 8 ⊢ 0 ≤ +∞
55		xaddpnf1 13146	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ -∞) → (𝐴 +_𝑒 +∞) = +∞)
56	54, 55	breqtrrid 5133	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ -∞) → 0 ≤ (𝐴 +_𝑒 +∞))
57	53, 56	pm2.61dane 3012	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → 0 ≤ (𝐴 +_𝑒 +∞))
58		mnfle 13055	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → -∞ ≤ 𝐴)
59	57, 58	2thd 265	. . . . 5 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 +∞) ↔ -∞ ≤ 𝐴))
60	59	adantr 480	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (0 ≤ (𝐴 +_𝑒 +∞) ↔ -∞ ≤ 𝐴))
61		xnegeq 13127	. . . . . . . 8 ⊢ (𝐵 = -∞ → -_𝑒𝐵 = -_𝑒-∞)
62		xnegmnf 13130	. . . . . . . 8 ⊢ -_𝑒-∞ = +∞
63	61, 62	eqtrdi 2780	. . . . . . 7 ⊢ (𝐵 = -∞ → -_𝑒𝐵 = +∞)
64	63	adantl 481	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → -_𝑒𝐵 = +∞)
65	64	oveq2d 7369	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (𝐴 +_𝑒 -_𝑒𝐵) = (𝐴 +_𝑒 +∞))
66	65	breq2d 5107	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 0 ≤ (𝐴 +_𝑒 +∞)))
67		breq1 5098	. . . . 5 ⊢ (𝐵 = -∞ → (𝐵 ≤ 𝐴 ↔ -∞ ≤ 𝐴))
68	67	adantl 481	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (𝐵 ≤ 𝐴 ↔ -∞ ≤ 𝐴))
69	60, 66, 68	3bitr4d 311	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
70	16, 48, 69	3jaodan 1433	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
71	1, 70	sylan2b 594	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ w3o 1085 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 class class class wbr 5095 (class class class)co 7353 ℝcr 11027 0cc0 11028 +∞cpnf 11165 -∞cmnf 11166 ℝ^*cxr 11167 < clt 11168 ≤ cle 11169 -_𝑒cxne 13029 +_𝑒 cxad 13030

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-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104

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-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-po 5531 df-so 5532 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-1st 7931 df-2nd 7932 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-xneg 13032 df-xadd 13033

This theorem is referenced by: xposdif 13182 ssblps 24326 ssbl 24327 xrsxmet 24714 xrge0subcld 32719 esumle 34024 esumlef 34028

W3C validator