Theorem subsaliuncllem 46931

Description: A subspace sigma-algebra is closed under countable union. This is Lemma 121A (iii) of [Fremlin1] p. 35. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
subsaliuncllem.f	⊢ Ⅎ𝑦𝜑
subsaliuncllem.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
subsaliuncllem.g	⊢ 𝐺 = (𝑛 ∈ ℕ ↦ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
subsaliuncllem.e	⊢ 𝐸 = (𝐻 ∘ 𝐺)
subsaliuncllem.h	⊢ (𝜑 → 𝐻 Fn ran 𝐺)
subsaliuncllem.y	⊢ (𝜑 → ∀𝑦 ∈ ran 𝐺(𝐻‘𝑦) ∈ 𝑦)

Assertion

Ref	Expression
subsaliuncllem	⊢ (𝜑 → ∃𝑒 ∈ (𝑆 ↑m ℕ)∀𝑛 ∈ ℕ (𝐹‘𝑛) = ((𝑒‘𝑛) ∩ 𝐷))

Distinct variable groups:   𝐷,𝑒   𝑥,𝐷   𝑒,𝐸,𝑛   𝑥,𝐸,𝑛   𝑒,𝐹   𝑥,𝐹   𝑦,𝐺   𝑦,𝐻   𝑆,𝑒,𝑛   𝑥,𝑆   𝑦,𝑆,𝑛   𝜑,𝑛

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑒)   𝐷(𝑦,𝑛)   𝐸(𝑦)   𝐹(𝑦,𝑛)   𝐺(𝑥,𝑒,𝑛)   𝐻(𝑥,𝑒,𝑛)   𝑉(𝑥,𝑦,𝑒,𝑛)

Proof of Theorem subsaliuncllem

