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 38490

Description: If a real number can be approximated from below by members of a set, then it is smaller 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 9964	. . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ^*)
3		pnfxr 9971	. . . . . . 7 ⊢ +∞ ∈ ℝ^*
4	3	a1i 11	. . . . . 6 ⊢ (𝐵 ∈ ℝ → +∞ ∈ ℝ^*)
5		ltpnf 11830	. . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 < +∞)
6	2, 4, 5	xrltled 38427	. . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≤ +∞)
7	1, 6	syl 17	. . . 4 ⊢ (𝜑 → 𝐵 ≤ +∞)
8	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^*, < ) = +∞) → 𝐵 ≤ +∞)
9		id 22	. . . . 5 ⊢ (sup(𝐴, ℝ^, < ) = +∞ → sup(𝐴, ℝ^, < ) = +∞)
10	9	eqcomd 2616	. . . 4 ⊢ (sup(𝐴, ℝ^, < ) = +∞ → +∞ = sup(𝐴, ℝ^, < ))
11	10	adantl 481	. . 3 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) = +∞) → +∞ = sup(𝐴, ℝ^, < ))
12	8, 11	breqtrd 4609	. 2 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) = +∞) → 𝐵 ≤ sup(𝐴, ℝ^, < ))
13		simpl 472	. . 3 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^*, < ) = +∞) → 𝜑)
14		1rp 11712	. . . . . . . 8 ⊢ 1 ∈ ℝ⁺
15		nfcv 2751	. . . . . . . . . 10 ⊢ Ⅎ𝑥1
16		supxrgere.xph	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝜑
17		nfv 1830	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥1 ∈ ℝ⁺
18	16, 17	nfan 1816	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝜑 ∧ 1 ∈ ℝ⁺)
19		nfv 1830	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦
20	18, 19	nfim 1813	. . . . . . . . . 10 ⊢ Ⅎ𝑥((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
21		eleq1 2676	. . . . . . . . . . . 12 ⊢ (𝑥 = 1 → (𝑥 ∈ ℝ⁺ ↔ 1 ∈ ℝ⁺))
22	21	anbi2d 736	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → ((𝜑 ∧ 𝑥 ∈ ℝ⁺) ↔ (𝜑 ∧ 1 ∈ ℝ⁺)))
23		oveq2 6557	. . . . . . . . . . . . 13 ⊢ (𝑥 = 1 → (𝐵 − 𝑥) = (𝐵 − 1))
24	23	breq1d 4593	. . . . . . . . . . . 12 ⊢ (𝑥 = 1 → ((𝐵 − 𝑥) < 𝑦 ↔ (𝐵 − 1) < 𝑦))
25	24	rexbidv 3034	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → (∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦 ↔ ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
26	22, 25	imbi12d 333	. . . . . . . . . 10 ⊢ (𝑥 = 1 → (((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦) ↔ ((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
27		supxrgere.y	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦)
28	15, 20, 26, 27	vtoclgf 3237	. . . . . . . . 9 ⊢ (1 ∈ ℝ⁺ → ((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
29	14, 28	ax-mp 5	. . . . . . . 8 ⊢ ((𝜑 ∧ 1 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
30	14, 29	mpan2 703	. . . . . . 7 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
31	30	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^*, < ) = +∞) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)
32		mnfxr 9975	. . . . . . . . . . 11 ⊢ -∞ ∈ ℝ^*
33	32	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → -∞ ∈ ℝ^*)
34		supxrgere.a	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ⊆ ℝ^*)
35	34	sselda 3568	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ^*)
36	35	3adant3 1074	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → 𝑦 ∈ ℝ^*)
37		supxrcl 12017	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ ℝ^* → sup(𝐴, ℝ^, < ) ∈ ℝ^)
38	34, 37	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → sup(𝐴, ℝ^, < ) ∈ ℝ^)
39	38	3ad2ant1 1075	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → sup(𝐴, ℝ^, < ) ∈ ℝ^)
40		peano2rem 10227	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ ℝ → (𝐵 − 1) ∈ ℝ)
41	1, 40	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐵 − 1) ∈ ℝ)
42	41	rexrd 9968	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐵 − 1) ∈ ℝ^*)
43	42	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) ∈ ℝ^*)
44	43	3ad2antl1 1216	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) ∈ ℝ^*)
45	36	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → 𝑦 ∈ ℝ^*)
46	32	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → -∞ ∈ ℝ^*)
47		simpl3 1059	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) < 𝑦)
48		simpr 476	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → ¬ -∞ < 𝑦)
49	35	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → 𝑦 ∈ ℝ^*)
50	32	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → -∞ ∈ ℝ^*)
51		xrlenlt 9982	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℝ^* ∧ -∞ ∈ ℝ^*) → (𝑦 ≤ -∞ ↔ ¬ -∞ < 𝑦))
52	49, 50, 51	syl2anc 691	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → (𝑦 ≤ -∞ ↔ ¬ -∞ < 𝑦))
53	48, 52	mpbird 246	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ ¬ -∞ < 𝑦) → 𝑦 ≤ -∞)
54	53	3adantl3 1212	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → 𝑦 ≤ -∞)
55	44, 45, 46, 47, 54	xrltletrd 11868	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → (𝐵 − 1) < -∞)
56		nltmnf 11839	. . . . . . . . . . . . . 14 ⊢ ((𝐵 − 1) ∈ ℝ^* → ¬ (𝐵 − 1) < -∞)
57	42, 56	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ¬ (𝐵 − 1) < -∞)
58	57	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ -∞ < 𝑦) → ¬ (𝐵 − 1) < -∞)
59	58	3ad2antl1 1216	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) ∧ ¬ -∞ < 𝑦) → ¬ (𝐵 − 1) < -∞)
60	55, 59	condan 831	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦)
61	34	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐴 ⊆ ℝ^*)
62		simpr 476	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
63		supxrub 12026	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝑦 ∈ 𝐴) → 𝑦 ≤ sup(𝐴, ℝ^*, < ))
64	61, 62, 63	syl2anc 691	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝑦 ≤ sup(𝐴, ℝ^*, < ))
65	64	3adant3 1074	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → 𝑦 ≤ sup(𝐴, ℝ^*, < ))
66	33, 36, 39, 60, 65	xrltletrd 11868	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴 ∧ (𝐵 − 1) < 𝑦) → -∞ < sup(𝐴, ℝ^*, < ))
67	66	3exp 1256	. . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ 𝐴 → ((𝐵 − 1) < 𝑦 → -∞ < sup(𝐴, ℝ^*, < ))))
68	67	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (𝑦 ∈ 𝐴 → ((𝐵 − 1) < 𝑦 → -∞ < sup(𝐴, ℝ^, < ))))
69	68	rexlimdv 3012	. . . . . 6 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦 → -∞ < sup(𝐴, ℝ^, < )))
70	31, 69	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → -∞ < sup(𝐴, ℝ^, < ))
71		simpr 476	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → ¬ sup(𝐴, ℝ^, < ) = +∞)
72		nltpnft 11871	. . . . . . . . 9 ⊢ (sup(𝐴, ℝ^, < ) ∈ ℝ^ → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^, < ) < +∞))
73	38, 72	syl 17	. . . . . . . 8 ⊢ (𝜑 → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^, < ) < +∞))
74	73	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^*, < ) < +∞))
75	71, 74	mtbid 313	. . . . . 6 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → ¬ ¬ sup(𝐴, ℝ^, < ) < +∞)
76	75	notnotrd 127	. . . . 5 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → sup(𝐴, ℝ^, < ) < +∞)
77	70, 76	jca 553	. . . 4 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (-∞ < sup(𝐴, ℝ^, < ) ∧ sup(𝐴, ℝ^*, < ) < +∞))
78	38	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → sup(𝐴, ℝ^, < ) ∈ ℝ^*)
79		xrrebnd 11873	. . . . 5 ⊢ (sup(𝐴, ℝ^, < ) ∈ ℝ^ → (sup(𝐴, ℝ^, < ) ∈ ℝ ↔ (-∞ < sup(𝐴, ℝ^, < ) ∧ sup(𝐴, ℝ^*, < ) < +∞)))
80	78, 79	syl 17	. . . 4 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → (sup(𝐴, ℝ^, < ) ∈ ℝ ↔ (-∞ < sup(𝐴, ℝ^, < ) ∧ sup(𝐴, ℝ^, < ) < +∞)))
81	77, 80	mpbird 246	. . 3 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → sup(𝐴, ℝ^, < ) ∈ ℝ)
82		simpl 472	. . . . 5 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → (𝜑 ∧ sup(𝐴, ℝ^*, < ) ∈ ℝ))
83		simpr 476	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → ¬ 𝐵 ≤ sup(𝐴, ℝ^*, < ))
84	82	simprd 478	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → sup(𝐴, ℝ^*, < ) ∈ ℝ)
85	1	ad2antrr 758	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → 𝐵 ∈ ℝ)
86	84, 85	ltnled 10063	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → (sup(𝐴, ℝ^, < ) < 𝐵 ↔ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )))
87	83, 86	mpbird 246	. . . . 5 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → sup(𝐴, ℝ^*, < ) < 𝐵)
88		simpll 786	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → 𝜑)
89	1	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^*, < ) ∈ ℝ) → 𝐵 ∈ ℝ)
90		simpr 476	. . . . . . . . . 10 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → sup(𝐴, ℝ^, < ) ∈ ℝ)
91	89, 90	resubcld 10337	. . . . . . . . 9 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ)
92	91	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ)
93		simpr 476	. . . . . . . . 9 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → sup(𝐴, ℝ^*, < ) < 𝐵)
94	90	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → sup(𝐴, ℝ^*, < ) ∈ ℝ)
95	88, 1	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → 𝐵 ∈ ℝ)
96	94, 95	posdifd 10493	. . . . . . . . 9 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (sup(𝐴, ℝ^, < ) < 𝐵 ↔ 0 < (𝐵 − sup(𝐴, ℝ^, < ))))
97	93, 96	mpbid 221	. . . . . . . 8 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → 0 < (𝐵 − sup(𝐴, ℝ^*, < )))
98	92, 97	elrpd 11745	. . . . . . 7 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ⁺)
99		ovex 6577	. . . . . . . 8 ⊢ (𝐵 − sup(𝐴, ℝ^*, < )) ∈ V
100		nfcv 2751	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝐵 − sup(𝐴, ℝ^*, < ))
101		nfv 1830	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ⁺
102	16, 101	nfan 1816	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝜑 ∧ (𝐵 − sup(𝐴, ℝ^*, < )) ∈ ℝ⁺)
103		nfv 1830	. . . . . . . . . 10 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦
104	102, 103	nfim 1813	. . . . . . . . 9 ⊢ Ⅎ𝑥((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦)
105		eleq1 2676	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (𝑥 ∈ ℝ⁺ ↔ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺))
106	105	anbi2d 736	. . . . . . . . . 10 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → ((𝜑 ∧ 𝑥 ∈ ℝ⁺) ↔ (𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺)))
107		oveq2 6557	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (𝐵 − 𝑥) = (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))))
108	107	breq1d 4593	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → ((𝐵 − 𝑥) < 𝑦 ↔ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦))
109	108	rexbidv 3034	. . . . . . . . . 10 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦 ↔ ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦))
110	106, 109	imbi12d 333	. . . . . . . . 9 ⊢ (𝑥 = (𝐵 − sup(𝐴, ℝ^, < )) → (((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − 𝑥) < 𝑦) ↔ ((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦)))
111	100, 104, 110, 27	vtoclgf 3237	. . . . . . . 8 ⊢ ((𝐵 − sup(𝐴, ℝ^, < )) ∈ V → ((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦))
112	99, 111	ax-mp 5	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐵 − sup(𝐴, ℝ^, < )) ∈ ℝ⁺) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦)
113	88, 98, 112	syl2anc 691	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → ∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦)
114	1	recnd 9947	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ ℂ)
115	114	ad3antrrr 762	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))) < 𝑦) → 𝐵 ∈ ℂ)
116	90	recnd 9947	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → sup(𝐴, ℝ^, < ) ∈ ℂ)
117	116	ad2antrr 758	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → sup(𝐴, ℝ^, < ) ∈ ℂ)
118	115, 117	nncand 10276	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) = sup(𝐴, ℝ^*, < ))
119	118	eqcomd 2616	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → sup(𝐴, ℝ^, < ) = (𝐵 − (𝐵 − sup(𝐴, ℝ^*, < ))))
120		simpr 476	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦)
121	119, 120	eqbrtrd 4605	. . . . . . . . 9 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦) → sup(𝐴, ℝ^, < ) < 𝑦)
122	121	ex 449	. . . . . . . 8 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → ((𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦 → sup(𝐴, ℝ^, < ) < 𝑦))
123	122	adantr 480	. . . . . . 7 ⊢ ((((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) ∧ 𝑦 ∈ 𝐴) → ((𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦 → sup(𝐴, ℝ^, < ) < 𝑦))
124	123	reximdva 3000	. . . . . 6 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → (∃𝑦 ∈ 𝐴 (𝐵 − (𝐵 − sup(𝐴, ℝ^, < ))) < 𝑦 → ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^, < ) < 𝑦))
125	113, 124	mpd 15	. . . . 5 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ sup(𝐴, ℝ^, < ) < 𝐵) → ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
126	82, 87, 125	syl2anc 691	. . . 4 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
127	61, 37	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → sup(𝐴, ℝ^, < ) ∈ ℝ^)
128	35, 127	xrlenltd 9983	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝑦 ≤ sup(𝐴, ℝ^, < ) ↔ ¬ sup(𝐴, ℝ^, < ) < 𝑦))
129	64, 128	mpbid 221	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ sup(𝐴, ℝ^*, < ) < 𝑦)
130	129	ralrimiva 2949	. . . . . 6 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ sup(𝐴, ℝ^*, < ) < 𝑦)
131		ralnex 2975	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐴 ¬ sup(𝐴, ℝ^, < ) < 𝑦 ↔ ¬ ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^, < ) < 𝑦)
132	130, 131	sylib 207	. . . . 5 ⊢ (𝜑 → ¬ ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
133	132	ad2antrr 758	. . . 4 ⊢ (((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) ∧ ¬ 𝐵 ≤ sup(𝐴, ℝ^, < )) → ¬ ∃𝑦 ∈ 𝐴 sup(𝐴, ℝ^*, < ) < 𝑦)
134	126, 133	condan 831	. . 3 ⊢ ((𝜑 ∧ sup(𝐴, ℝ^, < ) ∈ ℝ) → 𝐵 ≤ sup(𝐴, ℝ^, < ))
135	13, 81, 134	syl2anc 691	. 2 ⊢ ((𝜑 ∧ ¬ sup(𝐴, ℝ^, < ) = +∞) → 𝐵 ≤ sup(𝐴, ℝ^, < ))
136	12, 135	pm2.61dan 828	1 ⊢ (𝜑 → 𝐵 ≤ sup(𝐴, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 Ⅎwnf 1699 ∈ wcel 1977 ∀wral 2896 ∃wrex 2897 Vcvv 3173 ⊆ wss 3540 class class class wbr 4583 (class class class)co 6549 supcsup 8229 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 +∞cpnf 9950 -∞cmnf 9951 ℝ^*cxr 9952 < clt 9953 ≤ cle 9954 − cmin 10145 ℝ⁺crp 11708

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-rp 11709

This theorem is referenced by: suplesup 38496

W3C validator