xsubge0 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > xsubge0		GIF version

Theorem xsubge0 10045

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

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

**Proof of Theorem xsubge0**
Step	Hyp	Ref	Expression
1		elxr 9940	. 2 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
2		0xr 8161	. . . . 5 ⊢ 0 ∈ ℝ^*
3		rexr 8160	. . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
4		xnegcl 9996	. . . . . . 7 ⊢ (𝐵 ∈ ℝ^* → -_𝑒𝐵 ∈ ℝ^*)
5		xaddcl 10024	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ -_𝑒𝐵 ∈ ℝ^) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^)
6	4, 5	sylan2 286	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^)
7	3, 6	sylan2 286	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^*)
8		simpr 110	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
9		xleadd1 10039	. . . . 5 ⊢ ((0 ∈ ℝ^* ∧ (𝐴 +_𝑒 -_𝑒𝐵) ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ (0 +_𝑒 𝐵) ≤ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵)))
10	2, 7, 8, 9	mp3an2i 1357	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ (0 +_𝑒 𝐵) ≤ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵)))
11	3	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ^*)
12		xaddid2 10027	. . . . . 6 ⊢ (𝐵 ∈ ℝ^* → (0 +_𝑒 𝐵) = 𝐵)
13	11, 12	syl 14	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 +_𝑒 𝐵) = 𝐵)
14		xnpcan 10036	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) = 𝐴)
15	13, 14	breq12d 4075	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → ((0 +_𝑒 𝐵) ≤ ((𝐴 +_𝑒 -_𝑒𝐵) +_𝑒 𝐵) ↔ 𝐵 ≤ 𝐴))
16	10, 15	bitrd 188	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
17		pnfxr 8167	. . . . . . 7 ⊢ +∞ ∈ ℝ^*
18		xrletri3 9968	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ +∞ ∈ ℝ^*) → (𝐴 = +∞ ↔ (𝐴 ≤ +∞ ∧ +∞ ≤ 𝐴)))
19	17, 18	mpan2 425	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → (𝐴 = +∞ ↔ (𝐴 ≤ +∞ ∧ +∞ ≤ 𝐴)))
20		rexr 8160	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
21		renepnf 8162	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
22		xaddmnf1 10012	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ +∞) → (𝐴 +_𝑒 -∞) = -∞)
23	20, 21, 22	syl2anc 411	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → (𝐴 +_𝑒 -∞) = -∞)
24		mnflt0 9948	. . . . . . . . . . . . 13 ⊢ -∞ < 0
25		mnfxr 8171	. . . . . . . . . . . . . . 15 ⊢ -∞ ∈ ℝ^*
26		xrlenlt 8179	. . . . . . . . . . . . . . 15 ⊢ ((0 ∈ ℝ^* ∧ -∞ ∈ ℝ^*) → (0 ≤ -∞ ↔ ¬ -∞ < 0))
27	2, 25, 26	mp2an 426	. . . . . . . . . . . . . 14 ⊢ (0 ≤ -∞ ↔ ¬ -∞ < 0)
28	27	biimpi 120	. . . . . . . . . . . . 13 ⊢ (0 ≤ -∞ → ¬ -∞ < 0)
29	24, 28	mt2 643	. . . . . . . . . . . 12 ⊢ ¬ 0 ≤ -∞
30		breq2 4066	. . . . . . . . . . . 12 ⊢ ((𝐴 +_𝑒 -∞) = -∞ → (0 ≤ (𝐴 +_𝑒 -∞) ↔ 0 ≤ -∞))
31	29, 30	mtbiri 679	. . . . . . . . . . 11 ⊢ ((𝐴 +_𝑒 -∞) = -∞ → ¬ 0 ≤ (𝐴 +_𝑒 -∞))
32	31	pm2.21d 622	. . . . . . . . . 10 ⊢ ((𝐴 +_𝑒 -∞) = -∞ → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
33	23, 32	syl 14	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
34	33	adantl 277	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ∈ ℝ) → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
35		simpr 110	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 = +∞) → 𝐴 = +∞)
36	35	a1d 22	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 = +∞) → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
37		eleq1 2272	. . . . . . . . . . . 12 ⊢ (𝐴 = -∞ → (𝐴 ∈ ℝ^* ↔ -∞ ∈ ℝ^*))
38	25, 37	mpbiri 168	. . . . . . . . . . 11 ⊢ (𝐴 = -∞ → 𝐴 ∈ ℝ^*)
39		mnfnepnf 8170	. . . . . . . . . . . 12 ⊢ -∞ ≠ +∞
40		neeq1 2393	. . . . . . . . . . . 12 ⊢ (𝐴 = -∞ → (𝐴 ≠ +∞ ↔ -∞ ≠ +∞))
41	39, 40	mpbiri 168	. . . . . . . . . . 11 ⊢ (𝐴 = -∞ → 𝐴 ≠ +∞)
42	38, 41, 22	syl2anc 411	. . . . . . . . . 10 ⊢ (𝐴 = -∞ → (𝐴 +_𝑒 -∞) = -∞)
43	42, 32	syl 14	. . . . . . . . 9 ⊢ (𝐴 = -∞ → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
44	43	adantl 277	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 = -∞) → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
45		elxr 9940	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
46	45	biimpi 120	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
47	34, 36, 44, 46	mpjao3dan 1322	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 -∞) → 𝐴 = +∞))
48		0le0 9167	. . . . . . . 8 ⊢ 0 ≤ 0
49		oveq1 5981	. . . . . . . . 9 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 -∞) = (+∞ +_𝑒 -∞))
50		pnfaddmnf 10014	. . . . . . . . 9 ⊢ (+∞ +_𝑒 -∞) = 0
51	49, 50	eqtrdi 2258	. . . . . . . 8 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 -∞) = 0)
52	48, 51	breqtrrid 4100	. . . . . . 7 ⊢ (𝐴 = +∞ → 0 ≤ (𝐴 +_𝑒 -∞))
53	47, 52	impbid1 142	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 -∞) ↔ 𝐴 = +∞))
54		pnfge 9953	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ +∞)
55	54	biantrurd 305	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → (+∞ ≤ 𝐴 ↔ (𝐴 ≤ +∞ ∧ +∞ ≤ 𝐴)))
56	19, 53, 55	3bitr4d 220	. . . . 5 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 -∞) ↔ +∞ ≤ 𝐴))
57	56	adantr 276	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (0 ≤ (𝐴 +_𝑒 -∞) ↔ +∞ ≤ 𝐴))
58		xnegeq 9991	. . . . . . . 8 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -_𝑒+∞)
59		xnegpnf 9992	. . . . . . . 8 ⊢ -_𝑒+∞ = -∞
60	58, 59	eqtrdi 2258	. . . . . . 7 ⊢ (𝐵 = +∞ → -_𝑒𝐵 = -∞)
61	60	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → -_𝑒𝐵 = -∞)
62	61	oveq2d 5990	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (𝐴 +_𝑒 -_𝑒𝐵) = (𝐴 +_𝑒 -∞))
63	62	breq2d 4074	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 0 ≤ (𝐴 +_𝑒 -∞)))
64		breq1 4065	. . . . 5 ⊢ (𝐵 = +∞ → (𝐵 ≤ 𝐴 ↔ +∞ ≤ 𝐴))
65	64	adantl 277	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (𝐵 ≤ 𝐴 ↔ +∞ ≤ 𝐴))
66	57, 63, 65	3bitr4d 220	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = +∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
67		oveq1 5981	. . . . . . . . . 10 ⊢ (𝐴 = -∞ → (𝐴 +_𝑒 +∞) = (-∞ +_𝑒 +∞))
68		mnfaddpnf 10015	. . . . . . . . . 10 ⊢ (-∞ +_𝑒 +∞) = 0
69	67, 68	eqtrdi 2258	. . . . . . . . 9 ⊢ (𝐴 = -∞ → (𝐴 +_𝑒 +∞) = 0)
70	69	adantl 277	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 = -∞) → (𝐴 +_𝑒 +∞) = 0)
71	48, 70	breqtrrid 4100	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 = -∞) → 0 ≤ (𝐴 +_𝑒 +∞))
72		df-ne 2381	. . . . . . . 8 ⊢ (𝐴 ≠ -∞ ↔ ¬ 𝐴 = -∞)
73		0lepnf 9954	. . . . . . . . 9 ⊢ 0 ≤ +∞
74		xaddpnf1 10010	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ -∞) → (𝐴 +_𝑒 +∞) = +∞)
75	73, 74	breqtrrid 4100	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ -∞) → 0 ≤ (𝐴 +_𝑒 +∞))
76	72, 75	sylan2br 288	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ ¬ 𝐴 = -∞) → 0 ≤ (𝐴 +_𝑒 +∞))
77		xrmnfdc 10007	. . . . . . . 8 ⊢ (𝐴 ∈ ℝ^* → DECID 𝐴 = -∞)
78		exmiddc 840	. . . . . . . 8 ⊢ (DECID 𝐴 = -∞ → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
79	77, 78	syl 14	. . . . . . 7 ⊢ (𝐴 ∈ ℝ^* → (𝐴 = -∞ ∨ ¬ 𝐴 = -∞))
80	71, 76, 79	mpjaodan 802	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → 0 ≤ (𝐴 +_𝑒 +∞))
81		mnfle 9956	. . . . . 6 ⊢ (𝐴 ∈ ℝ^* → -∞ ≤ 𝐴)
82	80, 81	2thd 175	. . . . 5 ⊢ (𝐴 ∈ ℝ^* → (0 ≤ (𝐴 +_𝑒 +∞) ↔ -∞ ≤ 𝐴))
83	82	adantr 276	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (0 ≤ (𝐴 +_𝑒 +∞) ↔ -∞ ≤ 𝐴))
84		xnegeq 9991	. . . . . . . 8 ⊢ (𝐵 = -∞ → -_𝑒𝐵 = -_𝑒-∞)
85		xnegmnf 9993	. . . . . . . 8 ⊢ -_𝑒-∞ = +∞
86	84, 85	eqtrdi 2258	. . . . . . 7 ⊢ (𝐵 = -∞ → -_𝑒𝐵 = +∞)
87	86	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → -_𝑒𝐵 = +∞)
88	87	oveq2d 5990	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (𝐴 +_𝑒 -_𝑒𝐵) = (𝐴 +_𝑒 +∞))
89	88	breq2d 4074	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 0 ≤ (𝐴 +_𝑒 +∞)))
90		breq1 4065	. . . . 5 ⊢ (𝐵 = -∞ → (𝐵 ≤ 𝐴 ↔ -∞ ≤ 𝐴))
91	90	adantl 277	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (𝐵 ≤ 𝐴 ↔ -∞ ≤ 𝐴))
92	83, 89, 91	3bitr4d 220	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 = -∞) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
93	16, 66, 92	3jaodan 1321	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))
94	1, 93	sylan2b 287	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (0 ≤ (𝐴 +_𝑒 -_𝑒𝐵) ↔ 𝐵 ≤ 𝐴))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 712 DECID wdc 838 ∨ w3o 982 = wceq 1375 ∈ wcel 2180 ≠ wne 2380 class class class wbr 4062 (class class class)co 5974 ℝcr 7966 0cc0 7967 +∞cpnf 8146 -∞cmnf 8147 ℝ^*cxr 8148 < clt 8149 ≤ cle 8150 -_𝑒cxne 9933 +_𝑒 cxad 9934

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-sep 4181 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-cnex 8058 ax-resscn 8059 ax-1cn 8060 ax-1re 8061 ax-icn 8062 ax-addcl 8063 ax-addrcl 8064 ax-mulcl 8065 ax-addcom 8067 ax-addass 8069 ax-distr 8071 ax-i2m1 8072 ax-0id 8075 ax-rnegex 8076 ax-cnre 8078 ax-pre-ltirr 8079 ax-pre-apti 8082 ax-pre-ltadd 8083

This theorem depends on definitions: df-bi 117 df-dc 839 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-nel 2476 df-ral 2493 df-rex 2494 df-reu 2495 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-if 3583 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-id 4361 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-fv 5302 df-riota 5927 df-ov 5977 df-oprab 5978 df-mpo 5979 df-1st 6256 df-2nd 6257 df-pnf 8151 df-mnf 8152 df-xr 8153 df-ltxr 8154 df-le 8155 df-sub 8287 df-neg 8288 df-xneg 9936 df-xadd 9937

This theorem is referenced by: ssblps 15064 ssbl 15065

W3C validator