Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  meadjuni Structured version   Visualization version   GIF version

Theorem meadjuni 47740
Description: The measure of the disjoint union of a countable set is the extended sum of the measures. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
meadjuni.m (𝜑 → 𝑀 ∈ Meas)
meadjuni.s 𝑆 = dom 𝑀
meadjuni.x (𝜑 → 𝑋 ⊆ 𝑆)
meadjuni.cnb (𝜑 → 𝑋 ≼ ω)
meadjuni.dj (𝜑 → Disj 𝑥 ∈ 𝑋 𝑥)
Assertion
Ref Expression
meadjuni (𝜑 → (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋)))
Distinct variable group:   𝑥,𝑋
Allowed substitution hints:   𝜑(𝑥)   𝑆(𝑥)   𝑀(𝑥)

Proof of Theorem meadjuni
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 meadjuni.cnb . 2 (𝜑 → 𝑋 ≼ ω)
2 meadjuni.dj . 2 (𝜑 → Disj 𝑥 ∈ 𝑋 𝑥)
3 breq1 5111 . . . . 5 (𝑦 = 𝑋 → (𝑦 ≼ ω ↔ 𝑋 ≼ ω))
4 disjeq1 5082 . . . . 5 (𝑦 = 𝑋 → (Disj 𝑥 ∈ 𝑦 𝑥 ↔ Disj 𝑥 ∈ 𝑋 𝑥))
53, 4anbi12d 644 . . . 4 (𝑦 = 𝑋 → ((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) ↔ (𝑋 ≼ ω ∧ Disj 𝑥 ∈ 𝑋 𝑥)))
6 unieq 4883 . . . . . 6 (𝑦 = 𝑋 → ∪ 𝑦 = ∪ 𝑋)
76fveq2d 6920 . . . . 5 (𝑦 = 𝑋 → (𝑀‘∪ 𝑦) = (𝑀‘∪ 𝑋))
8 reseq2 5981 . . . . . 6 (𝑦 = 𝑋 → (𝑀 ↾ 𝑦) = (𝑀 ↾ 𝑋))
98fveq2d 6920 . . . . 5 (𝑦 = 𝑋 → (Σ^‘(𝑀 ↾ 𝑦)) = (Σ^‘(𝑀 ↾ 𝑋)))
107, 9eqeq12d 2779 . . . 4 (𝑦 = 𝑋 → ((𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦)) ↔ (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋))))
115, 10imbi12d 347 . . 3 (𝑦 = 𝑋 → (((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦))) ↔ ((𝑋 ≼ ω ∧ Disj 𝑥 ∈ 𝑋 𝑥) → (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋)))))
12 meadjuni.m . . . . 5 (𝜑 → 𝑀 ∈ Meas)
13 ismea 47734 . . . . 5 (𝑀 ∈ Meas ↔ (((𝑀:dom 𝑀⟶(0[,]+∞) ∧ dom 𝑀 ∈ SAlg) ∧ (𝑀‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑀((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦)))))
1412, 13sylib 221 . . . 4 (𝜑 → (((𝑀:dom 𝑀⟶(0[,]+∞) ∧ dom 𝑀 ∈ SAlg) ∧ (𝑀‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑀((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦)))))
1514simprd 501 . . 3 (𝜑 → ∀𝑦 ∈ 𝒫 dom 𝑀((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦))))
16 meadjuni.s . . . . . 6 𝑆 = dom 𝑀
1712, 16dmmeasal 47735 . . . . 5 (𝜑 → 𝑆 ∈ SAlg)
18 meadjuni.x . . . . 5 (𝜑 → 𝑋 ⊆ 𝑆)
1917, 18ssexd 5293 . . . 4 (𝜑 → 𝑋 ∈ V)
2018, 16sseqtrdi 3953 . . . 4 (𝜑 → 𝑋 ⊆ dom 𝑀)
2119, 20elpwd 4566 . . 3 (𝜑 → 𝑋 ∈ 𝒫 dom 𝑀)
2211, 15, 21rspcdva 3581 . 2 (𝜑 → ((𝑋 ≼ ω ∧ Disj 𝑥 ∈ 𝑋 𝑥) → (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋))))
231, 2, 22mp2and 712 1 (𝜑 → (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872  Disj wdisj 5075   class class class wbr 5108  dom cdm 5658   ↾ cres 5660  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ωcom 7911   ≼ cdom 9009  0cc0 11239  +∞cpnf 11379  [,]cicc 13519  SAlgcsalg 47591  Σ^csumge0 47645  Meascmea 47732
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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398
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-rmo 3369  df-reu 3370  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-iun 4958  df-disj 5076  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-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-mea 47733
This theorem is used by:  meadjun  47745  meadjiun  47749
  Copyright terms: Public domain W3C validator