smfsupdmmbllem - Mathbox for Glauco Siliprandi

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

Theorem smfsupdmmbllem 47379

Description: If a countable set of sigma-measurable functions have domains in the sigma-algebra, then their supremum function has the domain in the sigma-algebra. This is the fourth statement of Proposition 121H of [Fremlin1] p. 39 . (Contributed by Glauco Siliprandi, 24-Jan-2025.)

**Hypotheses**
Ref	Expression
smfsupdmmbllem.1	⊢ Ⅎ𝑛𝜑
smfsupdmmbllem.2	⊢ Ⅎ𝑥𝜑
smfsupdmmbllem.3	⊢ Ⅎ𝑚𝜑
smfsupdmmbllem.4	⊢ Ⅎ𝑥𝐹
smfsupdmmbllem.5	⊢ (𝜑 → 𝑀 ∈ ℤ)
smfsupdmmbllem.6	⊢ 𝑍 = (ℤ_≥‘𝑀)
smfsupdmmbllem.7	⊢ (𝜑 → 𝑆 ∈ SAlg)
smfsupdmmbllem.8	⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
smfsupdmmbllem.9	⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → dom (𝐹‘𝑛) ∈ 𝑆)
smfsupdmmbllem.10	⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 ((𝐹‘𝑛)‘𝑥) ≤ 𝑦}
smfsupdmmbllem.11	⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}))
smfsupdmmbllem.12	⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ))

**Assertion**
Ref	Expression
smfsupdmmbllem	⊢ (𝜑 → dom 𝐺 ∈ 𝑆)

Distinct variable groups: 𝐷,𝑚 𝑚,𝐹,𝑦 𝑦,𝐻 𝑆,𝑚,𝑛 𝑚,𝑍,𝑛,𝑥,𝑦 𝜑,𝑦 Allowed substitution hints: 𝜑(𝑥,𝑚,𝑛) 𝐷(𝑥,𝑦,𝑛) 𝑆(𝑥,𝑦) 𝐹(𝑥,𝑛) 𝐺(𝑥,𝑦,𝑚,𝑛) 𝐻(𝑥,𝑚,𝑛) 𝑀(𝑥,𝑦,𝑚,𝑛)

