Theorem omeunile 47336

Description: The outer measure of the union of a countable set is the less than or equal to the extended sum of the outer measures. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
omeunile.o	⊢ (𝜑 → 𝑂 ∈ OutMeas)
omeunile.x	⊢ 𝑋 = ∪ dom 𝑂
omeunile.y	⊢ (𝜑 → 𝑌 ⊆ 𝒫 𝑋)
omeunile.ct	⊢ (𝜑 → 𝑌 ≼ ω)

Assertion

Ref	Expression
omeunile	⊢ (𝜑 → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌)))

Proof of Theorem omeunile

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		omeunile.ct	. 2 ⊢ (𝜑 → 𝑌 ≼ ω)
2		omeunile.y	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝒫 𝑋)
3		omeunile.o	. . . . . . . . 9 ⊢ (𝜑 → 𝑂 ∈ OutMeas)
4		omeunile.x	. . . . . . . . 9 ⊢ 𝑋 = ∪ dom 𝑂
5	3, 4	unidmex 45887	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ V)
6	5	pwexd 5344	. . . . . . 7 ⊢ (𝜑 → 𝒫 𝑋 ∈ V)
7		ssexg 5284	. . . . . . 7 ⊢ ((𝑌 ⊆ 𝒫 𝑋 ∧ 𝒫 𝑋 ∈ V) → 𝑌 ∈ V)
8	2, 6, 7	syl2anc 596	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ V)
9		elpwg 4560	. . . . . 6 ⊢ (𝑌 ∈ V → (𝑌 ∈ 𝒫 𝒫 𝑋 ↔ 𝑌 ⊆ 𝒫 𝑋))
10	8, 9	syl 18	. . . . 5 ⊢ (𝜑 → (𝑌 ∈ 𝒫 𝒫 𝑋 ↔ 𝑌 ⊆ 𝒫 𝑋))
11	2, 10	mpbird 260	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝒫 𝒫 𝑋)
12		omedm 47330	. . . . . . 7 ⊢ (𝑂 ∈ OutMeas → dom 𝑂 = 𝒫 ∪ dom 𝑂)
13	3, 12	syl 18	. . . . . 6 ⊢ (𝜑 → dom 𝑂 = 𝒫 ∪ dom 𝑂)
14	4	pweqi 4573	. . . . . . . 8 ⊢ 𝒫 𝑋 = 𝒫 ∪ dom 𝑂
15	14	eqcomi 2769	. . . . . . 7 ⊢ 𝒫 ∪ dom 𝑂 = 𝒫 𝑋
16	15	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
17	13, 16	eqtr2d 2796	. . . . 5 ⊢ (𝜑 → 𝒫 𝑋 = dom 𝑂)
18	17	pweqd 4574	. . . 4 ⊢ (𝜑 → 𝒫 𝒫 𝑋 = 𝒫 dom 𝑂)
19	11, 18	eleqtrd 2862	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝒫 dom 𝑂)
20		isome 47325	. . . . . 6 ⊢ (𝑂 ∈ OutMeas → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑥 ∈ 𝒫 𝑦(𝑂‘𝑥) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))
21	3, 20	syl 18	. . . . 5 ⊢ (𝜑 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑥 ∈ 𝒫 𝑦(𝑂‘𝑥) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))
22	3, 21	mpbid 235	. . . 4 ⊢ (𝜑 → ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑥 ∈ 𝒫 𝑦(𝑂‘𝑥) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)))))
23	22	simprd 501	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))
24		breq1 5106	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦 ≼ ω ↔ 𝑌 ≼ ω))
25		unieq 4878	. . . . . . 7 ⊢ (𝑦 = 𝑌 → ∪ 𝑦 = ∪ 𝑌)
26	25	fveq2d 6883	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑂‘∪ 𝑦) = (𝑂‘∪ 𝑌))
27		reseq2 5967	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑂 ↾ 𝑦) = (𝑂 ↾ 𝑌))
28	27	fveq2d 6883	. . . . . 6 ⊢ (𝑦 = 𝑌 → (Σ^‘(𝑂 ↾ 𝑦)) = (Σ^‘(𝑂 ↾ 𝑌)))
29	26, 28	breq12d 5116	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)) ↔ (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌))))
30	24, 29	imbi12d 347	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))) ↔ (𝑌 ≼ ω → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌)))))
31	30	rspcva 3574	. . 3 ⊢ ((𝑌 ∈ 𝒫 dom 𝑂 ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)))) → (𝑌 ≼ ω → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌))))
32	19, 23, 31	syl2anc 596	. 2 ⊢ (𝜑 → (𝑌 ≼ ω → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌))))
33	1, 32	mpd 16	1 ⊢ (𝜑 → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  Vcvv 3450   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867   class class class wbr 5103  dom cdm 5655   ↾ cres 5657  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414  ωcom 7863   ≼ cdom 8953  0cc0 11127  +∞cpnf 11267   ≤ cle 11271  [,]cicc 13404  Σ^{^}csumge0 47193  OutMeascome 47320

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-ext 2732  ax-sep 5251  ax-pow 5330  ax-pr 5398  ax-un 7737

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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  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-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ome 47321

This theorem is used by:  omeunle  47347  omeiunle  47348