Theorem icoreresf 38106

Description: Closed-below, open-above intervals of reals map to subsets of reals. (Contributed by ML, 25-Jul-2020.)

Assertion

Ref	Expression
icoreresf	⊢ ([,) ↾ (ℝ × ℝ)):(ℝ × ℝ)⟶𝒫 ℝ

Proof of Theorem icoreresf

Dummy variables 𝑥 𝑦 𝑧 𝑙 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexpssxrxp 11278	. . 3 ⊢ (ℝ × ℝ) ⊆ (ℝ* × ℝ*)
2		df-ico 13404	. . . . 5 ⊢ [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
3	2	ixxf 13408	. . . 4 ⊢ [,):(ℝ* × ℝ*)⟶𝒫 ℝ*
4		ffn 6702	. . . 4 ⊢ ([,):(ℝ* × ℝ*)⟶𝒫 ℝ* → [,) Fn (ℝ* × ℝ*))
5		fnssresb 6654	. . . 4 ⊢ ([,) Fn (ℝ* × ℝ*) → (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ↔ (ℝ × ℝ) ⊆ (ℝ* × ℝ*)))
6	3, 4, 5	mp2b 10	. . 3 ⊢ (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ↔ (ℝ × ℝ) ⊆ (ℝ* × ℝ*))
7	1, 6	mpbir 234	. 2 ⊢ ([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ)
8		eqid 2760	. . . . 5 ⊢ ([,) ↾ (ℝ × ℝ)) = ([,) ↾ (ℝ × ℝ))
9	8	icorempo 38105	. . . 4 ⊢ ([,) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
10	9	rneqi 5921	. . 3 ⊢ ran ([,) ↾ (ℝ × ℝ)) = ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
11		ssrab2 4028	. . . . . 6 ⊢ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ⊆ ℝ
12		reex 11215	. . . . . . 7 ⊢ ℝ ∈ V
13	12	elpw2 5299	. . . . . 6 ⊢ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ↔ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ⊆ ℝ)
14	11, 13	mpbir 234	. . . . 5 ⊢ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ
15	14	rgen2w 3081	. . . 4 ⊢ ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ
16		eqid 2760	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
17	16	rnmpo 7546	. . . . . . 7 ⊢ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) = {𝑙 ∣ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}}
18	17	eqabri 2902	. . . . . 6 ⊢ (𝑙 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
19		simpl 488	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ)
20		simpr 490	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
21	19, 20	r19.29d2r 3149	. . . . . . . 8 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}))
22		eleq1 2848	. . . . . . . . . . 11 ⊢ (𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} → (𝑙 ∈ 𝒫 ℝ ↔ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ))
23	22	biimparc 485	. . . . . . . . . 10 ⊢ (({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
24	23	a1i 11	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ))
25	24	rexlimivv 3204	. . . . . . . 8 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
26	21, 25	syl 18	. . . . . . 7 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
27	26	ex 418	. . . . . 6 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} → 𝑙 ∈ 𝒫 ℝ))
28	18, 27	biimtrid 245	. . . . 5 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → (𝑙 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ))
29	28	ssrdv 3937	. . . 4 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ⊆ 𝒫 ℝ)
30	15, 29	ax-mp 5	. . 3 ⊢ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ⊆ 𝒫 ℝ
31	10, 30	eqsstri 3977	. 2 ⊢ ran ([,) ↾ (ℝ × ℝ)) ⊆ 𝒫 ℝ
32		df-f 6537	. 2 ⊢ (([,) ↾ (ℝ × ℝ)):(ℝ × ℝ)⟶𝒫 ℝ ↔ (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ∧ ran ([,) ↾ (ℝ × ℝ)) ⊆ 𝒫 ℝ))
33	7, 31, 32	mpbir2an 724	1 ⊢ ([,) ↾ (ℝ × ℝ)):(ℝ × ℝ)⟶𝒫 ℝ

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  {crab 3412   ⊆ wss 3899  𝒫 cpw 4557   class class class wbr 5103   × cxp 5653  ran crn 5656   ↾ cres 5657   Fn wfn 6528  ⟶wf 6529   ∈ cmpo 7415  ℝcr 11123  ℝ^*cxr 11266   < clt 11267   ≤ cle 11268  [,)cico 13400

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-resscn 11181  ax-pre-lttri 11198  ax-pre-lttrn 11199

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-le 11273  df-ico 13404

This theorem is used by:  icoreelrnab  38108  icoreunrn  38113