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

Theorem cndprobval 35058
Description: The value of the conditional probability , i.e. the probability for the event 𝐴, given 𝐵, under the probability law 𝑃. (Contributed by Thierry Arnoux, 21-Jan-2017.)
Assertion
Ref Expression
cndprobval ((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) → ((cprob‘𝑃)‘⟨𝐴, 𝐵⟩) = ((𝑃‘(𝐴 ∩ 𝐵)) / (𝑃‘𝐵)))

Proof of Theorem cndprobval
Dummy variables 𝑎 𝑏 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ov 7421 . 2 (𝐴(cprob‘𝑃)𝐵) = ((cprob‘𝑃)‘⟨𝐴, 𝐵⟩)
2 df-cndprob 35057 . . . . 5 cprob = (𝑝 ∈ Prob ↦ (𝑎 ∈ dom 𝑝, 𝑏 ∈ dom 𝑝 ↦ ((𝑝‘(𝑎 ∩ 𝑏)) / (𝑝‘𝑏))))
3 dmeq 5885 . . . . . 6 (𝑝 = 𝑃 → dom 𝑝 = dom 𝑃)
4 fveq1 6882 . . . . . . 7 (𝑝 = 𝑃 → (𝑝‘(𝑎 ∩ 𝑏)) = (𝑃‘(𝑎 ∩ 𝑏)))
5 fveq1 6882 . . . . . . 7 (𝑝 = 𝑃 → (𝑝‘𝑏) = (𝑃‘𝑏))
64, 5oveq12d 7436 . . . . . 6 (𝑝 = 𝑃 → ((𝑝‘(𝑎 ∩ 𝑏)) / (𝑝‘𝑏)) = ((𝑃‘(𝑎 ∩ 𝑏)) / (𝑃‘𝑏)))
73, 3, 6mpoeq123dv 7493 . . . . 5 (𝑝 = 𝑃 → (𝑎 ∈ dom 𝑝, 𝑏 ∈ dom 𝑝 ↦ ((𝑝‘(𝑎 ∩ 𝑏)) / (𝑝‘𝑏))) = (𝑎 ∈ dom 𝑃, 𝑏 ∈ dom 𝑃 ↦ ((𝑃‘(𝑎 ∩ 𝑏)) / (𝑃‘𝑏))))
8 id 23 . . . . 5 (𝑃 ∈ Prob → 𝑃 ∈ Prob)
9 dmexg 7911 . . . . . 6 (𝑃 ∈ Prob → dom 𝑃 ∈ V)
10 mpoexga 8088 . . . . . 6 ((dom 𝑃 ∈ V ∧ dom 𝑃 ∈ V) → (𝑎 ∈ dom 𝑃, 𝑏 ∈ dom 𝑃 ↦ ((𝑃‘(𝑎 ∩ 𝑏)) / (𝑃‘𝑏))) ∈ V)
119, 9, 10syl2anc 596 . . . . 5 (𝑃 ∈ Prob → (𝑎 ∈ dom 𝑃, 𝑏 ∈ dom 𝑃 ↦ ((𝑃‘(𝑎 ∩ 𝑏)) / (𝑃‘𝑏))) ∈ V)
122, 7, 8, 11fvmptd3 7015 . . . 4 (𝑃 ∈ Prob → (cprob‘𝑃) = (𝑎 ∈ dom 𝑃, 𝑏 ∈ dom 𝑃 ↦ ((𝑃‘(𝑎 ∩ 𝑏)) / (𝑃‘𝑏))))
13123ad2ant1 1151 . . 3 ((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) → (cprob‘𝑃) = (𝑎 ∈ dom 𝑃, 𝑏 ∈ dom 𝑃 ↦ ((𝑃‘(𝑎 ∩ 𝑏)) / (𝑃‘𝑏))))
14 simprl 783 . . . . . 6 (((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → 𝑎 = 𝐴)
15 simprr 785 . . . . . 6 (((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → 𝑏 = 𝐵)
1614, 15ineq12d 4167 . . . . 5 (((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → (𝑎 ∩ 𝑏) = (𝐴 ∩ 𝐵))
1716fveq2d 6887 . . . 4 (((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → (𝑃‘(𝑎 ∩ 𝑏)) = (𝑃‘(𝐴 ∩ 𝐵)))
1815fveq2d 6887 . . . 4 (((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → (𝑃‘𝑏) = (𝑃‘𝐵))
1917, 18oveq12d 7436 . . 3 (((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) ∧ (𝑎 = 𝐴 ∧ 𝑏 = 𝐵)) → ((𝑃‘(𝑎 ∩ 𝑏)) / (𝑃‘𝑏)) = ((𝑃‘(𝐴 ∩ 𝐵)) / (𝑃‘𝐵)))
20 simp2 1155 . . 3 ((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) → 𝐴 ∈ dom 𝑃)
21 simp3 1156 . . 3 ((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) → 𝐵 ∈ dom 𝑃)
22 ovexd 7453 . . 3 ((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) → ((𝑃‘(𝐴 ∩ 𝐵)) / (𝑃‘𝐵)) ∈ V)
2313, 19, 20, 21, 22ovmpod 7570 . 2 ((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) → (𝐴(cprob‘𝑃)𝐵) = ((𝑃‘(𝐴 ∩ 𝐵)) / (𝑃‘𝐵)))
241, 23eqtr3id 2810 1 ((𝑃 ∈ Prob ∧ 𝐴 ∈ dom 𝑃 ∧ 𝐵 ∈ dom 𝑃) → ((cprob‘𝑃)‘⟨𝐴, 𝐵⟩) = ((𝑃‘(𝐴 ∩ 𝐵)) / (𝑃‘𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∩ cin 3898  ⟨cop 4590  dom cdm 5651  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420   / cdiv 11966  Probcprb 35032  cprobccprob 35056
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-cndprob 35057
This theorem is used by:  cndprobin  35059  cndprob01  35060  cndprobtot  35061  cndprobnul  35062  cndprobprob  35063
  Copyright terms: Public domain W3C validator