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 34946
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 34944 . . . 4 (𝑀 ∈ ∪ ran measures → (dom 𝑀 ∈ ∪ ran sigAlgebra ∧ (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → (𝑀‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑀‘𝑦)))))
21simprd 501 . . 3 (𝑀 ∈ ∪ ran measures → (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → (𝑀‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑀‘𝑦))))
3 dmmeas 34945 . . . 4 (𝑀 ∈ ∪ ran measures → dom 𝑀 ∈ ∪ ran sigAlgebra)
4 ismeas 34943 . . . 4 (dom 𝑀 ∈ ∪ ran sigAlgebra → (𝑀 ∈ (measures‘dom 𝑀) ↔ (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → (𝑀‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑀‘𝑦)))))
53, 4syl 18 . . 3 (𝑀 ∈ ∪ ran measures → (𝑀 ∈ (measures‘dom 𝑀) ↔ (𝑀:dom 𝑀⟶(0[,]+∞) ∧ (𝑀‘∅) = 0 ∧ ∀𝑥 ∈ 𝒫 dom 𝑀((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → (𝑀‘∪ 𝑥) = Σ*𝑦 ∈ 𝑥(𝑀‘𝑦)))))
62, 5mpbird 260 . 2 (𝑀 ∈ ∪ ran measures → 𝑀 ∈ (measures‘dom 𝑀))
7 elfvunirn 6946 . 2 (𝑀 ∈ (measures‘dom 𝑀) → 𝑀 ∈ ∪ ran measures)
86, 7impbii 212 1 (𝑀 ∈ ∪ ran measures ↔ 𝑀 ∈ (measures‘dom 𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872  Disj wdisj 5075   class class class wbr 5108  dom cdm 5658  ran crn 5659  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ωcom 7911   ≼ cdom 9009  0cc0 11239  +∞cpnf 11379  [,]cicc 13519  Σ*cesum 34770  sigAlgebracsiga 34851  measurescmeas 34939
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-esum 34771  df-meas 34940
This theorem is used by:  truae  34987  aean  34988  sibfinima  35082  sibfof  35083  domprobmeas  35153  probmeasd  35166  probfinmeasb  35171  probfinmeasbALTV  35172  probmeasb  35173  dstrvprob  35215
  Copyright terms: Public domain W3C validator