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 12351

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 4814	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑥 < 𝐵 ↔ 𝑧 < 𝐵))
2		breq1 4814	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 < 𝑦 ↔ 𝑧 < 𝑦))
3	2	rexbidv 3199	. . . . . 6 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ 𝐴 𝑥 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 𝑧 < 𝑦))
4	1, 3	imbi12d 335	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)))
5	4	cbvralv 3319	. . . 4 ⊢ (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦))
6		elxr 12157	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ^* ↔ (𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞))
7		pm2.27 42	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℝ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
8	7	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 ∈ ℝ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
9		pnfnlt 12169	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℝ^* → ¬ +∞ < 𝐵)
10		breq1 4814	. . . . . . . . . . . . . 14 ⊢ (𝑥 = +∞ → (𝑥 < 𝐵 ↔ +∞ < 𝐵))
11	10	notbid 309	. . . . . . . . . . . . 13 ⊢ (𝑥 = +∞ → (¬ 𝑥 < 𝐵 ↔ ¬ +∞ < 𝐵))
12	9, 11	syl5ibr 237	. . . . . . . . . . . 12 ⊢ (𝑥 = +∞ → (𝐵 ∈ ℝ^* → ¬ 𝑥 < 𝐵))
13		pm2.21 121	. . . . . . . . . . . 12 ⊢ (¬ 𝑥 < 𝐵 → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))
14	12, 13	syl6com 37	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ℝ^* → (𝑥 = +∞ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
15	14	ad2antlr 718	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = +∞ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
16	15	a1dd 50	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = +∞ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
17		elxr 12157	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
18		peano2rem 10607	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ ℝ → (𝐵 − 1) ∈ ℝ)
19		breq1 4814	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝐵 − 1) → (𝑧 < 𝐵 ↔ (𝐵 − 1) < 𝐵))
20		breq1 4814	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑧 = (𝐵 − 1) → (𝑧 < 𝑦 ↔ (𝐵 − 1) < 𝑦))
21	20	rexbidv 3199	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝐵 − 1) → (∃𝑦 ∈ 𝐴 𝑧 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
22	19, 21	imbi12d 335	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝐵 − 1) → ((𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) ↔ ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
23	22	rspcv 3458	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐵 − 1) ∈ ℝ → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
24	18, 23	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℝ → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
25	24	adantl 473	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦)))
26		ltm1 11122	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ ℝ → (𝐵 − 1) < 𝐵)
27		id 22	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦) → ((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
28	26, 27	syl5com 31	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ ℝ → (((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
29	28	adantl 473	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (((𝐵 − 1) < 𝐵 → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦) → ∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦))
30	18	ad2antlr 718	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → (𝐵 − 1) ∈ ℝ)
31		mnflt 12164	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 − 1) ∈ ℝ → -∞ < (𝐵 − 1))
32	30, 31	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → -∞ < (𝐵 − 1))
33		rexr 10343	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐵 − 1) ∈ ℝ → (𝐵 − 1) ∈ ℝ^*)
34	30, 33	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → (𝐵 − 1) ∈ ℝ^*)
35		ssel2 3758	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ^*)
36	35	adantlr 706	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ^*)
37		mnfxr 10355	. . . . . . . . . . . . . . . . . . . 20 ⊢ -∞ ∈ ℝ^*
38		xrlttr 12180	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((-∞ ∈ ℝ^* ∧ (𝐵 − 1) ∈ ℝ^* ∧ 𝑦 ∈ ℝ^*) → ((-∞ < (𝐵 − 1) ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦))
39	37, 38	mp3an1 1572	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐵 − 1) ∈ ℝ^* ∧ 𝑦 ∈ ℝ^*) → ((-∞ < (𝐵 − 1) ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦))
40	34, 36, 39	syl2anc 579	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → ((-∞ < (𝐵 − 1) ∧ (𝐵 − 1) < 𝑦) → -∞ < 𝑦))
41	32, 40	mpand 686	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) ∧ 𝑦 ∈ 𝐴) → ((𝐵 − 1) < 𝑦 → -∞ < 𝑦))
42	41	reximdva 3163	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∃𝑦 ∈ 𝐴 (𝐵 − 1) < 𝑦 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
43	25, 29, 42	3syld 60	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
44	43	a1dd 50	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
45		1re 10297	. . . . . . . . . . . . . . . . 17 ⊢ 1 ∈ ℝ
46		breq1 4814	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = 1 → (𝑧 < 𝐵 ↔ 1 < 𝐵))
47		breq1 4814	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = 1 → (𝑧 < 𝑦 ↔ 1 < 𝑦))
48	47	rexbidv 3199	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = 1 → (∃𝑦 ∈ 𝐴 𝑧 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 1 < 𝑦))
49	46, 48	imbi12d 335	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = 1 → ((𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) ↔ (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦)))
50	49	rspcv 3458	. . . . . . . . . . . . . . . . 17 ⊢ (1 ∈ ℝ → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦)))
51	45, 50	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦))
52		ltpnf 12161	. . . . . . . . . . . . . . . . . . . 20 ⊢ (1 ∈ ℝ → 1 < +∞)
53	45, 52	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ 1 < +∞
54		breq2 4815	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐵 = +∞ → (1 < 𝐵 ↔ 1 < +∞))
55	53, 54	mpbiri 249	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 = +∞ → 1 < 𝐵)
56		id 22	. . . . . . . . . . . . . . . . . 18 ⊢ ((1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦) → (1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦))
57	55, 56	syl5com 31	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = +∞ → ((1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦) → ∃𝑦 ∈ 𝐴 1 < 𝑦))
58		mnflt 12164	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (1 ∈ ℝ → -∞ < 1)
59	45, 58	ax-mp 5	. . . . . . . . . . . . . . . . . . . 20 ⊢ -∞ < 1
60		rexr 10343	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (1 ∈ ℝ → 1 ∈ ℝ^*)
61	45, 60	ax-mp 5	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 1 ∈ ℝ^*
62		xrlttr 12180	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((-∞ ∈ ℝ^* ∧ 1 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^*) → ((-∞ < 1 ∧ 1 < 𝑦) → -∞ < 𝑦))
63	37, 61, 62	mp3an12 1575	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ ℝ^* → ((-∞ < 1 ∧ 1 < 𝑦) → -∞ < 𝑦))
64	59, 63	mpani 687	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ ℝ^* → (1 < 𝑦 → -∞ < 𝑦))
65	35, 64	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝑦 ∈ 𝐴) → (1 < 𝑦 → -∞ < 𝑦))
66	65	reximdva 3163	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ⊆ ℝ^* → (∃𝑦 ∈ 𝐴 1 < 𝑦 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
67	57, 66	sylan9r 504	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = +∞) → ((1 < 𝐵 → ∃𝑦 ∈ 𝐴 1 < 𝑦) → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
68	51, 67	syl5 34	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = +∞) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
69	68	a1dd 50	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = +∞) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
70		xrltnr 12160	. . . . . . . . . . . . . . . . . . 19 ⊢ (-∞ ∈ ℝ^* → ¬ -∞ < -∞)
71	37, 70	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ ¬ -∞ < -∞
72		breq2 4815	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 = -∞ → (-∞ < 𝐵 ↔ -∞ < -∞))
73	71, 72	mtbiri 318	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = -∞ → ¬ -∞ < 𝐵)
74	73	adantl 473	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = -∞) → ¬ -∞ < 𝐵)
75	74	pm2.21d 119	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = -∞) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
76	75	a1d 25	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 = -∞) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
77	44, 69, 76	3jaodan 1555	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ ℝ^* ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞)) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
78	17, 77	sylan2b 587	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
79	78	imp 395	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
80		breq1 4814	. . . . . . . . . . . 12 ⊢ (𝑥 = -∞ → (𝑥 < 𝐵 ↔ -∞ < 𝐵))
81		breq1 4814	. . . . . . . . . . . . 13 ⊢ (𝑥 = -∞ → (𝑥 < 𝑦 ↔ -∞ < 𝑦))
82	81	rexbidv 3199	. . . . . . . . . . . 12 ⊢ (𝑥 = -∞ → (∃𝑦 ∈ 𝐴 𝑥 < 𝑦 ↔ ∃𝑦 ∈ 𝐴 -∞ < 𝑦))
83	80, 82	imbi12d 335	. . . . . . . . . . 11 ⊢ (𝑥 = -∞ → ((𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ (-∞ < 𝐵 → ∃𝑦 ∈ 𝐴 -∞ < 𝑦)))
84	79, 83	syl5ibrcom 238	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = -∞ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
85	84	a1dd 50	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 = -∞ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
86	8, 16, 85	3jaod 1553	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^*) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → ((𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞) → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
87	6, 86	syl5bi 233	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (𝑥 ∈ ℝ^ → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
88	87	com23 86	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → ((𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 ∈ ℝ^ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
89	88	ralimdv2 3108	. . . . 5 ⊢ (((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ ∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦)) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
90	89	ex 401	. . . 4 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑧 ∈ ℝ (𝑧 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑧 < 𝑦) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
91	5, 90	syl5bi 233	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))))
92	91	pm2.43d 53	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
93		rexr 10343	. . . 4 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
94	93	imim1i 63	. . 3 ⊢ ((𝑥 ∈ ℝ^* → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)) → (𝑥 ∈ ℝ → (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))
95	94	ralimi2 3096	. 2 ⊢ (∀𝑥 ∈ ℝ^* (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) → ∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦))
96	92, 95	impbid1 216	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ∈ ℝ^) → (∀𝑥 ∈ ℝ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦) ↔ ∀𝑥 ∈ ℝ^ (𝑥 < 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 < 𝑦)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 197 ∧ wa 384 ∨ w3o 1106 = wceq 1652 ∈ wcel 2155 ∀wral 3055 ∃wrex 3056 ⊆ wss 3734 class class class wbr 4811 (class class class)co 6846 ℝcr 10192 1c1 10194 +∞cpnf 10329 -∞cmnf 10330 ℝ^*cxr 10331 < clt 10332 − cmin 10525

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1890 ax-4 1904 ax-5 2005 ax-6 2070 ax-7 2105 ax-8 2157 ax-9 2164 ax-10 2183 ax-11 2198 ax-12 2211 ax-13 2352 ax-ext 2743 ax-sep 4943 ax-nul 4951 ax-pow 5003 ax-pr 5064 ax-un 7151 ax-cnex 10249 ax-resscn 10250 ax-1cn 10251 ax-icn 10252 ax-addcl 10253 ax-addrcl 10254 ax-mulcl 10255 ax-mulrcl 10256 ax-mulcom 10257 ax-addass 10258 ax-mulass 10259 ax-distr 10260 ax-i2m1 10261 ax-1ne0 10262 ax-1rid 10263 ax-rnegex 10264 ax-rrecex 10265 ax-cnre 10266 ax-pre-lttri 10267 ax-pre-lttrn 10268 ax-pre-ltadd 10269 ax-pre-mulgt0 10270