Step	Hyp	Ref	Expression
1		subsaliuncllem.e	. . 3 ⊢ 𝐸 = (𝐻 ∘ 𝐺)
2		subsaliuncllem.h	. . . . . . 7 ⊢ (𝜑 → 𝐻 Fn ran 𝐺)
3		subsaliuncllem.f	. . . . . . . 8 ⊢ Ⅎ𝑦𝜑
4		vex 3458	. . . . . . . . . . . . . 14 ⊢ 𝑦 ∈ V
5		subsaliuncllem.g	. . . . . . . . . . . . . . 15 ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
6	5	elrnmpt 5934	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ V → (𝑦 ∈ ran 𝐺 ↔ ∃𝑛 ∈ ℕ 𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)}))
7	4, 6	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ran 𝐺 ↔ ∃𝑛 ∈ ℕ 𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
8	7	biimpi 218	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ran 𝐺 → ∃𝑛 ∈ ℕ 𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
9		id 22	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} → 𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
10		ssrab2 4033	. . . . . . . . . . . . . . . . 17 ⊢ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ⊆ 𝑆
11	10	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} → {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ⊆ 𝑆)
12	9, 11	eqsstrd 3970	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} → 𝑦 ⊆ 𝑆)
13	12	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℕ → (𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} → 𝑦 ⊆ 𝑆))
14	13	rexlimiv 3156	. . . . . . . . . . . . 13 ⊢ (∃𝑛 ∈ ℕ 𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} → 𝑦 ⊆ 𝑆)
15	14	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ran 𝐺 → (∃𝑛 ∈ ℕ 𝑦 = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} → 𝑦 ⊆ 𝑆))
16	8, 15	mpd 15	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ran 𝐺 → 𝑦 ⊆ 𝑆)
17	16	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝐺) → 𝑦 ⊆ 𝑆)
18		subsaliuncllem.y	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑦 ∈ ran 𝐺(𝐻‘𝑦) ∈ 𝑦)
19	18	r19.21bi 3254	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝐺) → (𝐻‘𝑦) ∈ 𝑦)
20	17, 19	sseldd 3937	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ran 𝐺) → (𝐻‘𝑦) ∈ 𝑆)
21	20	ex 416	. . . . . . . 8 ⊢ (𝜑 → (𝑦 ∈ ran 𝐺 → (𝐻‘𝑦) ∈ 𝑆))
22	3, 21	ralrimi 3260	. . . . . . 7 ⊢ (𝜑 → ∀𝑦 ∈ ran 𝐺(𝐻‘𝑦) ∈ 𝑆)
23	2, 22	jca 519	. . . . . 6 ⊢ (𝜑 → (𝐻 Fn ran 𝐺 ∧ ∀𝑦 ∈ ran 𝐺(𝐻‘𝑦) ∈ 𝑆))
24		ffnfv 7100	. . . . . 6 ⊢ (𝐻:ran 𝐺⟶𝑆 ↔ (𝐻 Fn ran 𝐺 ∧ ∀𝑦 ∈ ran 𝐺(𝐻‘𝑦) ∈ 𝑆))
25	23, 24	sylibr 236	. . . . 5 ⊢ (𝜑 → 𝐻:ran 𝐺⟶𝑆)
26		eqid 2762	. . . . . . . . 9 ⊢ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)}
27		subsaliuncllem.s	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
28	26, 27	rabexd 5296	. . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ∈ V)
29	28	ralrimivw 3158	. . . . . . 7 ⊢ (𝜑 → ∀𝑛 ∈ ℕ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ∈ V)
30	5	fnmpt 6661	. . . . . . 7 ⊢ (∀𝑛 ∈ ℕ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ∈ V → 𝐺 Fn ℕ)
31	29, 30	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐺 Fn ℕ)
32		dffn3 6704	. . . . . 6 ⊢ (𝐺 Fn ℕ ↔ 𝐺:ℕ⟶ran 𝐺)
33	31, 32	sylib 220	. . . . 5 ⊢ (𝜑 → 𝐺:ℕ⟶ran 𝐺)
34		fco 6716	. . . . 5 ⊢ ((𝐻:ran 𝐺⟶𝑆 ∧ 𝐺:ℕ⟶ran 𝐺) → (𝐻 ∘ 𝐺):ℕ⟶𝑆)
35	25, 33, 34	syl2anc 593	. . . 4 ⊢ (𝜑 → (𝐻 ∘ 𝐺):ℕ⟶𝑆)
36		nnex 12216	. . . . . 6 ⊢ ℕ ∈ V
37	36	a1i 11	. . . . 5 ⊢ (𝜑 → ℕ ∈ V)
38	27, 37	elmapd 8821	. . . 4 ⊢ (𝜑 → ((𝐻 ∘ 𝐺) ∈ (𝑆 ↑m ℕ) ↔ (𝐻 ∘ 𝐺):ℕ⟶𝑆))
39	35, 38	mpbird 259	. . 3 ⊢ (𝜑 → (𝐻 ∘ 𝐺) ∈ (𝑆 ↑m ℕ))
40	1, 39	eqeltrid 2866	. 2 ⊢ (𝜑 → 𝐸 ∈ (𝑆 ↑m ℕ))
41	33	ffvelcdmda 7065	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘𝑛) ∈ ran 𝐺)
42	18	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∀𝑦 ∈ ran 𝐺(𝐻‘𝑦) ∈ 𝑦)
43		fveq2 6867	. . . . . . . . 9 ⊢ (𝑦 = (𝐺‘𝑛) → (𝐻‘𝑦) = (𝐻‘(𝐺‘𝑛)))
44		id 22	. . . . . . . . 9 ⊢ (𝑦 = (𝐺‘𝑛) → 𝑦 = (𝐺‘𝑛))
45	43, 44	eleq12d 2856	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑛) → ((𝐻‘𝑦) ∈ 𝑦 ↔ (𝐻‘(𝐺‘𝑛)) ∈ (𝐺‘𝑛)))
46	45	rspcva 3579	. . . . . . 7 ⊢ (((𝐺‘𝑛) ∈ ran 𝐺 ∧ ∀𝑦 ∈ ran 𝐺(𝐻‘𝑦) ∈ 𝑦) → (𝐻‘(𝐺‘𝑛)) ∈ (𝐺‘𝑛))
47	41, 42, 46	syl2anc 593	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘(𝐺‘𝑛)) ∈ (𝐺‘𝑛))
48	33	ffund 6696	. . . . . . . . 9 ⊢ (𝜑 → Fun 𝐺)
49	48	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → Fun 𝐺)
50		simpr 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
51	5	dmeqi 5880	. . . . . . . . . . . . 13 ⊢ dom 𝐺 = dom (𝑛 ∈ ℕ ↦ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
52	51	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → dom 𝐺 = dom (𝑛 ∈ ℕ ↦ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)}))
53		dmmptg 6229	. . . . . . . . . . . . 13 ⊢ (∀𝑛 ∈ ℕ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ∈ V → dom (𝑛 ∈ ℕ ↦ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)}) = ℕ)
54	29, 53	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → dom (𝑛 ∈ ℕ ↦ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)}) = ℕ)
55	52, 54	eqtrd 2797	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐺 = ℕ)
56	55	eqcomd 2768	. . . . . . . . . 10 ⊢ (𝜑 → ℕ = dom 𝐺)
57	56	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ℕ = dom 𝐺)
58	50, 57	eleqtrd 2864	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ dom 𝐺)
59	49, 58, 1	fvcod 6966	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐸‘𝑛) = (𝐻‘(𝐺‘𝑛)))
60	5	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 = (𝑛 ∈ ℕ ↦ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)}))
61	28	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ∈ V)
62	60, 61	fvmpt2d 6989	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘𝑛) = {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
63	62	eqcomd 2768	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} = (𝐺‘𝑛))
64	59, 63	eleq12d 2856	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐸‘𝑛) ∈ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ↔ (𝐻‘(𝐺‘𝑛)) ∈ (𝐺‘𝑛)))
65	47, 64	mpbird 259	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐸‘𝑛) ∈ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)})
66		ineq1 4165	. . . . . . 7 ⊢ (𝑥 = (𝐸‘𝑛) → (𝑥 ∩ 𝐷) = ((𝐸‘𝑛) ∩ 𝐷))
67	66	eqeq2d 2773	. . . . . 6 ⊢ (𝑥 = (𝐸‘𝑛) → ((𝐹‘𝑛) = (𝑥 ∩ 𝐷) ↔ (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷)))
68	67	elrab 3650	. . . . 5 ⊢ ((𝐸‘𝑛) ∈ {𝑥 ∈ 𝑆 ∣ (𝐹‘𝑛) = (𝑥 ∩ 𝐷)} ↔ ((𝐸‘𝑛) ∈ 𝑆 ∧ (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷)))
69	65, 68	sylib 220	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐸‘𝑛) ∈ 𝑆 ∧ (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷)))
70	69	simprd 499	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷))
71	70	ralrimiva 3154	. 2 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷))
72		fveq1 6866	. . . . . 6 ⊢ (𝑒 = 𝐸 → (𝑒‘𝑛) = (𝐸‘𝑛))
73	72	ineq1d 4171	. . . . 5 ⊢ (𝑒 = 𝐸 → ((𝑒‘𝑛) ∩ 𝐷) = ((𝐸‘𝑛) ∩ 𝐷))
74	73	eqeq2d 2773	. . . 4 ⊢ (𝑒 = 𝐸 → ((𝐹‘𝑛) = ((𝑒‘𝑛) ∩ 𝐷) ↔ (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷)))
75	74	ralbidv 3185	. . 3 ⊢ (𝑒 = 𝐸 → (∀𝑛 ∈ ℕ (𝐹‘𝑛) = ((𝑒‘𝑛) ∩ 𝐷) ↔ ∀𝑛 ∈ ℕ (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷)))
76	75	rspcev 3581	. 2 ⊢ ((𝐸 ∈ (𝑆 ↑m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐹‘𝑛) = ((𝐸‘𝑛) ∩ 𝐷)) → ∃𝑒 ∈ (𝑆 ↑m ℕ)∀𝑛 ∈ ℕ (𝐹‘𝑛) = ((𝑒‘𝑛) ∩ 𝐷))
77	40, 71, 76	syl2anc 593	1 ⊢ (𝜑 → ∃𝑒 ∈ (𝑆 ↑m ℕ)∀𝑛 ∈ ℕ (𝐹‘𝑛) = ((𝑒‘𝑛) ∩ 𝐷))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1560  Ⅎwnf 1803   ∈ wcel 2142  ∀wral 3076  ∃wrex 3086  {crab 3414  Vcvv 3454   ∩ cin 3903   ⊆ wss 3904   ↦ cmpt 5181  dom cdm 5647  ran crn 5648   ∘ ccom 5651  Fun wfun 6515   Fn wfn 6516  ⟶wf 6517  ‘cfv 6521  (class class class)co 7396   ↑_m cmap 8808  ℕcn 12210

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-1cn 11131  ax-addcl 11133

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-map 8810  df-nn 12211

This theorem is referenced by:  subsaliuncl  46932