**Proof of Theorem smfsupdmmbllem**
Step	Hyp	Ref	Expression
1		smfsupdmmbllem.1	. . 3 ⊢ Ⅎ𝑛𝜑
2		smfsupdmmbllem.2	. . 3 ⊢ Ⅎ𝑥𝜑
3		smfsupdmmbllem.3	. . 3 ⊢ Ⅎ𝑚𝜑
4		smfsupdmmbllem.4	. . 3 ⊢ Ⅎ𝑥𝐹
5		smfsupdmmbllem.7	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ SAlg)
6	5	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑆 ∈ SAlg)
7		smfsupdmmbllem.8	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
8	7	ffvelcdmda 7060	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ (SMblFn‘𝑆))
9		eqid 2761	. . . . 5 ⊢ dom (𝐹‘𝑛) = dom (𝐹‘𝑛)
10	6, 8, 9	smff 47267	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ)
11	10	frexr 45921	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ^*)
12		smfsupdmmbllem.10	. . 3 ⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 ((𝐹‘𝑛)‘𝑥) ≤ 𝑦}
13		smfsupdmmbllem.12	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ))
14		smfsupdmmbllem.11	. . 3 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}))
15	1, 2, 3, 4, 11, 12, 13, 14	fsupdm2 47378	. 2 ⊢ (𝜑 → dom 𝐺 = ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚))
16		nfcv 2923	. . 3 ⊢ Ⅎ𝑚𝑆
17		nfcv 2923	. . 3 ⊢ Ⅎ𝑚ℕ
18		nnct 13988	. . . 4 ⊢ ℕ ≼ ω
19	18	a1i 11	. . 3 ⊢ (𝜑 → ℕ ≼ ω)
20		nfv 1933	. . . . 5 ⊢ Ⅎ𝑛 𝑚 ∈ ℕ
21	1, 20	nfan 1918	. . . 4 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑚 ∈ ℕ)
22		nfcv 2923	. . . 4 ⊢ Ⅎ𝑛𝑆
23		nfcv 2923	. . . 4 ⊢ Ⅎ𝑛𝑍
24	5	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → 𝑆 ∈ SAlg)
25		smfsupdmmbllem.6	. . . . . 6 ⊢ 𝑍 = (ℤ_≥‘𝑀)
26	25	uzct 45604	. . . . 5 ⊢ 𝑍 ≼ ω
27	26	a1i 11	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → 𝑍 ≼ ω)
28		smfsupdmmbllem.5	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
29	28, 25	uzn0d 45960	. . . . 5 ⊢ (𝜑 → 𝑍 ≠ ∅)
30	29	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → 𝑍 ≠ ∅)
31	24	adantr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → 𝑆 ∈ SAlg)
32		smfsupdmmbllem.9	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → dom (𝐹‘𝑛) ∈ 𝑆)
33	32	adantlr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → dom (𝐹‘𝑛) ∈ 𝑆)
34	31, 33	salrestss 46896	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → (𝑆 ↾_t dom (𝐹‘𝑛)) ⊆ 𝑆)
35		nfv 1933	. . . . . . . . . 10 ⊢ Ⅎ𝑚 𝑛 ∈ 𝑍
36	3, 35	nfan 1918	. . . . . . . . 9 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ 𝑍)
37		nfcv 2923	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑛
38	4, 37	nffv 6872	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝐹‘𝑛)
39	8	adantlr 725	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ (SMblFn‘𝑆))
40		nnxr 45815	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℝ^*)
41	40	ad2antlr 737	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → 𝑚 ∈ ℝ^*)
42	38, 31, 39, 9, 41	smfpimltxr 47282	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚} ∈ (𝑆 ↾_t dom (𝐹‘𝑛)))
43	42	an32s 662	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ ℕ) → {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚} ∈ (𝑆 ↾_t dom (𝐹‘𝑛)))
44	36, 43	fmptd2f 45771	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}):ℕ⟶(𝑆 ↾_t dom (𝐹‘𝑛)))
45		simpr 488	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
46		nnex 12210	. . . . . . . . . . 11 ⊢ ℕ ∈ V
47	46	mptex 7202	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}) ∈ V
48	14	fvmpt2 6982	. . . . . . . . . 10 ⊢ ((𝑛 ∈ 𝑍 ∧ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}) ∈ V) → (𝐻‘𝑛) = (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}))
49	45, 47, 48	sylancl 595	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐻‘𝑛) = (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}))
50	49	feq1d 6668	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝐻‘𝑛):ℕ⟶(𝑆 ↾_t dom (𝐹‘𝑛)) ↔ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚}):ℕ⟶(𝑆 ↾_t dom (𝐹‘𝑛))))
51	44, 50	mpbird 259	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐻‘𝑛):ℕ⟶(𝑆 ↾_t dom (𝐹‘𝑛)))
52	51	adantlr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → (𝐻‘𝑛):ℕ⟶(𝑆 ↾_t dom (𝐹‘𝑛)))
53		simplr 778	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → 𝑚 ∈ ℕ)
54	52, 53	ffvelcdmd 7061	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → ((𝐻‘𝑛)‘𝑚) ∈ (𝑆 ↾_t dom (𝐹‘𝑛)))
55	34, 54	sseldd 3935	. . . 4 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑛 ∈ 𝑍) → ((𝐻‘𝑛)‘𝑚) ∈ 𝑆)
56	21, 22, 23, 24, 27, 30, 55	saliinclf 46861	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ∈ 𝑆)
57	3, 16, 17, 5, 19, 56	saliunclf 46857	. 2 ⊢ (𝜑 → ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚) ∈ 𝑆)
58	15, 57	eqeltrd 2861	1 ⊢ (𝜑 → dom 𝐺 ∈ 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 Ⅎwnf 1802 ∈ wcel 2141 Ⅎwnfc 2908 ≠ wne 2956 ∀wral 3075 ∃wrex 3085 {crab 3413 Vcvv 3453 ∅c0 4283 ∪ ciun 4946 ∩ ciin 4947 class class class wbr 5097 ↦ cmpt 5178 dom cdm 5643 ran crn 5644 ⟶wf 6512 ‘cfv 6516 (class class class)co 7391 ωcom 7841 ≼ cdom 8919 supcsup 9380 ℝcr 11066 ℝ^*cxr 11209 < clt 11210 ≤ cle 11211 ℕcn 12204 ℤcz 12562 ℤ_≥cuz 12833 ↾_t crest 17440 SAlgcsalg 46843 SMblFncsmblfn 47230

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-inf2 9590 ax-cc 10386 ax-ac2 10414 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-se 5597 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-isom 6525 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-2o 8432 df-oadd 8435 df-omul 8436 df-er 8672 df-map 8804 df-pm 8805 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-oi 9452 df-card 9891 df-acn 9894 df-ac 10066 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-n0 12476 df-z 12563 df-uz 12834 df-ioo 13347 df-ico 13349 df-rest 17442 df-salg 46844 df-smblfn 47231

This theorem is referenced by: smfsupdmmbl 47380

W3C validator