Theorem omeunile 46503

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 45044	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ V)
6	5	pwexd 5334	. . . . . . 7 ⊢ (𝜑 → 𝒫 𝑋 ∈ V)
7		ssexg 5278	. . . . . . 7 ⊢ ((𝑌 ⊆ 𝒫 𝑋 ∧ 𝒫 𝑋 ∈ V) → 𝑌 ∈ V)
8	2, 6, 7	syl2anc 584	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ V)
9		elpwg 4566	. . . . . 6 ⊢ (𝑌 ∈ V → (𝑌 ∈ 𝒫 𝒫 𝑋 ↔ 𝑌 ⊆ 𝒫 𝑋))
10	8, 9	syl 17	. . . . 5 ⊢ (𝜑 → (𝑌 ∈ 𝒫 𝒫 𝑋 ↔ 𝑌 ⊆ 𝒫 𝑋))
11	2, 10	mpbird 257	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝒫 𝒫 𝑋)
12		omedm 46497	. . . . . . 7 ⊢ (𝑂 ∈ OutMeas → dom 𝑂 = 𝒫 ∪ dom 𝑂)
13	3, 12	syl 17	. . . . . 6 ⊢ (𝜑 → dom 𝑂 = 𝒫 ∪ dom 𝑂)
14	4	pweqi 4579	. . . . . . . 8 ⊢ 𝒫 𝑋 = 𝒫 ∪ dom 𝑂
15	14	eqcomi 2738	. . . . . . 7 ⊢ 𝒫 ∪ dom 𝑂 = 𝒫 𝑋
16	15	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
17	13, 16	eqtr2d 2765	. . . . 5 ⊢ (𝜑 → 𝒫 𝑋 = dom 𝑂)
18	17	pweqd 4580	. . . 4 ⊢ (𝜑 → 𝒫 𝒫 𝑋 = 𝒫 dom 𝑂)
19	11, 18	eleqtrd 2830	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝒫 dom 𝑂)
20		isome 46492	. . . . . 6 ⊢ (𝑂 ∈ OutMeas → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑥 ∈ 𝒫 𝑦(𝑂‘𝑥) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))
21	3, 20	syl 17	. . . . 5 ⊢ (𝜑 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑥 ∈ 𝒫 𝑦(𝑂‘𝑥) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))
22	3, 21	mpbid 232	. . . 4 ⊢ (𝜑 → ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑥 ∈ 𝒫 𝑦(𝑂‘𝑥) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)))))
23	22	simprd 495	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))
24		breq1 5110	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦 ≼ ω ↔ 𝑌 ≼ ω))
25		unieq 4882	. . . . . . 7 ⊢ (𝑦 = 𝑌 → ∪ 𝑦 = ∪ 𝑌)
26	25	fveq2d 6862	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑂‘∪ 𝑦) = (𝑂‘∪ 𝑌))
27		reseq2 5945	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑂 ↾ 𝑦) = (𝑂 ↾ 𝑌))
28	27	fveq2d 6862	. . . . . 6 ⊢ (𝑦 = 𝑌 → (Σ^‘(𝑂 ↾ 𝑦)) = (Σ^‘(𝑂 ↾ 𝑌)))
29	26, 28	breq12d 5120	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)) ↔ (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌))))
30	24, 29	imbi12d 344	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))) ↔ (𝑌 ≼ ω → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌)))))
31	30	rspcva 3586	. . 3 ⊢ ((𝑌 ∈ 𝒫 dom 𝑂 ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)))) → (𝑌 ≼ ω → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌))))
32	19, 23, 31	syl2anc 584	. 2 ⊢ (𝜑 → (𝑌 ≼ ω → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌))))
33	1, 32	mpd 15	1 ⊢ (𝜑 → (𝑂‘∪ 𝑌) ≤ (Σ^‘(𝑂 ↾ 𝑌)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  Vcvv 3447   ⊆ wss 3914  ∅c0 4296  𝒫 cpw 4563  ∪ cuni 4871   class class class wbr 5107  dom cdm 5638   ↾ cres 5640  ⟶wf 6507  ‘cfv 6511  (class class class)co 7387  ωcom 7842   ≼ cdom 8916  0cc0 11068  +∞cpnf 11205   ≤ cle 11209  [,]cicc 13309  Σ^{^}csumge0 46360  OutMeascome 46487

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-ome 46488

This theorem is referenced by:  omeunle  46514  omeiunle  46515