Theorem meadjuni 47466

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.

Step	Hyp	Ref	Expression
1		meadjuni.cnb	. 2 ⊢ (𝜑 → 𝑋 ≼ ω)
2		meadjuni.dj	. 2 ⊢ (𝜑 → Disj 𝑥 ∈ 𝑋 𝑥)
3		breq1 5106	. . . . 5 ⊢ (𝑦 = 𝑋 → (𝑦 ≼ ω ↔ 𝑋 ≼ ω))
4		disjeq1 5077	. . . . 5 ⊢ (𝑦 = 𝑋 → (Disj 𝑥 ∈ 𝑦 𝑥 ↔ Disj 𝑥 ∈ 𝑋 𝑥))
5	3, 4	anbi12d 644	. . . 4 ⊢ (𝑦 = 𝑋 → ((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) ↔ (𝑋 ≼ ω ∧ Disj 𝑥 ∈ 𝑋 𝑥)))
6		unieq 4878	. . . . . 6 ⊢ (𝑦 = 𝑋 → ∪ 𝑦 = ∪ 𝑋)
7	6	fveq2d 6889	. . . . 5 ⊢ (𝑦 = 𝑋 → (𝑀‘∪ 𝑦) = (𝑀‘∪ 𝑋))
8		reseq2 5965	. . . . . 6 ⊢ (𝑦 = 𝑋 → (𝑀 ↾ 𝑦) = (𝑀 ↾ 𝑋))
9	8	fveq2d 6889	. . . . 5 ⊢ (𝑦 = 𝑋 → (Σ^‘(𝑀 ↾ 𝑦)) = (Σ^‘(𝑀 ↾ 𝑋)))
10	7, 9	eqeq12d 2777	. . . 4 ⊢ (𝑦 = 𝑋 → ((𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦)) ↔ (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋))))
11	5, 10	imbi12d 347	. . 3 ⊢ (𝑦 = 𝑋 → (((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦))) ↔ ((𝑋 ≼ ω ∧ Disj 𝑥 ∈ 𝑋 𝑥) → (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋)))))
12		meadjuni.m	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ Meas)
13		ismea 47460	. . . . 5 ⊢ (𝑀 ∈ Meas ↔ (((𝑀:dom 𝑀⟶(0[,]+∞) ∧ dom 𝑀 ∈ SAlg) ∧ (𝑀‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑀((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦)))))
14	12, 13	sylib 221	. . . 4 ⊢ (𝜑 → (((𝑀:dom 𝑀⟶(0[,]+∞) ∧ dom 𝑀 ∈ SAlg) ∧ (𝑀‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 dom 𝑀((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦)))))
15	14	simprd 501	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 dom 𝑀((𝑦 ≼ ω ∧ Disj 𝑥 ∈ 𝑦 𝑥) → (𝑀‘∪ 𝑦) = (Σ^‘(𝑀 ↾ 𝑦))))
16		meadjuni.s	. . . . . 6 ⊢ 𝑆 = dom 𝑀
17	12, 16	dmmeasal 47461	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ SAlg)
18		meadjuni.x	. . . . 5 ⊢ (𝜑 → 𝑋 ⊆ 𝑆)
19	17, 18	ssexd 5286	. . . 4 ⊢ (𝜑 → 𝑋 ∈ V)
20	18, 16	sseqtrdi 3971	. . . 4 ⊢ (𝜑 → 𝑋 ⊆ dom 𝑀)
21	19, 20	elpwd 4563	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝒫 dom 𝑀)
22	11, 15, 21	rspcdva 3578	. 2 ⊢ (𝜑 → ((𝑋 ≼ ω ∧ Disj 𝑥 ∈ 𝑋 𝑥) → (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋))))
23	1, 2, 22	mp2and 712	1 ⊢ (𝜑 → (𝑀‘∪ 𝑋) = (Σ^‘(𝑀 ↾ 𝑋)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867  Disj wdisj 5070   class class class wbr 5103  dom cdm 5651   ↾ cres 5653  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  ωcom 7877   ≼ cdom 8971  0cc0 11200  +∞cpnf 11340  [,]cicc 13479  SAlgcsalg 47317  Σ^{^}csumge0 47371  Meascmea 47458

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-pr 5391

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-rmo 3366  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-disj 5071  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-mea 47459

This theorem is used by:  meadjun  47471  meadjiun  47475