xrlexaddrp - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > xrlexaddrp		Structured version Visualization version GIF version

Theorem xrlexaddrp 46048

Description: If an extended real number 𝐴 can be approximated from above, adding positive reals to 𝐵, then 𝐴 is less than or equal to 𝐵. (Contributed by Glauco Siliprandi, 11-Oct-2020.)

**Hypotheses**
Ref	Expression
xrlexaddrp.1	⊢ (𝜑 → 𝐴 ∈ ℝ^*)
xrlexaddrp.2	⊢ (𝜑 → 𝐵 ∈ ℝ^*)
xrlexaddrp.3	⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝐴 ≤ (𝐵 +_𝑒 𝑥))

**Assertion**
Ref	Expression
xrlexaddrp	⊢ (𝜑 → 𝐴 ≤ 𝐵)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝜑,𝑥

**Proof of Theorem xrlexaddrp**
Step	Hyp	Ref	Expression
1		xrlexaddrp.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
2		pnfge 13156	. . . . 5 ⊢ (𝐴 ∈ ℝ^* → 𝐴 ≤ +∞)
3	1, 2	syl 18	. . . 4 ⊢ (𝜑 → 𝐴 ≤ +∞)
4	3	adantr 485	. . 3 ⊢ ((𝜑 ∧ 𝐵 = +∞) → 𝐴 ≤ +∞)
5		id 23	. . . . 5 ⊢ (𝐵 = +∞ → 𝐵 = +∞)
6	5	eqcomd 2769	. . . 4 ⊢ (𝐵 = +∞ → +∞ = 𝐵)
7	6	adantl 486	. . 3 ⊢ ((𝜑 ∧ 𝐵 = +∞) → +∞ = 𝐵)
8	4, 7	breqtrd 5138	. 2 ⊢ ((𝜑 ∧ 𝐵 = +∞) → 𝐴 ≤ 𝐵)
9		simpl 487	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → 𝜑)
10		neqne 2966	. . . 4 ⊢ (¬ 𝐵 = +∞ → 𝐵 ≠ +∞)
11	10	adantl 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → 𝐵 ≠ +∞)
12		simpr 489	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -∞) → 𝐴 = -∞)
13		xrlexaddrp.2	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
14		mnfle 13161	. . . . . . . 8 ⊢ (𝐵 ∈ ℝ^* → -∞ ≤ 𝐵)
15	13, 14	syl 18	. . . . . . 7 ⊢ (𝜑 → -∞ ≤ 𝐵)
16	15	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = -∞) → -∞ ≤ 𝐵)
17	12, 16	eqbrtrd 5134	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = -∞) → 𝐴 ≤ 𝐵)
18	17	adantlr 727	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ 𝐴 = -∞) → 𝐴 ≤ 𝐵)
19		simpl 487	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ ¬ 𝐴 = -∞) → (𝜑 ∧ 𝐵 ≠ +∞))
20		neqne 2966	. . . . . 6 ⊢ (¬ 𝐴 = -∞ → 𝐴 ≠ -∞)
21	20	adantl 486	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ≠ -∞)
22		simpll 778	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ 𝐴 ≠ -∞) → 𝜑)
23	13	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ≠ +∞) → 𝐵 ∈ ℝ^*)
24		simpr 489	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ≠ +∞) → 𝐵 ≠ +∞)
25	23, 24	jca 520	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ≠ +∞) → (𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞))
26		xrnepnf 13144	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐵 ≠ +∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = -∞))
27	25, 26	sylib 221	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ≠ +∞) → (𝐵 ∈ ℝ ∨ 𝐵 = -∞))
28	27	adantr 485	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ ¬ 𝐵 ∈ ℝ) → (𝐵 ∈ ℝ ∨ 𝐵 = -∞))
29		simpr 489	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ ¬ 𝐵 ∈ ℝ) → ¬ 𝐵 ∈ ℝ)
30		pm2.53 864	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∨ 𝐵 = -∞) → (¬ 𝐵 ∈ ℝ → 𝐵 = -∞))
31	28, 29, 30	sylc 66	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ ¬ 𝐵 ∈ ℝ) → 𝐵 = -∞)
32	31	adantlr 727	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐵 ≠ +∞) ∧ 𝐴 ≠ -∞) ∧ ¬ 𝐵 ∈ ℝ) → 𝐵 = -∞)
33		id 23	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝜑)
34		1rp 13021	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℝ⁺
35	34	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 1 ∈ ℝ⁺)
36		1re 11209	. . . . . . . . . . . . . . 15 ⊢ 1 ∈ ℝ
37	36	elexi 3477	. . . . . . . . . . . . . 14 ⊢ 1 ∈ V
38		eleq1 2851	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 1 → (𝑥 ∈ ℝ⁺ ↔ 1 ∈ ℝ⁺))
39	38	anbi2d 641	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 1 → ((𝜑 ∧ 𝑥 ∈ ℝ⁺) ↔ (𝜑 ∧ 1 ∈ ℝ⁺)))
40		oveq2 7420	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 1 → (𝐵 +_𝑒 𝑥) = (𝐵 +_𝑒 1))
41	40	breq2d 5122	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 1 → (𝐴 ≤ (𝐵 +_𝑒 𝑥) ↔ 𝐴 ≤ (𝐵 +_𝑒 1)))
42	39, 41	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 1 → (((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝐴 ≤ (𝐵 +_𝑒 𝑥)) ↔ ((𝜑 ∧ 1 ∈ ℝ⁺) → 𝐴 ≤ (𝐵 +_𝑒 1))))
43		xrlexaddrp.3	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝐴 ≤ (𝐵 +_𝑒 𝑥))
44	37, 42, 43	vtocl 3526	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 1 ∈ ℝ⁺) → 𝐴 ≤ (𝐵 +_𝑒 1))
45	33, 35, 44	syl2anc 595	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ≤ (𝐵 +_𝑒 1))
46	45	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → 𝐴 ≤ (𝐵 +_𝑒 1))
47		oveq1 7419	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 = -∞ → (𝐵 +_𝑒 1) = (-∞ +_𝑒 1))
48		1xr 11269	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℝ^*
49		ltpnf 13146	. . . . . . . . . . . . . . . . . . . 20 ⊢ (1 ∈ ℝ → 1 < +∞)
50	36, 49	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ 1 < +∞
51	36, 50	ltneii 11324	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ≠ +∞
52		xaddmnf2 13256	. . . . . . . . . . . . . . . . . 18 ⊢ ((1 ∈ ℝ^* ∧ 1 ≠ +∞) → (-∞ +_𝑒 1) = -∞)
53	48, 51, 52	mp2an 704	. . . . . . . . . . . . . . . . 17 ⊢ (-∞ +_𝑒 1) = -∞
54	53	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 = -∞ → (-∞ +_𝑒 1) = -∞)
55	47, 54	eqtr2d 2799	. . . . . . . . . . . . . . 15 ⊢ (𝐵 = -∞ → -∞ = (𝐵 +_𝑒 1))
56	55	adantl 486	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → -∞ = (𝐵 +_𝑒 1))
57	56	eqcomd 2769	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → (𝐵 +_𝑒 1) = -∞)
58	1	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐴 ≠ -∞) → 𝐴 ∈ ℝ^*)
59		simpr 489	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐴 ≠ -∞) → 𝐴 ≠ -∞)
60		nemnftgtmnft 46040	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐴 ≠ -∞) → -∞ < 𝐴)
61	58, 59, 60	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐴 ≠ -∞) → -∞ < 𝐴)
62	61	adantr 485	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → -∞ < 𝐴)
63	57, 62	eqbrtrd 5134	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → (𝐵 +_𝑒 1) < 𝐴)
64	13	ad2antrr 738	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → 𝐵 ∈ ℝ^*)
65	48	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → 1 ∈ ℝ^*)
66	64, 65	xaddcld 13328	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → (𝐵 +_𝑒 1) ∈ ℝ^*)
67	1	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → 𝐴 ∈ ℝ^*)
68		xrltnle 11277	. . . . . . . . . . . . 13 ⊢ (((𝐵 +_𝑒 1) ∈ ℝ^* ∧ 𝐴 ∈ ℝ^*) → ((𝐵 +_𝑒 1) < 𝐴 ↔ ¬ 𝐴 ≤ (𝐵 +_𝑒 1)))
69	66, 67, 68	syl2anc 595	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → ((𝐵 +_𝑒 1) < 𝐴 ↔ ¬ 𝐴 ≤ (𝐵 +_𝑒 1)))
70	63, 69	mpbid 235	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐴 ≠ -∞) ∧ 𝐵 = -∞) → ¬ 𝐴 ≤ (𝐵 +_𝑒 1))
71	46, 70	pm2.65da 828	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ≠ -∞) → ¬ 𝐵 = -∞)
72	71	neqned 2965	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ≠ -∞) → 𝐵 ≠ -∞)
73	72	ad4ant13 763	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐵 ≠ +∞) ∧ 𝐴 ≠ -∞) ∧ ¬ 𝐵 ∈ ℝ) → 𝐵 ≠ -∞)
74	73	neneqd 2963	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐵 ≠ +∞) ∧ 𝐴 ≠ -∞) ∧ ¬ 𝐵 ∈ ℝ) → ¬ 𝐵 = -∞)
75	32, 74	condan 829	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ 𝐴 ≠ -∞) → 𝐵 ∈ ℝ)
76	43	adantlr 727	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ⁺) → 𝐴 ≤ (𝐵 +_𝑒 𝑥))
77		simpl 487	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ ∧ 𝑥 ∈ ℝ⁺) → 𝐵 ∈ ℝ)
78		rpre 13026	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
79	78	adantl 486	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ ∧ 𝑥 ∈ ℝ⁺) → 𝑥 ∈ ℝ)
80		rexadd 13259	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐵 +_𝑒 𝑥) = (𝐵 + 𝑥))
81	77, 79, 80	syl2anc 595	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℝ ∧ 𝑥 ∈ ℝ⁺) → (𝐵 +_𝑒 𝑥) = (𝐵 + 𝑥))
82	81	adantll 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ⁺) → (𝐵 +_𝑒 𝑥) = (𝐵 + 𝑥))
83	76, 82	breqtrd 5138	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ ℝ) ∧ 𝑥 ∈ ℝ⁺) → 𝐴 ≤ (𝐵 + 𝑥))
84	83	ralrimiva 3157	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ ℝ) → ∀𝑥 ∈ ℝ⁺ 𝐴 ≤ (𝐵 + 𝑥))
85	1	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ^*)
86		simpr 489	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
87		xralrple 13232	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ∀𝑥 ∈ ℝ⁺ 𝐴 ≤ (𝐵 + 𝑥)))
88	85, 86, 87	syl2anc 595	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ∀𝑥 ∈ ℝ⁺ 𝐴 ≤ (𝐵 + 𝑥)))
89	84, 88	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ ℝ) → 𝐴 ≤ 𝐵)
90	22, 75, 89	syl2anc 595	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ 𝐴 ≠ -∞) → 𝐴 ≤ 𝐵)
91	19, 21, 90	syl2anc 595	. . . 4 ⊢ (((𝜑 ∧ 𝐵 ≠ +∞) ∧ ¬ 𝐴 = -∞) → 𝐴 ≤ 𝐵)
92	18, 91	pm2.61dan 824	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≠ +∞) → 𝐴 ≤ 𝐵)
93	9, 11, 92	syl2anc 595	. 2 ⊢ ((𝜑 ∧ ¬ 𝐵 = +∞) → 𝐴 ≤ 𝐵)
94	8, 93	pm2.61dan 824	1 ⊢ (𝜑 → 𝐴 ≤ 𝐵)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 class class class wbr 5110 (class class class)co 7412 ℝcr 11100 1c1 11102 + caddc 11104 +∞cpnf 11241 -∞cmnf 11242 ℝ^*cxr 11243 < clt 11244 ≤ cle 11245 ℝ⁺crp 13017 +_𝑒 cxad 13136

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 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-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-sup 9403 df-inf 9404 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-n0 12506 df-z 12593 df-uz 12864 df-q 12974 df-rp 13018 df-xadd 13139

This theorem is referenced by: infleinf 46067 sge0xaddlem2 47128 ovnsubadd 47266

W3C validator