Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  0rrv Structured version   Visualization version   GIF version

Theorem 0rrv 29840
 Description: The constant function equal to zero is a random variable. (Contributed by Thierry Arnoux, 16-Jan-2017.) (Revised by Thierry Arnoux, 30-Jan-2017.)
Hypothesis
Ref Expression
0rrv.1 (𝜑𝑃 ∈ Prob)
Assertion
Ref Expression
0rrv (𝜑 → (𝑥 dom 𝑃 ↦ 0) ∈ (rRndVar‘𝑃))
Distinct variable group:   𝑥,𝑃
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem 0rrv
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 0re 9919 . . . . 5 0 ∈ ℝ
21rgenw 2908 . . . 4 𝑥 dom 𝑃0 ∈ ℝ
3 eqid 2610 . . . . 5 (𝑥 dom 𝑃 ↦ 0) = (𝑥 dom 𝑃 ↦ 0)
43fmpt 6289 . . . 4 (∀𝑥 dom 𝑃0 ∈ ℝ ↔ (𝑥 dom 𝑃 ↦ 0): dom 𝑃⟶ℝ)
52, 4mpbi 219 . . 3 (𝑥 dom 𝑃 ↦ 0): dom 𝑃⟶ℝ
65a1i 11 . 2 (𝜑 → (𝑥 dom 𝑃 ↦ 0): dom 𝑃⟶ℝ)
7 fconstmpt 5085 . . . . . . . . . 10 ( dom 𝑃 × {0}) = (𝑥 dom 𝑃 ↦ 0)
87cnveqi 5219 . . . . . . . . 9 ( dom 𝑃 × {0}) = (𝑥 dom 𝑃 ↦ 0)
9 cnvxp 5470 . . . . . . . . 9 ( dom 𝑃 × {0}) = ({0} × dom 𝑃)
108, 9eqtr3i 2634 . . . . . . . 8 (𝑥 dom 𝑃 ↦ 0) = ({0} × dom 𝑃)
1110imaeq1i 5382 . . . . . . 7 ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) = (({0} × dom 𝑃) “ 𝑦)
12 df-ima 5051 . . . . . . 7 (({0} × dom 𝑃) “ 𝑦) = ran (({0} × dom 𝑃) ↾ 𝑦)
13 df-rn 5049 . . . . . . 7 ran (({0} × dom 𝑃) ↾ 𝑦) = dom (({0} × dom 𝑃) ↾ 𝑦)
1411, 12, 133eqtri 2636 . . . . . 6 ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) = dom (({0} × dom 𝑃) ↾ 𝑦)
15 df-res 5050 . . . . . . . . 9 (({0} × dom 𝑃) ↾ 𝑦) = (({0} × dom 𝑃) ∩ (𝑦 × V))
16 inxp 5176 . . . . . . . . 9 (({0} × dom 𝑃) ∩ (𝑦 × V)) = (({0} ∩ 𝑦) × ( dom 𝑃 ∩ V))
17 inv1 3922 . . . . . . . . . 10 ( dom 𝑃 ∩ V) = dom 𝑃
1817xpeq2i 5060 . . . . . . . . 9 (({0} ∩ 𝑦) × ( dom 𝑃 ∩ V)) = (({0} ∩ 𝑦) × dom 𝑃)
1915, 16, 183eqtri 2636 . . . . . . . 8 (({0} × dom 𝑃) ↾ 𝑦) = (({0} ∩ 𝑦) × dom 𝑃)
2019cnveqi 5219 . . . . . . 7 (({0} × dom 𝑃) ↾ 𝑦) = (({0} ∩ 𝑦) × dom 𝑃)
2120dmeqi 5247 . . . . . 6 dom (({0} × dom 𝑃) ↾ 𝑦) = dom (({0} ∩ 𝑦) × dom 𝑃)
22 cnvxp 5470 . . . . . . 7 (({0} ∩ 𝑦) × dom 𝑃) = ( dom 𝑃 × ({0} ∩ 𝑦))
2322dmeqi 5247 . . . . . 6 dom (({0} ∩ 𝑦) × dom 𝑃) = dom ( dom 𝑃 × ({0} ∩ 𝑦))
2414, 21, 233eqtri 2636 . . . . 5 ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) = dom ( dom 𝑃 × ({0} ∩ 𝑦))
25 xpeq2 5053 . . . . . . . . . 10 (({0} ∩ 𝑦) = ∅ → ( dom 𝑃 × ({0} ∩ 𝑦)) = ( dom 𝑃 × ∅))
26 xp0 5471 . . . . . . . . . 10 ( dom 𝑃 × ∅) = ∅
2725, 26syl6eq 2660 . . . . . . . . 9 (({0} ∩ 𝑦) = ∅ → ( dom 𝑃 × ({0} ∩ 𝑦)) = ∅)
2827dmeqd 5248 . . . . . . . 8 (({0} ∩ 𝑦) = ∅ → dom ( dom 𝑃 × ({0} ∩ 𝑦)) = dom ∅)
29 dm0 5260 . . . . . . . 8 dom ∅ = ∅
3028, 29syl6eq 2660 . . . . . . 7 (({0} ∩ 𝑦) = ∅ → dom ( dom 𝑃 × ({0} ∩ 𝑦)) = ∅)
3130adantl 481 . . . . . 6 ((𝜑 ∧ ({0} ∩ 𝑦) = ∅) → dom ( dom 𝑃 × ({0} ∩ 𝑦)) = ∅)
32 0rrv.1 . . . . . . . 8 (𝜑𝑃 ∈ Prob)
33 domprobsiga 29800 . . . . . . . 8 (𝑃 ∈ Prob → dom 𝑃 ran sigAlgebra)
34 0elsiga 29504 . . . . . . . 8 (dom 𝑃 ran sigAlgebra → ∅ ∈ dom 𝑃)
3532, 33, 343syl 18 . . . . . . 7 (𝜑 → ∅ ∈ dom 𝑃)
3635adantr 480 . . . . . 6 ((𝜑 ∧ ({0} ∩ 𝑦) = ∅) → ∅ ∈ dom 𝑃)
3731, 36eqeltrd 2688 . . . . 5 ((𝜑 ∧ ({0} ∩ 𝑦) = ∅) → dom ( dom 𝑃 × ({0} ∩ 𝑦)) ∈ dom 𝑃)
3824, 37syl5eqel 2692 . . . 4 ((𝜑 ∧ ({0} ∩ 𝑦) = ∅) → ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) ∈ dom 𝑃)
39 dmxp 5265 . . . . . . 7 (({0} ∩ 𝑦) ≠ ∅ → dom ( dom 𝑃 × ({0} ∩ 𝑦)) = dom 𝑃)
4039adantl 481 . . . . . 6 ((𝜑 ∧ ({0} ∩ 𝑦) ≠ ∅) → dom ( dom 𝑃 × ({0} ∩ 𝑦)) = dom 𝑃)
4132unveldomd 29804 . . . . . . 7 (𝜑 dom 𝑃 ∈ dom 𝑃)
4241adantr 480 . . . . . 6 ((𝜑 ∧ ({0} ∩ 𝑦) ≠ ∅) → dom 𝑃 ∈ dom 𝑃)
4340, 42eqeltrd 2688 . . . . 5 ((𝜑 ∧ ({0} ∩ 𝑦) ≠ ∅) → dom ( dom 𝑃 × ({0} ∩ 𝑦)) ∈ dom 𝑃)
4424, 43syl5eqel 2692 . . . 4 ((𝜑 ∧ ({0} ∩ 𝑦) ≠ ∅) → ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) ∈ dom 𝑃)
4538, 44pm2.61dane 2869 . . 3 (𝜑 → ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) ∈ dom 𝑃)
4645ralrimivw 2950 . 2 (𝜑 → ∀𝑦 ∈ 𝔅 ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) ∈ dom 𝑃)
4732isrrvv 29832 . 2 (𝜑 → ((𝑥 dom 𝑃 ↦ 0) ∈ (rRndVar‘𝑃) ↔ ((𝑥 dom 𝑃 ↦ 0): dom 𝑃⟶ℝ ∧ ∀𝑦 ∈ 𝔅 ((𝑥 dom 𝑃 ↦ 0) “ 𝑦) ∈ dom 𝑃)))
486, 46, 47mpbir2and 959 1 (𝜑 → (𝑥 dom 𝑃 ↦ 0) ∈ (rRndVar‘𝑃))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  Vcvv 3173   ∩ cin 3539  ∅c0 3874  {csn 4125  ∪ cuni 4372   ↦ cmpt 4643   × cxp 5036  ◡ccnv 5037  dom cdm 5038  ran crn 5039   ↾ cres 5040   “ cima 5041  ⟶wf 5800  ‘cfv 5804  ℝcr 9814  0cc0 9815  sigAlgebracsiga 29497  𝔅ℝcbrsiga 29571  Probcprb 29796  rRndVarcrrv 29829 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-i2m1 9883  ax-1ne0 9884  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-po 4959  df-so 4960  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-ioo 12050  df-topgen 15927  df-top 20521  df-bases 20522  df-esum 29417  df-siga 29498  df-sigagen 29529  df-brsiga 29572  df-meas 29586  df-mbfm 29640  df-prob 29797  df-rrv 29830 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator