supxrgere - Mathbox for Glauco Siliprandi

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

Theorem supxrgere 45763

Description: If a real number can be approximated from below by members of a set, then it is less than or equal to the supremum of the set. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

**Hypotheses**
Ref	Expression
supxrgere.xph	⊢ Ⅎ𝑥𝜑
supxrgere.a	⊢ (𝜑 → 𝐴 ⊆ ℝ^*)
supxrgere.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
supxrgere.y	⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦)

**Assertion**
Ref	Expression
supxrgere	⊢ (𝜑 → 𝐵 ≤ sup(𝐴, ℝ^*, < ))

Distinct variable groups: 𝑥,𝐴,𝑦 𝑥,𝐵,𝑦 𝜑,𝑦 Allowed substitution hint: 𝜑(𝑥)

**Proof of Theorem supxrgere**
Step	Hyp	Ref	Expression
1		supxrgere.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
2		rexr 11191	. . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
3		pnfxr 11199	. . . . . . 7 ⊢ +∞ ∈ ℝ^*
4	3	a1i 11	. . . . . 6 ⊢ (𝐵 ∈ ℝ → +∞ ∈ ℝ^*)
5		ltpnf 13071	. . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞)
6	2, 4, 5	xrltled 13101	. . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≤ +∞)
7	1, 6	syl 17	. . . 4 ⊢ (𝜑 → 𝐵 ≤ +∞)
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^*, < ) = +∞) → 𝐵 ≤ +∞)
9		id 22	. . . . 5 ⊢ (sup(𝐴, ℝ^, < ) = +∞ → sup(𝐴, ℝ^, < ) = +∞)
10	9	eqcomd 2742	. . . 4 ⊢ (sup(𝐴, ℝ^, < ) = +∞ → +∞ = sup(𝐴, ℝ^, < ))
11	10	adantl 481	. . 3 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) = +∞) → +∞ = sup(𝐴, ℝ^, < ))
12	8, 11	breqtrd 5111	. 2 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) = +∞) → 𝐵 ≤ sup(𝐴, ℝ^, < ))
13		simpl 482	. . 3 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^*, < ) = +∞) → 𝜑)
14		1rp 12946	. . . . . . . 8 ⊢ 1 ∈ ℝ⁺
15		nfcv 2898	. . . . . . . . . 10 ⊢ Ⅎ𝑥1
16		supxrgere.xph	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝜑
17		nfv 1916	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥1 ∈ ℝ⁺
18	16, 17	nfan 1901	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝜑 ∧ 1 ∈ ℝ⁺)
19		nfv 1916	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦
20	18, 19	nfim 1898	. . . . . . . . . 10 ⊢ Ⅎ𝑥((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
21		eleq1 2824	. . . . . . . . . . . 12 ⊢ (𝑥 = 1 → (𝑥 ∈ ℝ⁺ ↔ 1 ∈ ℝ⁺))
22	21	anbi2d 631	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → ((𝜑 ∧ 𝑥 ∈ ℝ⁺) ↔ (𝜑 ∧ 1 ∈ ℝ⁺)))
23		oveq2 7375	. . . . . . . . . . . . 13 ⊢ (𝑥 = 1 → (𝐵 − 𝑥) = (𝐵 − 1))
24	23	breq1d 5095	. . . . . . . . . . . 12 ⊢ (𝑥 = 1 → ((𝐵 − 𝑥) < 𝑦 ↔ (𝐵 − 1) < 𝑦))
25	24	rexbidv 3161	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → (∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦 ↔ ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
26	22, 25	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑥 = 1 → (((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦) ↔ ((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
27		supxrgere.y	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦)
28	15, 20, 26, 27	vtoclgf 3513	. . . . . . . . 9 ⊢ (1 ∈ ℝ⁺ → ((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
29	14, 28	ax-mp 5	. . . . . . . 8 ⊢ ((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
30	14, 29	mpan2 692	. . . . . . 7 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
31	30	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^*, < ) = +∞) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
32		mnfxr 11202	. . . . . . . . . . 11 ⊢ -∞ ∈ ℝ^*
33	32	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → -∞ ∈ ℝ^*)
34		supxrgere.a	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ ℝ^*)
35	34	sselda 3921	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ^*)
36	35	3adant3 1133	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → 𝑦 ∈ ℝ^*)
37		supxrcl 13267	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ ℝ^* → sup(𝐴, ℝ^, < ) ∈ ℝ^)
38	34, 37	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → sup(𝐴, ℝ^, < ) ∈ ℝ^)
39	38	3ad2ant1 1134	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → sup(𝐴, ℝ^, < ) ∈ ℝ^)
40		peano2rem 11461	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ ℝ → (𝐵 − 1) ∈ ℝ)
41	1, 40	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐵 − 1) ∈ ℝ)
42	41	rexrd 11195	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐵 − 1) ∈ ℝ^*)
43	42	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) ∈ ℝ^*)
44	43	3ad2antl1 1187	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) ∈ ℝ^*)
45	36	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → 𝑦 ∈ ℝ^*)
46	32	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → -∞ ∈ ℝ^*)
47		simpl3 1195	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) < 𝑦)
48		simpr 484	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → ¬ -∞ < 𝑦)
49	35	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → 𝑦 ∈ ℝ^*)
50	32	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → -∞ ∈ ℝ^*)
51		xrlenlt 11210	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℝ^* ∧ -∞ ∈ ℝ^*) → (𝑦 ≤ -∞ ↔ ¬ -∞ < 𝑦))
52	49, 50, 51	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → (𝑦 ≤ -∞ ↔ ¬ -∞ < 𝑦))
53	48, 52	mpbird 257	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → 𝑦 ≤ -∞)
54	53	3adantl3 1170	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → 𝑦 ≤ -∞)
55	44, 45, 46, 47, 54	xrltletrd 13112	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) < -∞)
56		nltmnf 13080	. . . . . . . . . . . . . 14 ⊢ ((𝐵 − 1) ∈ ℝ^* → ¬ (𝐵 − 1) < -∞)
57	42, 56	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ¬ (𝐵 − 1) < -∞)
58	57	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ -∞ < 𝑦) → ¬ (𝐵 − 1) < -∞)
59	58	3ad2antl1 1187	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → ¬ (𝐵 − 1) < -∞)
60	55, 59	condan 818	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦)
61	34	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐴 ⊆ ℝ^*)
62		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
63		supxrub 13276	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝑦 ∈ 𝐴) → 𝑦 ≤ sup(𝐴, ℝ^*, < ))
64	61, 62, 63	syl2anc 585	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ≤ sup(𝐴, ℝ^*, < ))
65	64	3adant3 1133	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → 𝑦 ≤ sup(𝐴, ℝ^*, < ))
66	33, 36, 39, 60, 65	xrltletrd 13112	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → -∞ < sup(𝐴, ℝ^*, < ))
67	66	3exp 1120	. . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ 𝐴 → ((𝐵 − 1) < 𝑦 → -∞ < sup(𝐴, ℝ^*, < ))))
68	67	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (𝑦 ∈ 𝐴 → ((𝐵 − 1) < 𝑦 → -∞ < sup(𝐴, ℝ^, < ))))
69	68	rexlimdv 3136	. . . . . 6 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦 → -∞ < sup(𝐴, ℝ^, < )))
70	31, 69	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → -∞ < sup(𝐴, ℝ^, < ))
71		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → ¬ sup(𝐴, ℝ^, < ) = +∞)
72		nltpnft 13116	. . . . . . . . 9 ⊢ (sup(𝐴, ℝ^, < ) ∈ ℝ^ → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^, < ) < +∞))
73	38, 72	syl 17	. . . . . . . 8 ⊢ (𝜑 → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^, < ) < +∞))
74	73	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^*, < ) < +∞))
75	71, 74	mtbid 324	. . . . . 6 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → ¬ ¬ sup(𝐴, ℝ^, < ) < +∞)
76	75	notnotrd 133	. . . . 5 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → sup(𝐴, ℝ^, < ) < +∞)
77	70, 76	jca 511	. . . 4 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (-∞ < sup(𝐴, ℝ^, < ) ∧ sup(𝐴, ℝ^*, < ) < +∞))
78	38	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → sup(𝐴, ℝ^, < ) ∈ ℝ^*)
79		xrrebnd 13120	. . . . 5 ⊢ (sup(𝐴, ℝ^, < ) ∈ ℝ^ → (sup(𝐴, ℝ^, < ) ∈ ℝ ↔ (-∞ < sup(𝐴, ℝ^, < ) ∧ sup(𝐴, ℝ^*, < ) < +∞)))
80	78, 79	syl 17	. . . 4 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (sup(𝐴, ℝ^, < ) ∈ ℝ ↔ (-∞ < sup(𝐴, ℝ^, < ) ∧ sup(𝐴, ℝ^, < ) < +∞)))
81	77, 80	mpbird 257	. . 3 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → sup(𝐴, ℝ^, < ) ∈ ℝ)
82		simpl 482	. . . . 5 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → (𝜑 ∧ sup(𝐴, ℝ^*, < ) ∈ ℝ))
83		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → ¬ 𝐵 ≤ sup(𝐴, ℝ^*, < ))
84	82	simprd 495	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → sup(𝐴, ℝ^*, < ) ∈ ℝ)
85	1	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → 𝐵 ∈ ℝ)
86	84, 85	ltnled 11293	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → (sup(𝐴, ℝ^, < ) < 𝐵 ↔ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )))
87	83, 86	mpbird 257	. . . . 5 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → sup(𝐴, ℝ^*, < ) < 𝐵)
88		simpll 767	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → 𝜑)
89	1	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^*, < ) ∈ ℝ) → 𝐵 ∈ ℝ)
90		simpr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → sup(𝐴, ℝ^, < ) ∈ ℝ)
91	89, 90	resubcld 11578	. . . . . . . . 9 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ)
92	91	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ)
93		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → sup(𝐴, ℝ^*, < ) < 𝐵)
94	90	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → sup(𝐴, ℝ^*, < ) ∈ ℝ)
95	88, 1	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → 𝐵 ∈ ℝ)
96	94, 95	posdifd 11737	. . . . . . . . 9 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (sup(𝐴, ℝ^, < ) < 𝐵 ↔ 0 < (𝐵 − sup(𝐴, ℝ^, < ))))
97	93, 96	mpbid 232	. . . . . . . 8 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → 0 < (𝐵 − sup(𝐴, ℝ^*, < )))
98	92, 97	elrpd 12983	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ⁺)
99		ovex 7400	. . . . . . . 8 ⊢ (𝐵 − sup(𝐴, ℝ^*, < )) ∈ V
100		nfcv 2898	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝐵 − sup(𝐴, ℝ^*, < ))
101		nfv 1916	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ⁺
102	16, 101	nfan 1901	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝜑 ∧ (𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ⁺)
103		nfv 1916	. . . . . . . . . 10 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦
104	102, 103	nfim 1898	. . . . . . . . 9 ⊢ Ⅎ𝑥((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦)
105		eleq1 2824	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (𝑥 ∈ ℝ⁺ ↔ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺))
106	105	anbi2d 631	. . . . . . . . . 10 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → ((𝜑 ∧ 𝑥 ∈ ℝ⁺) ↔ (𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺)))
107		oveq2 7375	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (𝐵 − 𝑥) = (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))))
108	107	breq1d 5095	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → ((𝐵 − 𝑥) < 𝑦 ↔ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦))
109	108	rexbidv 3161	. . . . . . . . . 10 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦 ↔ ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦))
110	106, 109	imbi12d 344	. . . . . . . . 9 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦) ↔ ((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦)))
111	100, 104, 110, 27	vtoclgf 3513	. . . . . . . 8 ⊢ ((𝐵 − sup(𝐴, ℝ^, < )) ∈ V → ((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦))
112	99, 111	ax-mp 5	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦)
113	88, 98, 112	syl2anc 585	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦)
114	1	recnd 11173	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ ℂ)
115	114	ad3antrrr 731	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦) → 𝐵 ∈ ℂ)
116	90	recnd 11173	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → sup(𝐴, ℝ^, < ) ∈ ℂ)
117	116	ad2antrr 727	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → sup(𝐴, ℝ^, < ) ∈ ℂ)
118	115, 117	nncand 11510	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) = sup(𝐴, ℝ^*, < ))
119	118	eqcomd 2742	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → sup(𝐴, ℝ^, < ) = (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))))
120		simpr 484	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦)
121	119, 120	eqbrtrd 5107	. . . . . . . . 9 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → sup(𝐴, ℝ^, < ) < 𝑦)
122	121	ex 412	. . . . . . . 8 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → ((𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦 → sup(𝐴, ℝ^, < ) < 𝑦))
123	122	adantr 480	. . . . . . 7 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ 𝑦 ∈ 𝐴) → ((𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦 → sup(𝐴, ℝ^, < ) < 𝑦))
124	123	reximdva 3150	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦 → ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^, < ) < 𝑦))
125	113, 124	mpd 15	. . . . 5 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
126	82, 87, 125	syl2anc 585	. . . 4 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
127	61, 37	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → sup(𝐴, ℝ^, < ) ∈ ℝ^)
128	35, 127	xrlenltd 11211	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝑦 ≤ sup(𝐴, ℝ^, < ) ↔ ¬ sup(𝐴, ℝ^, < ) < 𝑦))
129	64, 128	mpbid 232	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ sup(𝐴, ℝ^*, < ) < 𝑦)
130	129	ralrimiva 3129	. . . . . 6 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ sup(𝐴, ℝ^*, < ) < 𝑦)
131		ralnex 3063	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 ¬ sup(𝐴, ℝ^, < ) < 𝑦 ↔ ¬ ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^, < ) < 𝑦)
132	130, 131	sylib 218	. . . . 5 ⊢ (𝜑 → ¬ ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
133	132	ad2antrr 727	. . . 4 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → ¬ ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
134	126, 133	condan 818	. . 3 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → 𝐵 ≤ sup(𝐴, ℝ^, < ))
135	13, 81, 134	syl2anc 585	. 2 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → 𝐵 ≤ sup(𝐴, ℝ^, < ))
136	12, 135	pm2.61dan 813	1 ⊢ (𝜑 → 𝐵 ≤ sup(𝐴, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 Ⅎwnf 1785 ∈ wcel 2114 ∀wral 3051 ∃wrex 3061 Vcvv 3429 ⊆ wss 3889 class class class wbr 5085 (class class class)co 7367 supcsup 9353 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 +∞cpnf 11176 -∞cmnf 11177 ℝ^*cxr 11178 < clt 11179 ≤ cle 11180 − cmin 11377 ℝ⁺crp 12942

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-po 5539 df-so 5540 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-rp 12943

This theorem is referenced by: suplesup 45769

W3C validator