Theorem icoreresf 38031

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 11265	. . 3 ⊢ (ℝ × ℝ) ⊆ (ℝ* × ℝ*)
2		df-ico 13389	. . . . 5 ⊢ [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
3	2	ixxf 13393	. . . 4 ⊢ [,):(ℝ* × ℝ*)⟶𝒫 ℝ*
4		ffn 6709	. . . 4 ⊢ ([,):(ℝ* × ℝ*)⟶𝒫 ℝ* → [,) Fn (ℝ* × ℝ*))
5		fnssresb 6661	. . . 4 ⊢ ([,) Fn (ℝ* × ℝ*) → (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ↔ (ℝ × ℝ) ⊆ (ℝ* × ℝ*)))
6	3, 4, 5	mp2b 10	. . 3 ⊢ (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ↔ (ℝ × ℝ) ⊆ (ℝ* × ℝ*))
7	1, 6	mpbir 234	. 2 ⊢ ([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ)
8		eqid 2765	. . . . 5 ⊢ ([,) ↾ (ℝ × ℝ)) = ([,) ↾ (ℝ × ℝ))
9	8	icorempo 38030	. . . 4 ⊢ ([,) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
10	9	rneqi 5929	. . 3 ⊢ ran ([,) ↾ (ℝ × ℝ)) = ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
11		ssrab2 4035	. . . . . 6 ⊢ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ⊆ ℝ
12		reex 11202	. . . . . . 7 ⊢ ℝ ∈ V
13	12	elpw2 5307	. . . . . 6 ⊢ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ↔ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ⊆ ℝ)
14	11, 13	mpbir 234	. . . . 5 ⊢ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ
15	14	rgen2w 3086	. . . 4 ⊢ ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ
16		eqid 2765	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
17	16	rnmpo 7549	. . . . . . 7 ⊢ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) = {𝑙 ∣ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}}
18	17	eqabri 2907	. . . . . 6 ⊢ (𝑙 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
19		simpl 488	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ)
20		simpr 490	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
21	19, 20	r19.29d2r 3154	. . . . . . . 8 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}))
22		eleq1 2853	. . . . . . . . . . 11 ⊢ (𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} → (𝑙 ∈ 𝒫 ℝ ↔ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ))
23	22	biimparc 485	. . . . . . . . . 10 ⊢ (({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
24	23	a1i 11	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ))
25	24	rexlimivv 3209	. . . . . . . 8 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
26	21, 25	syl 18	. . . . . . 7 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
27	26	ex 418	. . . . . 6 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} → 𝑙 ∈ 𝒫 ℝ))
28	18, 27	biimtrid 245	. . . . 5 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → (𝑙 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ))
29	28	ssrdv 3944	. . . 4 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ⊆ 𝒫 ℝ)
30	15, 29	ax-mp 5	. . 3 ⊢ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ⊆ 𝒫 ℝ
31	10, 30	eqsstri 3984	. 2 ⊢ ran ([,) ↾ (ℝ × ℝ)) ⊆ 𝒫 ℝ
32		df-f 6544	. 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 2146  ∀wral 3081  ∃wrex 3091  {crab 3418   ⊆ wss 3906  𝒫 cpw 4564   class class class wbr 5111   × cxp 5661  ran crn 5664   ↾ cres 5665   Fn wfn 6535  ⟶wf 6536   ∈ cmpo 7418  ℝcr 11110  ℝ^*cxr 11253   < clt 11254   ≤ cle 11255  [,)cico 13385

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-resscn 11168  ax-pre-lttri 11185  ax-pre-lttrn 11186

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-po 5571  df-so 5572  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-ico 13389

This theorem is used by:  icoreelrnab  38033  icoreunrn  38038