Theorem rexico 15277

Description: Restrict the base of an upper real quantifier to an upper real set. (Contributed by Mario Carneiro, 12-May-2016.)

Assertion

Ref	Expression
rexico	⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ↔ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))

Distinct variable groups:   𝑗,𝑘,𝐴   𝐵,𝑗,𝑘   𝜑,𝑗

Allowed substitution hint:   𝜑(𝑘)

Proof of Theorem rexico

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 484	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
2		pnfxr 11186	. . . 4 ⊢ +∞ ∈ ℝ*
3		icossre 13344	. . . 4 ⊢ ((𝐵 ∈ ℝ ∧ +∞ ∈ ℝ*) → (𝐵[,)+∞) ⊆ ℝ)
4	1, 2, 3	sylancl 586	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵[,)+∞) ⊆ ℝ)
5		ssrexv 4003	. . 3 ⊢ ((𝐵[,)+∞) ⊆ ℝ → (∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
6	4, 5	syl 17	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
7		simpr 484	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝑗 ∈ ℝ)
8		simplr 768	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝐵 ∈ ℝ)
9	7, 8	ifcld 4526	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ ℝ)
10		max1 13100	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝑗 ∈ ℝ) → 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))
11	10	adantll 714	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))
12		elicopnf 13361	. . . . . . 7 ⊢ (𝐵 ∈ ℝ → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞) ↔ (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ ℝ ∧ 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))))
13	12	ad2antlr 727	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞) ↔ (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ ℝ ∧ 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))))
14	9, 11, 13	mpbir2and 713	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞))
15		simpllr 775	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ)
16		simplr 768	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → 𝑗 ∈ ℝ)
17		simpll 766	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝐴 ⊆ ℝ)
18	17	sselda 3933	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ ℝ)
19		maxle 13106	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 ↔ (𝐵 ≤ 𝑘 ∧ 𝑗 ≤ 𝑘)))
20	15, 16, 18, 19	syl3anc 1373	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 ↔ (𝐵 ≤ 𝑘 ∧ 𝑗 ≤ 𝑘)))
21		simpr 484	. . . . . . . 8 ⊢ ((𝐵 ≤ 𝑘 ∧ 𝑗 ≤ 𝑘) → 𝑗 ≤ 𝑘)
22	20, 21	biimtrdi 253	. . . . . . 7 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝑗 ≤ 𝑘))
23	22	imim1d 82	. . . . . 6 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → ((𝑗 ≤ 𝑘 → 𝜑) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝜑)))
24	23	ralimdva 3148	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∀𝑘 ∈ 𝐴 (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝜑)))
25		breq1 5101	. . . . . 6 ⊢ (𝑛 = if(𝐵 ≤ 𝑗, 𝑗, 𝐵) → (𝑛 ≤ 𝑘 ↔ if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘))
26	25	rspceaimv 3582	. . . . 5 ⊢ ((if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞) ∧ ∀𝑘 ∈ 𝐴 (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝜑)) → ∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑))
27	14, 24, 26	syl6an 684	. . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑)))
28	27	rexlimdva 3137	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑)))
29		breq1 5101	. . . . . 6 ⊢ (𝑛 = 𝑗 → (𝑛 ≤ 𝑘 ↔ 𝑗 ≤ 𝑘))
30	29	imbi1d 341	. . . . 5 ⊢ (𝑛 = 𝑗 → ((𝑛 ≤ 𝑘 → 𝜑) ↔ (𝑗 ≤ 𝑘 → 𝜑)))
31	30	ralbidv 3159	. . . 4 ⊢ (𝑛 = 𝑗 → (∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑) ↔ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
32	31	cbvrexvw 3215	. . 3 ⊢ (∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑) ↔ ∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑))
33	28, 32	imbitrdi 251	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
34	6, 33	impbid 212	1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ↔ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2113  ∀wral 3051  ∃wrex 3060   ⊆ wss 3901  ifcif 4479   class class class wbr 5098  (class class class)co 7358  ℝcr 11025  +∞cpnf 11163  ℝ^*cxr 11165   ≤ cle 11167  [,)cico 13263

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11082  ax-resscn 11083  ax-pre-lttri 11100  ax-pre-lttrn 11101

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  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 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-po 5532  df-so 5533  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-er 8635  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-ico 13267

This theorem is referenced by:  rlimi2  15437  ello1mpt2  15445  dvfsumrlim  25994