Theorem elprob 31667

Description: The property of being a probability measure. (Contributed by Thierry Arnoux, 8-Dec-2016.)

Assertion

Ref	Expression
elprob	⊢ (𝑃 ∈ Prob ↔ (𝑃 ∈ ∪ ran measures ∧ (𝑃‘∪ dom 𝑃) = 1))

Proof of Theorem elprob

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 22	. . . 4 ⊢ (𝑝 = 𝑃 → 𝑝 = 𝑃)
2		dmeq 5771	. . . . 5 ⊢ (𝑝 = 𝑃 → dom 𝑝 = dom 𝑃)
3	2	unieqd 4851	. . . 4 ⊢ (𝑝 = 𝑃 → ∪ dom 𝑝 = ∪ dom 𝑃)
4	1, 3	fveq12d 6676	. . 3 ⊢ (𝑝 = 𝑃 → (𝑝‘∪ dom 𝑝) = (𝑃‘∪ dom 𝑃))
5	4	eqeq1d 2823	. 2 ⊢ (𝑝 = 𝑃 → ((𝑝‘∪ dom 𝑝) = 1 ↔ (𝑃‘∪ dom 𝑃) = 1))
6		df-prob 31666	. 2 ⊢ Prob = {𝑝 ∈ ∪ ran measures ∣ (𝑝‘∪ dom 𝑝) = 1}
7	5, 6	elrab2 3682	1 ⊢ (𝑃 ∈ Prob ↔ (𝑃 ∈ ∪ ran measures ∧ (𝑃‘∪ dom 𝑃) = 1))

Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∪ cuni 4837  dom cdm 5554  ran crn 5555  ‘cfv 6354  1c1 10537  measurescmeas 31454  Probcprb 31665

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-dm 5564  df-iota 6313  df-fv 6362  df-prob 31666

This theorem is referenced by:  domprobmeas  31668  probtot  31670  probfinmeasb  31686  probfinmeasbALTV  31687  probmeasb  31688  dstrvprob  31729