Theorem iccf 13180

Description: The set of closed intervals of extended reals maps to subsets of extended reals. (Contributed by FL, 14-Jun-2007.) (Revised by Mario Carneiro, 3-Nov-2013.)

Assertion

Ref	Expression
iccf	⊢ [,]:(ℝ* × ℝ*)⟶𝒫 ℝ*

Proof of Theorem iccf

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

Step	Hyp	Ref	Expression
1		df-icc 13086	. 2 ⊢ [,] = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)})
2	1	ixxf 13089	1 ⊢ [,]:(ℝ* × ℝ*)⟶𝒫 ℝ*

Syntax hints:  𝒫 cpw 4533   × cxp 5587  ⟶wf 6429  ℝ^*cxr 11008   ≤ cle 11010  [,]cicc 13082

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-xr 11013  df-icc 13086

This theorem is referenced by:  lecldbas  22370  ovolficc  24632  ovolficcss  24633  uniiccdif  24742  uniiccvol  24744  dyadmbllem  24763  dyadmbl  24764  opnmbllem  24765  opnmbllem0  35813  mblfinlem1  35814  mblfinlem2  35815