xlesubadd - Metamath Proof Explorer

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

Theorem xlesubadd 13230

Description: Under certain conditions, the conclusion of lesubadd 11657 is true even in the extended reals. (Contributed by Mario Carneiro, 4-Sep-2015.)

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

**Proof of Theorem xlesubadd**
Step	Hyp	Ref	Expression
1		simpl1 1192	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 𝐴 ∈ ℝ^)
2		simpl2 1193	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 𝐵 ∈ ℝ^)
3		xnegcl 13180	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → -_𝑒𝐵 ∈ ℝ^*)
4	2, 3	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → -_𝑒𝐵 ∈ ℝ^)
5		xaddcl 13206	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ -_𝑒𝐵 ∈ ℝ^) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^)
6	1, 4, 5	syl2anc 584	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^)
7	6	adantr 480	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 ∈ ℝ) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^)
8		simpll3 1215	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 ∈ ℝ) → 𝐶 ∈ ℝ^)
9		simpr 484	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
10		xleadd1 13222	. . . 4 ⊢ (((𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^* ∧ 𝐶 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → ((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) ≤ (𝐶 +_𝑒 𝐵)))
11	7, 8, 9, 10	syl3anc 1373	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 ∈ ℝ) → ((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) ≤ (𝐶 +_𝑒 𝐵)))
12		xnpcan 13219	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) = 𝐴)
13	1, 12	sylan 580	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 ∈ ℝ) → ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) = 𝐴)
14	13	breq1d 5120	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 ∈ ℝ) → (((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) ≤ (𝐶 +_𝑒 𝐵) ↔ 𝐴 ≤ (𝐶 +_𝑒 𝐵)))
15	11, 14	bitrd 279	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 ∈ ℝ) → ((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 +_𝑒 𝐵)))
16		simpr3 1197	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 0 ≤ 𝐶)
17		oveq1 7397	. . . . . . . . 9 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 -∞) = (+∞ +_𝑒 -∞))
18		pnfaddmnf 13197	. . . . . . . . 9 ⊢ (+∞ +_𝑒 -∞) = 0
19	17, 18	eqtrdi 2781	. . . . . . . 8 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 -∞) = 0)
20	19	breq1d 5120	. . . . . . 7 ⊢ (𝐴 = +∞ → ((𝐴 +_𝑒 -∞) ≤ 𝐶 ↔ 0 ≤ 𝐶))
21	16, 20	syl5ibrcom 247	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐴 = +∞ → (𝐴 +_𝑒 -∞) ≤ 𝐶))
22		xaddmnf1 13195	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ +∞) → (𝐴 +_𝑒 -∞) = -∞)
23	22	ex 412	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → (𝐴 ≠ +∞ → (𝐴 +_𝑒 -∞) = -∞))
24	1, 23	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐴 ≠ +∞ → (𝐴 +_𝑒 -∞) = -∞))
25		simpl3 1194	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 𝐶 ∈ ℝ^)
26		mnfle 13102	. . . . . . . . 9 ⊢ (𝐶 ∈ ℝ^* → -∞ ≤ 𝐶)
27	25, 26	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → -∞ ≤ 𝐶)
28		breq1 5113	. . . . . . . 8 ⊢ ((𝐴 +_𝑒 -∞) = -∞ → ((𝐴 +_𝑒 -∞) ≤ 𝐶 ↔ -∞ ≤ 𝐶))
29	27, 28	syl5ibrcom 247	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → ((𝐴 +_𝑒 -∞) = -∞ → (𝐴 +_𝑒 -∞) ≤ 𝐶))
30	24, 29	syld 47	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐴 ≠ +∞ → (𝐴 +_𝑒 -∞) ≤ 𝐶))
31	21, 30	pm2.61dne 3012	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐴 +_𝑒 -∞) ≤ 𝐶)
32		pnfge 13097	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ +∞)
33	1, 32	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 𝐴 ≤ +∞)
34		ge0nemnf 13140	. . . . . . . 8 ⊢ ((𝐶 ∈ ℝ^* ∧ 0 ≤ 𝐶) → 𝐶 ≠ -∞)
35	25, 16, 34	syl2anc 584	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 𝐶 ≠ -∞)
36		xaddpnf1 13193	. . . . . . 7 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐶 ≠ -∞) → (𝐶 +_𝑒 +∞) = +∞)
37	25, 35, 36	syl2anc 584	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐶 +_𝑒 +∞) = +∞)
38	33, 37	breqtrrd 5138	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 𝐴 ≤ (𝐶 +_𝑒 +∞))
39	31, 38	2thd 265	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → ((𝐴 +_𝑒 -∞) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 +_𝑒 +∞)))
40		xnegeq 13174	. . . . . . . 8 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -_𝑒+∞)
41		xnegpnf 13176	. . . . . . . 8 ⊢ -_𝑒+∞ = -∞
42	40, 41	eqtrdi 2781	. . . . . . 7 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -∞)
43	42	oveq2d 7406	. . . . . 6 ⊢ (𝐵 = +∞ → (𝐴 +_𝑒 -_𝑒𝐵) = (𝐴 +_𝑒 -∞))
44	43	breq1d 5120	. . . . 5 ⊢ (𝐵 = +∞ → ((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ (𝐴 +_𝑒 -∞) ≤ 𝐶))
45		oveq2 7398	. . . . . 6 ⊢ (𝐵 = +∞ → (𝐶 +_𝑒 𝐵) = (𝐶 +_𝑒 +∞))
46	45	breq2d 5122	. . . . 5 ⊢ (𝐵 = +∞ → (𝐴 ≤ (𝐶 +_𝑒 𝐵) ↔ 𝐴 ≤ (𝐶 +_𝑒 +∞)))
47	44, 46	bibi12d 345	. . . 4 ⊢ (𝐵 = +∞ → (((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 +_𝑒 𝐵)) ↔ ((𝐴 +_𝑒 -∞) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 +_𝑒 +∞))))
48	39, 47	syl5ibrcom 247	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐵 = +∞ → ((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 +_𝑒 𝐵))))
49	48	imp 406	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) ∧ 𝐵 = +∞) → ((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 +_𝑒 𝐵)))
50		simpr2 1196	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → 𝐵 ≠ -∞)
51	2, 50	jca 511	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐵 ∈ ℝ^ ∧ 𝐵 ≠ -∞))
52		xrnemnf 13084	. . 3 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ -∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞))
53	51, 52	sylib 218	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞))
54	15, 49, 53	mpjaodan 960	1 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (0 ≤ 𝐴 ∧ 𝐵 ≠ -∞ ∧ 0 ≤ 𝐶)) → ((𝐴 +_𝑒 -_𝑒𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 +_𝑒 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 class class class wbr 5110 (class class class)co 7390 ℝcr 11074 0cc0 11075 +∞cpnf 11212 -∞cmnf 11213 ℝ^*cxr 11214 ≤ cle 11216 -_𝑒cxne 13076 +_𝑒 cxad 13077

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 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151

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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-po 5549 df-so 5550 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-xneg 13079 df-xadd 13080

This theorem is referenced by: xmetrtri 24250 metdstri 24747 metdscnlem 24751

W3C validator