Theorem icoreresf 36740

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 11263	. . 3 ⊢ (ℝ × ℝ) ⊆ (ℝ* × ℝ*)
2		df-ico 13336	. . . . 5 ⊢ [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
3	2	ixxf 13340	. . . 4 ⊢ [,):(ℝ* × ℝ*)⟶𝒫 ℝ*
4		ffn 6711	. . . 4 ⊢ ([,):(ℝ* × ℝ*)⟶𝒫 ℝ* → [,) Fn (ℝ* × ℝ*))
5		fnssresb 6666	. . . 4 ⊢ ([,) Fn (ℝ* × ℝ*) → (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ↔ (ℝ × ℝ) ⊆ (ℝ* × ℝ*)))
6	3, 4, 5	mp2b 10	. . 3 ⊢ (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ↔ (ℝ × ℝ) ⊆ (ℝ* × ℝ*))
7	1, 6	mpbir 230	. 2 ⊢ ([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ)
8		eqid 2726	. . . . 5 ⊢ ([,) ↾ (ℝ × ℝ)) = ([,) ↾ (ℝ × ℝ))
9	8	icorempo 36739	. . . 4 ⊢ ([,) ↾ (ℝ × ℝ)) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
10	9	rneqi 5930	. . 3 ⊢ ran ([,) ↾ (ℝ × ℝ)) = ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
11		ssrab2 4072	. . . . . 6 ⊢ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ⊆ ℝ
12		reex 11203	. . . . . . 7 ⊢ ℝ ∈ V
13	12	elpw2 5338	. . . . . 6 ⊢ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ↔ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ⊆ ℝ)
14	11, 13	mpbir 230	. . . . 5 ⊢ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ
15	14	rgen2w 3060	. . . 4 ⊢ ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ
16		eqid 2726	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
17	16	rnmpo 7538	. . . . . . 7 ⊢ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) = {𝑙 ∣ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}}
18	17	eqabri 2871	. . . . . 6 ⊢ (𝑙 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
19		simpl 482	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ)
20		simpr 484	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)})
21	19, 20	r19.29d2r 3134	. . . . . . . 8 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}))
22		eleq1 2815	. . . . . . . . . . 11 ⊢ (𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} → (𝑙 ∈ 𝒫 ℝ ↔ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ))
23	22	biimparc 479	. . . . . . . . . 10 ⊢ (({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
24	23	a1i 11	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ))
25	24	rexlimivv 3193	. . . . . . . 8 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ ({𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
26	21, 25	syl 17	. . . . . . 7 ⊢ ((∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ ∧ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ)
27	26	ex 412	. . . . . 6 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝑙 = {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} → 𝑙 ∈ 𝒫 ℝ))
28	18, 27	biimtrid 241	. . . . 5 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → (𝑙 ∈ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) → 𝑙 ∈ 𝒫 ℝ))
29	28	ssrdv 3983	. . . 4 ⊢ (∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)} ∈ 𝒫 ℝ → ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ⊆ 𝒫 ℝ)
30	15, 29	ax-mp 5	. . 3 ⊢ ran (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ {𝑧 ∈ ℝ ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) ⊆ 𝒫 ℝ
31	10, 30	eqsstri 4011	. 2 ⊢ ran ([,) ↾ (ℝ × ℝ)) ⊆ 𝒫 ℝ
32		df-f 6541	. 2 ⊢ (([,) ↾ (ℝ × ℝ)):(ℝ × ℝ)⟶𝒫 ℝ ↔ (([,) ↾ (ℝ × ℝ)) Fn (ℝ × ℝ) ∧ ran ([,) ↾ (ℝ × ℝ)) ⊆ 𝒫 ℝ))
33	7, 31, 32	mpbir2an 708	1 ⊢ ([,) ↾ (ℝ × ℝ)):(ℝ × ℝ)⟶𝒫 ℝ

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1533   ∈ wcel 2098  ∀wral 3055  ∃wrex 3064  {crab 3426   ⊆ wss 3943  𝒫 cpw 4597   class class class wbr 5141   × cxp 5667  ran crn 5670   ↾ cres 5671   Fn wfn 6532  ⟶wf 6533   ∈ cmpo 7407  ℝcr 11111  ℝ^*cxr 11251   < clt 11252   ≤ cle 11253  [,)cico 13332

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722  ax-cnex 11168  ax-resscn 11169  ax-pre-lttri 11186  ax-pre-lttrn 11187

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-nel 3041  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-po 5581  df-so 5582  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-oprab 7409  df-mpo 7410  df-1st 7974  df-2nd 7975  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-pnf 11254  df-mnf 11255  df-xr 11256  df-ltxr 11257  df-le 11258  df-ico 13336

This theorem is referenced by:  icoreelrnab  36742  icoreunrn  36747