Theorem omeunile 47654

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 46206	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ V)
6	5	pwexd 5344	. . . . . . 7 ⊢ (𝜑 → 𝒫 𝑋 ∈ V)
7		ssexg 5284	. . . . . . 7 ⊢ ((𝑌 ⊆ 𝒫 𝑋 ∧ 𝒫 𝑋 ∈ V) → 𝑌 ∈ V)
8	2, 6, 7	syl2anc 596	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ V)
9		elpwg 4562	. . . . . 6 ⊢ (𝑌 ∈ V → (𝑌 ∈ 𝒫 𝒫 𝑋 ↔ 𝑌 ⊆ 𝒫 𝑋))
10	8, 9	syl 18	. . . . 5 ⊢ (𝜑 → (𝑌 ∈ 𝒫 𝒫 𝑋 ↔ 𝑌 ⊆ 𝒫 𝑋))
11	2, 10	mpbird 260	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝒫 𝒫 𝑋)
12		omedm 47648	. . . . . . 7 ⊢ (𝑂 ∈ OutMeas → dom 𝑂 = 𝒫 ∪ dom 𝑂)
13	3, 12	syl 18	. . . . . 6 ⊢ (𝜑 → dom 𝑂 = 𝒫 ∪ dom 𝑂)
14	4	pweqi 4575	. . . . . . . 8 ⊢ 𝒫 𝑋 = 𝒫 ∪ dom 𝑂
15	14	eqcomi 2772	. . . . . . 7 ⊢ 𝒫 ∪ dom 𝑂 = 𝒫 𝑋
16	15	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
17	13, 16	eqtr2d 2799	. . . . 5 ⊢ (𝜑 → 𝒫 𝑋 = dom 𝑂)
18	17	pweqd 4576	. . . 4 ⊢ (𝜑 → 𝒫 𝒫 𝑋 = 𝒫 dom 𝑂)
19	11, 18	eleqtrd 2865	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝒫 dom 𝑂)
20		isome 47643	. . . . . 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 5108	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦 ≼ ω ↔ 𝑌 ≼ ω))
25		unieq 4880	. . . . . . 7 ⊢ (𝑦 = 𝑌 → ∪ 𝑦 = ∪ 𝑌)
26	25	fveq2d 6897	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑂‘∪ 𝑦) = (𝑂‘∪ 𝑌))
27		reseq2 5969	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑂 ↾ 𝑦) = (𝑂 ↾ 𝑌))
28	27	fveq2d 6897	. . . . . 6 ⊢ (𝑦 = 𝑌 → (Σ^‘(𝑂 ↾ 𝑦)) = (Σ^‘(𝑂 ↾ 𝑌)))
29	26, 28	breq12d 5118	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)) ↔ (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌))))
30	24, 29	imbi12d 347	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))) ↔ (𝑌 ≼ ω → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌)))))
31	30	rspcva 3577	. . 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 1569   ∈ wcel 2146  ∀wral 3079  Vcvv 3453   ⊆ wss 3899  ∅c0 4280  𝒫 cpw 4559  ∪ cuni 4869   class class class wbr 5105  dom cdm 5654   ↾ cres 5656  ⟶wf 6542  ‘cfv 6546  (class class class)co 7427  ωcom 7884   ≼ cdom 8982  0cc0 11210  +∞cpnf 11350   ≤ cle 11354  [,]cicc 13489  Σ^{^}csumge0 47511  OutMeascome 47638

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fv 6554  df-ome 47639

This theorem is used by:  omeunle  47665  omeiunle  47666