xrub - Metamath Proof Explorer

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

Theorem xrub 12014

Description: By quantifying only over reals, we can specify any extended real upper bound for any set of extended reals. (Contributed by NM, 9-Apr-2006.)

**Assertion**
Ref	Expression
xrub	⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))

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

Proof of Theorem xrub Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 4586	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑥 < 𝐵 ↔ 𝑧 < 𝐵))
2		breq1 4586	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 < 𝑦 ↔ 𝑧 < 𝑦))
3	2	rexbidv 3034	. . . . . 6 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ 𝐴 𝑥 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 𝑧 < 𝑦))
4	1, 3	imbi12d 333	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)))
5	4	cbvralv 3147	. . . 4 ⊢ (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦))
6		elxr 11826	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ^* ↔ (𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞))
7		pm2.27 41	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
8	7	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 ∈ ℝ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
9		pnfnlt 11838	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℝ^* → ¬ +∞ < 𝐵)
10		breq1 4586	. . . . . . . . . . . . . 14 ⊢ (𝑥 = +∞ → (𝑥 < 𝐵 ↔ +∞ < 𝐵))
11	10	notbid 307	. . . . . . . . . . . . 13 ⊢ (𝑥 = +∞ → (¬ 𝑥 < 𝐵 ↔ ¬ +∞ < 𝐵))
12	9, 11	syl5ibr 235	. . . . . . . . . . . 12 ⊢ (𝑥 = +∞ → (𝐵 ∈ ℝ^* → ¬ 𝑥 < 𝐵))
13		pm2.21 119	. . . . . . . . . . . 12 ⊢ (¬ 𝑥 < 𝐵 → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))
14	12, 13	syl6com 36	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ℝ^* → (𝑥 = +∞ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
15	14	ad2antlr 759	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = +∞ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
16	15	a1dd 48	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = +∞ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
17		elxr 11826	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
18		peano2rem 10227	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ ℝ → (𝐵 − 1) ∈ ℝ)
19		breq1 4586	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝐵 − 1) → (𝑧 < 𝐵 ↔ (𝐵 − 1) < 𝐵))
20		breq1 4586	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑧 = (𝐵 − 1) → (𝑧 < 𝑦 ↔ (𝐵 − 1) < 𝑦))
21	20	rexbidv 3034	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝐵 − 1) → (∃𝑦 ∈ 𝐴 𝑧 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
22	19, 21	imbi12d 333	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝐵 − 1) → ((𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) ↔ ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
23	22	rspcv 3278	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐵 − 1) ∈ ℝ → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
24	18, 23	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℝ → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
25	24	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
26		ltm1 10742	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ ℝ → (𝐵 − 1) < 𝐵)
27		id 22	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
28	26, 27	syl5com 31	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℝ → (((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
29	28	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
30	18	ad2antlr 759	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → (𝐵 − 1) ∈ ℝ)
31		mnflt 11833	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 − 1) ∈ ℝ → -∞ < (𝐵 − 1))
32	30, 31	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → -∞ < (𝐵 − 1))
33		rexr 9964	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐵 − 1) ∈ ℝ → (𝐵 − 1) ∈ ℝ^*)
34	30, 33	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → (𝐵 − 1) ∈ ℝ^*)
35		ssel2 3563	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ^*)
36	35	adantlr 747	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ^*)
37		mnfxr 9975	. . . . . . . . . . . . . . . . . . . 20 ⊢ -∞ ∈ ℝ^*
38		xrlttr 11849	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((-∞ ∈ ℝ^* ∧ (𝐵 − 1) ∈ ℝ^* ∧ 𝑦 ∈ ℝ^*) → ((-∞ < (𝐵 − 1) ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦))
39	37, 38	mp3an1 1403	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐵 − 1) ∈ ℝ^* ∧ 𝑦 ∈ ℝ^*) → ((-∞ < (𝐵 − 1) ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦))
40	34, 36, 39	syl2anc 691	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → ((-∞ < (𝐵 − 1) ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦))
41	32, 40	mpand 707	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → ((𝐵 − 1) < 𝑦 → -∞ < 𝑦))
42	41	reximdva 3000	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
43	25, 29, 42	3syld 58	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
44	43	a1dd 48	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
45		1re 9918	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℝ
46		breq1 4586	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = 1 → (𝑧 < 𝐵 ↔ 1 < 𝐵))
47		breq1 4586	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = 1 → (𝑧 < 𝑦 ↔ 1 < 𝑦))
48	47	rexbidv 3034	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = 1 → (∃𝑦 ∈ 𝐴 𝑧 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 1 < 𝑦))
49	46, 48	imbi12d 333	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = 1 → ((𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) ↔ (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦)))
50	49	rspcv 3278	. . . . . . . . . . . . . . . . 17 ⊢ (1 ∈ ℝ → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦)))
51	45, 50	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦))
52		ltpnf 11830	. . . . . . . . . . . . . . . . . . . 20 ⊢ (1 ∈ ℝ → 1 < +∞)
53	45, 52	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ 1 < +∞
54		breq2 4587	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐵 = +∞ → (1 < 𝐵 ↔ 1 < +∞))
55	53, 54	mpbiri 247	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 = +∞ → 1 < 𝐵)
56		id 22	. . . . . . . . . . . . . . . . . 18 ⊢ ((1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦) → (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦))
57	55, 56	syl5com 31	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = +∞ → ((1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦) → ∃𝑦 ∈ 𝐴 1 < 𝑦))
58		mnflt 11833	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (1 ∈ ℝ → -∞ < 1)
59	45, 58	ax-mp 5	. . . . . . . . . . . . . . . . . . . 20 ⊢ -∞ < 1
60		rexr 9964	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (1 ∈ ℝ → 1 ∈ ℝ^*)
61	45, 60	ax-mp 5	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 1 ∈ ℝ^*
62		xrlttr 11849	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((-∞ ∈ ℝ^* ∧ 1 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^*) → ((-∞ < 1 ∧ 1 < 𝑦) → -∞ < 𝑦))
63	37, 61, 62	mp3an12 1406	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ ℝ^* → ((-∞ < 1 ∧ 1 < 𝑦) → -∞ < 𝑦))
64	59, 63	mpani 708	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ ℝ^* → (1 < 𝑦 → -∞ < 𝑦))
65	35, 64	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝑦 ∈ 𝐴) → (1 < 𝑦 → -∞ < 𝑦))
66	65	reximdva 3000	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ⊆ ℝ^* → (∃𝑦 ∈ 𝐴 1 < 𝑦 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
67	57, 66	sylan9r 688	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = +∞) → ((1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦) → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
68	51, 67	syl5 33	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = +∞) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
69	68	a1dd 48	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = +∞) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
70		xrltnr 11829	. . . . . . . . . . . . . . . . . . 19 ⊢ (-∞ ∈ ℝ^* → ¬ -∞ < -∞)
71	37, 70	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ ¬ -∞ < -∞
72		breq2 4587	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 = -∞ → (-∞ < 𝐵 ↔ -∞ < -∞))
73	71, 72	mtbiri 316	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = -∞ → ¬ -∞ < 𝐵)
74	73	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = -∞) → ¬ -∞ < 𝐵)
75	74	pm2.21d 117	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = -∞) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
76	75	a1d 25	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = -∞) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
77	44, 69, 76	3jaodan 1386	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ ℝ^* ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
78	17, 77	sylan2b 491	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
79	78	imp 444	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
80		breq1 4586	. . . . . . . . . . . 12 ⊢ (𝑥 = -∞ → (𝑥 < 𝐵 ↔ -∞ < 𝐵))
81		breq1 4586	. . . . . . . . . . . . 13 ⊢ (𝑥 = -∞ → (𝑥 < 𝑦 ↔ -∞ < 𝑦))
82	81	rexbidv 3034	. . . . . . . . . . . 12 ⊢ (𝑥 = -∞ → (∃𝑦 ∈ 𝐴 𝑥 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
83	80, 82	imbi12d 333	. . . . . . . . . . 11 ⊢ (𝑥 = -∞ → ((𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
84	79, 83	syl5ibrcom 236	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = -∞ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
85	84	a1dd 48	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = -∞ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
86	8, 16, 85	3jaod 1384	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → ((𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞) → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
87	6, 86	syl5bi 231	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 ∈ ℝ^ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
88	87	com23 84	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 ∈ ℝ^ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
89	88	ralimdv2 2944	. . . . 5 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
90	89	ex 449	. . . 4 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
91	5, 90	syl5bi 231	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
92	91	pm2.43d 51	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
93		rexr 9964	. . . 4 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
94	93	imim1i 61	. . 3 ⊢ ((𝑥 ∈ ℝ^* → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
95	94	ralimi2 2933	. 2 ⊢ (∀𝑥 ∈ ℝ^* (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))
96	92, 95	impbid1 214	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∨ w3o 1030 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ∃wrex 2897 ⊆ wss 3540 class class class wbr 4583 (class class class)co 6549 ℝcr 9814 1c1 9816 +∞cpnf 9950 -∞cmnf 9951 ℝ^*cxr 9952 < clt 9953 − cmin 10145

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

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-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-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148

This theorem is referenced by: supxr 12015

W3C validator