Theorem rrvmbfm 34953

Description: A real-valued random variable is a measurable function from its sample space to the Borel sigma-algebra. (Contributed by Thierry Arnoux, 25-Jan-2017.)

Hypothesis

Ref	Expression
isrrvv.1	⊢ (𝜑 → 𝑃 ∈ Prob)

Assertion

Ref	Expression
rrvmbfm	⊢ (𝜑 → (𝑋 ∈ (rRndVar‘𝑃) ↔ 𝑋 ∈ (dom 𝑃MblFnM𝔅ℝ)))

Proof of Theorem rrvmbfm

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isrrvv.1	. . 3 ⊢ (𝜑 → 𝑃 ∈ Prob)
2		dmeq 5887	. . . . 5 ⊢ (𝑝 = 𝑃 → dom 𝑝 = dom 𝑃)
3	2	oveq1d 7428	. . . 4 ⊢ (𝑝 = 𝑃 → (dom 𝑝MblFnM𝔅ℝ) = (dom 𝑃MblFnM𝔅ℝ))
4		df-rrv 34952	. . . 4 ⊢ rRndVar = (𝑝 ∈ Prob ↦ (dom 𝑝MblFnM𝔅ℝ))
5		ovex 7446	. . . 4 ⊢ (dom 𝑃MblFnM𝔅ℝ) ∈ V
6	3, 4, 5	fvmpt 6986	. . 3 ⊢ (𝑃 ∈ Prob → (rRndVar‘𝑃) = (dom 𝑃MblFnM𝔅ℝ))
7	1, 6	syl 18	. 2 ⊢ (𝜑 → (rRndVar‘𝑃) = (dom 𝑃MblFnM𝔅ℝ))
8	7	eleq2d 2846	1 ⊢ (𝜑 → (𝑋 ∈ (rRndVar‘𝑃) ↔ 𝑋 ∈ (dom 𝑃MblFnM𝔅ℝ)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  dom cdm 5655  ‘cfv 6533  (class class class)co 7413  𝔅_ℝcbrsiga 34692  MblFnMcmbfm 34760  Probcprb 34918  rRndVarcrrv 34951

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-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-rrv 34952

This theorem is used by:  isrrvv  34954  rrvadd  34963  rrvmulc  34964  orrvcval4  34976  orrvcoel  34977  orrvccel  34978