omeiunle - Mathbox for Glauco Siliprandi

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

Theorem omeiunle 45531

Description: The outer measure of the indexed 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
omeiunle.nph	⊢ Ⅎ𝑛𝜑
omeiunle.ne	⊢ Ⅎ𝑛𝐸
omeiunle.o	⊢ (𝜑 → 𝑂 ∈ OutMeas)
omeiunle.x	⊢ 𝑋 = ∪ dom 𝑂
omeiunle.z	⊢ 𝑍 = (ℤ_≥‘𝑁)
omeiunle.e	⊢ (𝜑 → 𝐸:𝑍⟶𝒫 𝑋)

**Assertion**
Ref	Expression
omeiunle	⊢ (𝜑 → (𝑂‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ≤ (Σ^{^}‘(𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛)))))

Distinct variable groups: 𝑛,𝑂 𝑛,𝑋 𝑛,𝑍 Allowed substitution hints: 𝜑(𝑛) 𝐸(𝑛) 𝑁(𝑛)

Proof of Theorem omeiunle Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iccssxr 13411	. . 3 ⊢ (0[,]+∞) ⊆ ℝ^*
2		omeiunle.o	. . . 4 ⊢ (𝜑 → 𝑂 ∈ OutMeas)
3		omeiunle.x	. . . 4 ⊢ 𝑋 = ∪ dom 𝑂
4		omeiunle.nph	. . . . . 6 ⊢ Ⅎ𝑛𝜑
5		omeiunle.e	. . . . . . . . 9 ⊢ (𝜑 → 𝐸:𝑍⟶𝒫 𝑋)
6	5	ffvelcdmda 7085	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ∈ 𝒫 𝑋)
7		elpwi 4608	. . . . . . . 8 ⊢ ((𝐸‘𝑛) ∈ 𝒫 𝑋 → (𝐸‘𝑛) ⊆ 𝑋)
8	6, 7	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ 𝑋)
9	8	ex 411	. . . . . 6 ⊢ (𝜑 → (𝑛 ∈ 𝑍 → (𝐸‘𝑛) ⊆ 𝑋))
10	4, 9	ralrimi 3252	. . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 (𝐸‘𝑛) ⊆ 𝑋)
11		iunss 5047	. . . . 5 ⊢ (∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) ⊆ 𝑋 ↔ ∀𝑛 ∈ 𝑍 (𝐸‘𝑛) ⊆ 𝑋)
12	10, 11	sylibr 233	. . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) ⊆ 𝑋)
13	2, 3, 12	omecl 45517	. . 3 ⊢ (𝜑 → (𝑂‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ∈ (0[,]+∞))
14	1, 13	sselid 3979	. 2 ⊢ (𝜑 → (𝑂‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ∈ ℝ^*)
15	5	ffnd 6717	. . . . 5 ⊢ (𝜑 → 𝐸 Fn 𝑍)
16		omeiunle.z	. . . . . . 7 ⊢ 𝑍 = (ℤ_≥‘𝑁)
17	16	fvexi 6904	. . . . . 6 ⊢ 𝑍 ∈ V
18	17	a1i 11	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ V)
19		fnex 7220	. . . . 5 ⊢ ((𝐸 Fn 𝑍 ∧ 𝑍 ∈ V) → 𝐸 ∈ V)
20	15, 18, 19	syl2anc 582	. . . 4 ⊢ (𝜑 → 𝐸 ∈ V)
21		rnexg 7897	. . . 4 ⊢ (𝐸 ∈ V → ran 𝐸 ∈ V)
22	20, 21	syl 17	. . 3 ⊢ (𝜑 → ran 𝐸 ∈ V)
23	2, 3	omef 45510	. . . 4 ⊢ (𝜑 → 𝑂:𝒫 𝑋⟶(0[,]+∞))
24	5	frnd 6724	. . . 4 ⊢ (𝜑 → ran 𝐸 ⊆ 𝒫 𝑋)
25	23, 24	fssresd 6757	. . 3 ⊢ (𝜑 → (𝑂 ↾ ran 𝐸):ran 𝐸⟶(0[,]+∞))
26	22, 25	sge0xrcl 45399	. 2 ⊢ (𝜑 → (Σ^{^}‘(𝑂 ↾ ran 𝐸)) ∈ ℝ^*)
27	2	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑂 ∈ OutMeas)
28	27, 3, 8	omecl 45517	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑂‘(𝐸‘𝑛)) ∈ (0[,]+∞))
29		eqid 2730	. . . 4 ⊢ (𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛))) = (𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛)))
30	4, 28, 29	fmptdf 7117	. . 3 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛))):𝑍⟶(0[,]+∞))
31	18, 30	sge0xrcl 45399	. 2 ⊢ (𝜑 → (Σ^{^}‘(𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛)))) ∈ ℝ^*)
32		fvex 6903	. . . . . . . 8 ⊢ (𝐸‘𝑛) ∈ V
33	32	rgenw 3063	. . . . . . 7 ⊢ ∀𝑛 ∈ 𝑍 (𝐸‘𝑛) ∈ V
34		dfiun3g 5962	. . . . . . 7 ⊢ (∀𝑛 ∈ 𝑍 (𝐸‘𝑛) ∈ V → ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) = ∪ ran (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛)))
35	33, 34	ax-mp 5	. . . . . 6 ⊢ ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) = ∪ ran (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛))
36	35	a1i 11	. . . . 5 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) = ∪ ran (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛)))
37	5	feqmptd 6959	. . . . . . . 8 ⊢ (𝜑 → 𝐸 = (𝑚 ∈ 𝑍 ↦ (𝐸‘𝑚)))
38		omeiunle.ne	. . . . . . . . . . 11 ⊢ Ⅎ𝑛𝐸
39		nfcv 2901	. . . . . . . . . . 11 ⊢ Ⅎ𝑛𝑚
40	38, 39	nffv 6900	. . . . . . . . . 10 ⊢ Ⅎ𝑛(𝐸‘𝑚)
41		nfcv 2901	. . . . . . . . . 10 ⊢ Ⅎ𝑚(𝐸‘𝑛)
42		fveq2 6890	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → (𝐸‘𝑚) = (𝐸‘𝑛))
43	40, 41, 42	cbvmpt 5258	. . . . . . . . 9 ⊢ (𝑚 ∈ 𝑍 ↦ (𝐸‘𝑚)) = (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛))
44	43	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (𝐸‘𝑚)) = (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛)))
45	37, 44	eqtrd 2770	. . . . . . 7 ⊢ (𝜑 → 𝐸 = (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛)))
46	45	rneqd 5936	. . . . . 6 ⊢ (𝜑 → ran 𝐸 = ran (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛)))
47	46	unieqd 4921	. . . . 5 ⊢ (𝜑 → ∪ ran 𝐸 = ∪ ran (𝑛 ∈ 𝑍 ↦ (𝐸‘𝑛)))
48	36, 47	eqtr4d 2773	. . . 4 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) = ∪ ran 𝐸)
49	48	fveq2d 6894	. . 3 ⊢ (𝜑 → (𝑂‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) = (𝑂‘∪ ran 𝐸))
50		fnrndomg 10533	. . . . . 6 ⊢ (𝑍 ∈ V → (𝐸 Fn 𝑍 → ran 𝐸 ≼ 𝑍))
51	18, 15, 50	sylc 65	. . . . 5 ⊢ (𝜑 → ran 𝐸 ≼ 𝑍)
52	16	uzct 44051	. . . . . 6 ⊢ 𝑍 ≼ ω
53	52	a1i 11	. . . . 5 ⊢ (𝜑 → 𝑍 ≼ ω)
54		domtr 9005	. . . . 5 ⊢ ((ran 𝐸 ≼ 𝑍 ∧ 𝑍 ≼ ω) → ran 𝐸 ≼ ω)
55	51, 53, 54	syl2anc 582	. . . 4 ⊢ (𝜑 → ran 𝐸 ≼ ω)
56	2, 3, 24, 55	omeunile 45519	. . 3 ⊢ (𝜑 → (𝑂‘∪ ran 𝐸) ≤ (Σ^{^}‘(𝑂 ↾ ran 𝐸)))
57	49, 56	eqbrtrd 5169	. 2 ⊢ (𝜑 → (𝑂‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ≤ (Σ^{^}‘(𝑂 ↾ ran 𝐸)))
58		ltweuz 13930	. . . . . 6 ⊢ < We (ℤ_≥‘𝑁)
59		weeq2 5664	. . . . . . 7 ⊢ (𝑍 = (ℤ_≥‘𝑁) → ( < We 𝑍 ↔ < We (ℤ_≥‘𝑁)))
60	16, 59	ax-mp 5	. . . . . 6 ⊢ ( < We 𝑍 ↔ < We (ℤ_≥‘𝑁))
61	58, 60	mpbir 230	. . . . 5 ⊢ < We 𝑍
62	61	a1i 11	. . . 4 ⊢ (𝜑 → < We 𝑍)
63	18, 23, 5, 62	sge0resrn 45418	. . 3 ⊢ (𝜑 → (Σ^{^}‘(𝑂 ↾ ran 𝐸)) ≤ (Σ^{^}‘(𝑂 ∘ 𝐸)))
64		fcompt 7132	. . . . . 6 ⊢ ((𝑂:𝒫 𝑋⟶(0[,]+∞) ∧ 𝐸:𝑍⟶𝒫 𝑋) → (𝑂 ∘ 𝐸) = (𝑚 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑚))))
65		nfcv 2901	. . . . . . . . 9 ⊢ Ⅎ𝑛𝑂
66	65, 40	nffv 6900	. . . . . . . 8 ⊢ Ⅎ𝑛(𝑂‘(𝐸‘𝑚))
67		nfcv 2901	. . . . . . . 8 ⊢ Ⅎ𝑚(𝑂‘(𝐸‘𝑛))
68		2fveq3 6895	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → (𝑂‘(𝐸‘𝑚)) = (𝑂‘(𝐸‘𝑛)))
69	66, 67, 68	cbvmpt 5258	. . . . . . 7 ⊢ (𝑚 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑚))) = (𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛)))
70	69	a1i 11	. . . . . 6 ⊢ ((𝑂:𝒫 𝑋⟶(0[,]+∞) ∧ 𝐸:𝑍⟶𝒫 𝑋) → (𝑚 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑚))) = (𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛))))
71	64, 70	eqtrd 2770	. . . . 5 ⊢ ((𝑂:𝒫 𝑋⟶(0[,]+∞) ∧ 𝐸:𝑍⟶𝒫 𝑋) → (𝑂 ∘ 𝐸) = (𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛))))
72	23, 5, 71	syl2anc 582	. . . 4 ⊢ (𝜑 → (𝑂 ∘ 𝐸) = (𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛))))
73	72	fveq2d 6894	. . 3 ⊢ (𝜑 → (Σ^{^}‘(𝑂 ∘ 𝐸)) = (Σ^{^}‘(𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛)))))
74	63, 73	breqtrd 5173	. 2 ⊢ (𝜑 → (Σ^{^}‘(𝑂 ↾ ran 𝐸)) ≤ (Σ^{^}‘(𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛)))))
75	14, 26, 31, 57, 74	xrletrd 13145	1 ⊢ (𝜑 → (𝑂‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) ≤ (Σ^{^}‘(𝑛 ∈ 𝑍 ↦ (𝑂‘(𝐸‘𝑛)))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1539 Ⅎwnf 1783 ∈ wcel 2104 Ⅎwnfc 2881 ∀wral 3059 Vcvv 3472 ⊆ wss 3947 𝒫 cpw 4601 ∪ cuni 4907 ∪ ciun 4996 class class class wbr 5147 ↦ cmpt 5230 We wwe 5629 dom cdm 5675 ran crn 5676 ↾ cres 5677 ∘ ccom 5679 Fn wfn 6537 ⟶wf 6538 ‘cfv 6542 (class class class)co 7411 ωcom 7857 ≼ cdom 8939 0cc0 11112 +∞cpnf 11249 ℝ^*cxr 11251 < clt 11252 ≤ cle 11253 ℤ_≥cuz 12826 [,]cicc 13331 Σ^{^}csumge0 45376 OutMeascome 45503

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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-inf2 9638 ax-ac2 10460 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-oadd 8472 df-omul 8473 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-oi 9507 df-card 9936 df-acn 9939 df-ac 10113 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-rp 12979 df-ico 13334 df-icc 13335 df-fz 13489 df-fzo 13632 df-seq 13971 df-exp 14032 df-hash 14295 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-clim 15436 df-sum 15637 df-sumge0 45377 df-ome 45504

This theorem is referenced by: omeiunltfirp 45533 omeiunlempt 45534 caratheodorylem2 45541

W3C validator