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

Theorem measbasedom 31463
Description: The base set of a measure is its domain. (Contributed by Thierry Arnoux, 25-Dec-2016.)
Assertion
Ref Expression
measbasedom (𝑀 ran measures ↔ 𝑀 ∈ (measures‘dom 𝑀))

Proof of Theorem measbasedom
Dummy variables 𝑥 𝑦 𝑚 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isrnmeas 31461 . . . 4 (𝑀 ran measures → (dom 𝑀 ran sigAlgebra ∧ (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → (𝑀 𝑥) = Σ*𝑦𝑥(𝑀𝑦)))))
21simprd 498 . . 3 (𝑀 ran measures → (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → (𝑀 𝑥) = Σ*𝑦𝑥(𝑀𝑦))))
3 dmmeas 31462 . . . 4 (𝑀 ran measures → dom 𝑀 ran sigAlgebra)
4 ismeas 31460 . . . 4 (dom 𝑀 ran sigAlgebra → (𝑀 ∈ (measures‘dom 𝑀) ↔ (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → (𝑀 𝑥) = Σ*𝑦𝑥(𝑀𝑦)))))
53, 4syl 17 . . 3 (𝑀 ran measures → (𝑀 ∈ (measures‘dom 𝑀) ↔ (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → (𝑀 𝑥) = Σ*𝑦𝑥(𝑀𝑦)))))
62, 5mpbird 259 . 2 (𝑀 ran measures → 𝑀 ∈ (measures‘dom 𝑀))
7 df-meas 31457 . . . 4 measures = (𝑠 ran sigAlgebra ↦ {𝑚 ∣ (𝑚:𝑠⟶(0[,]+∞) ∧ (𝑚‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → (𝑚 𝑥) = Σ*𝑦𝑥(𝑚𝑦)))})
87funmpt2 6396 . . 3 Fun measures
9 elunirn2 30398 . . 3 ((Fun measures ∧ 𝑀 ∈ (measures‘dom 𝑀)) → 𝑀 ran measures)
108, 9mpan 688 . 2 (𝑀 ∈ (measures‘dom 𝑀) → 𝑀 ran measures)
116, 10impbii 211 1 (𝑀 ran measures ↔ 𝑀 ∈ (measures‘dom 𝑀))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083   = wceq 1537  wcel 2114  {cab 2801  wral 3140  c0 4293  𝒫 cpw 4541   cuni 4840  Disj wdisj 5033   class class class wbr 5068  dom cdm 5557  ran crn 5558  Fun wfun 6351  wf 6353  cfv 6357  (class class class)co 7158  ωcom 7582  cdom 8509  0cc0 10539  +∞cpnf 10674  [,]cicc 12744  Σ*cesum 31288  sigAlgebracsiga 31369  measurescmeas 31456
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-fv 6365  df-ov 7161  df-esum 31289  df-meas 31457
This theorem is referenced by:  truae  31504  aean  31505  mbfmbfm  31518  sibfinima  31599  sibfof  31600  domprobmeas  31670  probmeasd  31683  probfinmeasb  31688  probfinmeasbALTV  31689  probmeasb  31690  dstrvprob  31731
  Copyright terms: Public domain W3C validator