Theorem rexico 14715

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 487	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ)
2		pnfxr 10697	. . . 4 ⊢ +∞ ∈ ℝ*
3		icossre 12820	. . . 4 ⊢ ((𝐵 ∈ ℝ ∧ +∞ ∈ ℝ*) → (𝐵[,)+∞) ⊆ ℝ)
4	1, 2, 3	sylancl 588	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵[,)+∞) ⊆ ℝ)
5		ssrexv 4036	. . 3 ⊢ ((𝐵[,)+∞) ⊆ ℝ → (∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
6	4, 5	syl 17	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
7		simpr 487	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝑗 ∈ ℝ)
8		simplr 767	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝐵 ∈ ℝ)
9	7, 8	ifcld 4514	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ ℝ)
10		max1 12581	. . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝑗 ∈ ℝ) → 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))
11	10	adantll 712	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))
12		elicopnf 12836	. . . . . . 7 ⊢ (𝐵 ∈ ℝ → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞) ↔ (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ ℝ ∧ 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))))
13	12	ad2antlr 725	. . . . . 6 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞) ↔ (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ ℝ ∧ 𝐵 ≤ if(𝐵 ≤ 𝑗, 𝑗, 𝐵))))
14	9, 11, 13	mpbir2and 711	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞))
15		simpllr 774	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ)
16		simplr 767	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → 𝑗 ∈ ℝ)
17		simpll 765	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → 𝐴 ⊆ ℝ)
18	17	sselda 3969	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ ℝ)
19		maxle 12587	. . . . . . . . 9 ⊢ ((𝐵 ∈ ℝ ∧ 𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 ↔ (𝐵 ≤ 𝑘 ∧ 𝑗 ≤ 𝑘)))
20	15, 16, 18, 19	syl3anc 1367	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 ↔ (𝐵 ≤ 𝑘 ∧ 𝑗 ≤ 𝑘)))
21		simpr 487	. . . . . . . 8 ⊢ ((𝐵 ≤ 𝑘 ∧ 𝑗 ≤ 𝑘) → 𝑗 ≤ 𝑘)
22	20, 21	syl6bi 255	. . . . . . 7 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝑗 ≤ 𝑘))
23	22	imim1d 82	. . . . . 6 ⊢ ((((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) ∧ 𝑘 ∈ 𝐴) → ((𝑗 ≤ 𝑘 → 𝜑) → (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝜑)))
24	23	ralimdva 3179	. . . . 5 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∀𝑘 ∈ 𝐴 (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝜑)))
25		breq1 5071	. . . . . 6 ⊢ (𝑛 = if(𝐵 ≤ 𝑗, 𝑗, 𝐵) → (𝑛 ≤ 𝑘 ↔ if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘))
26	25	rspceaimv 3630	. . . . 5 ⊢ ((if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ∈ (𝐵[,)+∞) ∧ ∀𝑘 ∈ 𝐴 (if(𝐵 ≤ 𝑗, 𝑗, 𝐵) ≤ 𝑘 → 𝜑)) → ∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑))
27	14, 24, 26	syl6an 682	. . . 4 ⊢ (((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝑗 ∈ ℝ) → (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑)))
28	27	rexlimdva 3286	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑)))
29		breq1 5071	. . . . . 6 ⊢ (𝑛 = 𝑗 → (𝑛 ≤ 𝑘 ↔ 𝑗 ≤ 𝑘))
30	29	imbi1d 344	. . . . 5 ⊢ (𝑛 = 𝑗 → ((𝑛 ≤ 𝑘 → 𝜑) ↔ (𝑗 ≤ 𝑘 → 𝜑)))
31	30	ralbidv 3199	. . . 4 ⊢ (𝑛 = 𝑗 → (∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑) ↔ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
32	31	cbvrexvw 3452	. . 3 ⊢ (∃𝑛 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑛 ≤ 𝑘 → 𝜑) ↔ ∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑))
33	28, 32	syl6ib 253	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) → ∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))
34	6, 33	impbid 214	1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐵 ∈ ℝ) → (∃𝑗 ∈ (𝐵[,)+∞)∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ↔ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∈ wcel 2114  ∀wral 3140  ∃wrex 3141   ⊆ wss 3938  ifcif 4469   class class class wbr 5068  (class class class)co 7158  ℝcr 10538  +∞cpnf 10674  ℝ^*cxr 10676   ≤ cle 10678  [,)cico 12743

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-pre-lttri 10613  ax-pre-lttrn 10614

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-po 5476  df-so 5477  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-er 8291  df-en 8512  df-dom 8513  df-sdom 8514  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-ico 12747

This theorem is referenced by:  rlimi2  14873  ello1mpt2  14881  dvfsumrlim  24630