This theorem depends on definitions: df-bi 198 df-an 385 df-or 874 df-3or 1108 df-3an 1109 df-tru 1656 df-ex 1875 df-nf 1879 df-sb 2063 df-mo 2565 df-eu 2582 df-clab 2752 df-cleq 2758 df-clel 2761 df-nfc 2896 df-ne 2938 df-nel 3041 df-ral 3060 df-rex 3061 df-reu 3062 df-rab 3064 df-v 3352 df-sbc 3599 df-csb 3694 df-dif 3737 df-un 3739 df-in 3741 df-ss 3748 df-nul 4082 df-if 4246 df-pw 4319 df-sn 4337 df-pr 4339 df-op 4343 df-uni 4597 df-br 4812 df-opab 4874 df-mpt 4891 df-id 5187 df-po 5200 df-so 5201 df-xp 5285 df-rel 5286 df-cnv 5287 df-co 5288 df-dm 5289 df-rn 5290 df-res 5291 df-ima 5292 df-iota 6033 df-fun 6072 df-fn 6073 df-f 6074 df-f1 6075 df-fo 6076 df-f1o 6077 df-fv 6078 df-riota 6807 df-ov 6849 df-oprab 6850 df-mpt2 6851 df-er 7951 df-en 8165 df-dom 8166 df-sdom 8167 df-pnf 10334 df-mnf 10335 df-xr 10336 df-ltxr 10337 df-le 10338 df-sub 10527 df-neg 10528

This theorem is referenced by: supxr 12352

W3C validator