Theorem imambfm 31941

Description: If the sigma-algebra in the range of a given function is generated by a collection of basic sets 𝐾, then to check the measurability of that function, we need only consider inverse images of basic sets 𝑎. (Contributed by Thierry Arnoux, 4-Jun-2017.)

Hypotheses

Ref	Expression
imambfm.1	⊢ (𝜑 → 𝐾 ∈ V)
imambfm.2	⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
imambfm.3	⊢ (𝜑 → 𝑇 = (sigaGen‘𝐾))

Assertion

Ref	Expression
imambfm	⊢ (𝜑 → (𝐹 ∈ (𝑆MblFnM𝑇) ↔ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)))

Distinct variable groups:   𝐹,𝑎   𝐾,𝑎   𝑆,𝑎   𝑇,𝑎   𝜑,𝑎

Proof of Theorem imambfm

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imambfm.2	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
2	1	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝑆 ∈ ∪ ran sigAlgebra)
3		imambfm.3	. . . . . 6 ⊢ (𝜑 → 𝑇 = (sigaGen‘𝐾))
4		imambfm.1	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ V)
5	4	sgsiga 31822	. . . . . 6 ⊢ (𝜑 → (sigaGen‘𝐾) ∈ ∪ ran sigAlgebra)
6	3, 5	eqeltrd 2838	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ ∪ ran sigAlgebra)
7	6	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝑇 ∈ ∪ ran sigAlgebra)
8		simpr 488	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝐹 ∈ (𝑆MblFnM𝑇))
9	2, 7, 8	mbfmf 31934	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝐹:∪ 𝑆⟶∪ 𝑇)
10	1	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑆 ∈ ∪ ran sigAlgebra)
11	6	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑇 ∈ ∪ ran sigAlgebra)
12		simplr 769	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝐹 ∈ (𝑆MblFnM𝑇))
13		sssigagen 31825	. . . . . . . . 9 ⊢ (𝐾 ∈ V → 𝐾 ⊆ (sigaGen‘𝐾))
14	4, 13	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ⊆ (sigaGen‘𝐾))
15	14, 3	sseqtrrd 3942	. . . . . . 7 ⊢ (𝜑 → 𝐾 ⊆ 𝑇)
16	15	ad2antrr 726	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝐾 ⊆ 𝑇)
17		simpr 488	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑎 ∈ 𝐾)
18	16, 17	sseldd 3902	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑎 ∈ 𝑇)
19	10, 11, 12, 18	mbfmcnvima 31936	. . . 4 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → (◡𝐹 “ 𝑎) ∈ 𝑆)
20	19	ralrimiva 3105	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)
21	9, 20	jca 515	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆))
22		unielsiga 31808	. . . . . 6 ⊢ (𝑇 ∈ ∪ ran sigAlgebra → ∪ 𝑇 ∈ 𝑇)
23	6, 22	syl 17	. . . . 5 ⊢ (𝜑 → ∪ 𝑇 ∈ 𝑇)
24	23	adantr 484	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ∪ 𝑇 ∈ 𝑇)
25		unielsiga 31808	. . . . . 6 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → ∪ 𝑆 ∈ 𝑆)
26	1, 25	syl 17	. . . . 5 ⊢ (𝜑 → ∪ 𝑆 ∈ 𝑆)
27	26	adantr 484	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ∪ 𝑆 ∈ 𝑆)
28		simprl 771	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐹:∪ 𝑆⟶∪ 𝑇)
29		elmapg 8521	. . . . 5 ⊢ ((∪ 𝑇 ∈ 𝑇 ∧ ∪ 𝑆 ∈ 𝑆) → (𝐹 ∈ (∪ 𝑇 ↑m ∪ 𝑆) ↔ 𝐹:∪ 𝑆⟶∪ 𝑇))
30	29	biimpar 481	. . . 4 ⊢ (((∪ 𝑇 ∈ 𝑇 ∧ ∪ 𝑆 ∈ 𝑆) ∧ 𝐹:∪ 𝑆⟶∪ 𝑇) → 𝐹 ∈ (∪ 𝑇 ↑m ∪ 𝑆))
31	24, 27, 28, 30	syl21anc 838	. . 3 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐹 ∈ (∪ 𝑇 ↑m ∪ 𝑆))
32	3	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 = (sigaGen‘𝐾))
33		simpl 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝜑)
34		ssrab2 3993	. . . . . . . . . . 11 ⊢ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝑇
35		pwuni 4858	. . . . . . . . . . 11 ⊢ 𝑇 ⊆ 𝒫 ∪ 𝑇
36	34, 35	sstri 3910	. . . . . . . . . 10 ⊢ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇
37	36	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇)
38		fimacnv 6567	. . . . . . . . . . . . 13 ⊢ (𝐹:∪ 𝑆⟶∪ 𝑇 → (◡𝐹 “ ∪ 𝑇) = ∪ 𝑆)
39	38	ad2antrl 728	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → (◡𝐹 “ ∪ 𝑇) = ∪ 𝑆)
40	39, 27	eqeltrd 2838	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → (◡𝐹 “ ∪ 𝑇) ∈ 𝑆)
41		imaeq2 5925	. . . . . . . . . . . . 13 ⊢ (𝑎 = ∪ 𝑇 → (◡𝐹 “ 𝑎) = (◡𝐹 “ ∪ 𝑇))
42	41	eleq1d 2822	. . . . . . . . . . . 12 ⊢ (𝑎 = ∪ 𝑇 → ((◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (◡𝐹 “ ∪ 𝑇) ∈ 𝑆))
43	42	elrab 3602	. . . . . . . . . . 11 ⊢ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (∪ 𝑇 ∈ 𝑇 ∧ (◡𝐹 “ ∪ 𝑇) ∈ 𝑆))
44	24, 40, 43	sylanbrc 586	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
45	6	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑇 ∈ ∪ ran sigAlgebra)
46	45, 22	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → ∪ 𝑇 ∈ 𝑇)
47		elrabi 3596	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} → 𝑥 ∈ 𝑇)
48	47	adantl 485	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑥 ∈ 𝑇)
49		difelsiga 31813	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ ∪ ran sigAlgebra ∧ ∪ 𝑇 ∈ 𝑇 ∧ 𝑥 ∈ 𝑇) → (∪ 𝑇 ∖ 𝑥) ∈ 𝑇)
50	45, 46, 48, 49	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (∪ 𝑇 ∖ 𝑥) ∈ 𝑇)
51		simplrl 777	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝐹:∪ 𝑆⟶∪ 𝑇)
52		ffun 6548	. . . . . . . . . . . . . 14 ⊢ (𝐹:∪ 𝑆⟶∪ 𝑇 → Fun 𝐹)
53		difpreima 6885	. . . . . . . . . . . . . 14 ⊢ (Fun 𝐹 → (◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) = ((◡𝐹 “ ∪ 𝑇) ∖ (◡𝐹 “ 𝑥)))
54	51, 52, 53	3syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) = ((◡𝐹 “ ∪ 𝑇) ∖ (◡𝐹 “ 𝑥)))
55	39	difeq1d 4036	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ((◡𝐹 “ ∪ 𝑇) ∖ (◡𝐹 “ 𝑥)) = (∪ 𝑆 ∖ (◡𝐹 “ 𝑥)))
56	55	adantr 484	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → ((◡𝐹 “ ∪ 𝑇) ∖ (◡𝐹 “ 𝑥)) = (∪ 𝑆 ∖ (◡𝐹 “ 𝑥)))
57	1	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑆 ∈ ∪ ran sigAlgebra)
58	57, 25	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → ∪ 𝑆 ∈ 𝑆)
59		imaeq2 5925	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑥 → (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑥))
60	59	eleq1d 2822	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = 𝑥 → ((◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (◡𝐹 “ 𝑥) ∈ 𝑆))
61	60	elrab 3602	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (𝑥 ∈ 𝑇 ∧ (◡𝐹 “ 𝑥) ∈ 𝑆))
62	61	simprbi 500	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} → (◡𝐹 “ 𝑥) ∈ 𝑆)
63	62	adantl 485	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (◡𝐹 “ 𝑥) ∈ 𝑆)
64		difelsiga 31813	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ ∪ 𝑆 ∈ 𝑆 ∧ (◡𝐹 “ 𝑥) ∈ 𝑆) → (∪ 𝑆 ∖ (◡𝐹 “ 𝑥)) ∈ 𝑆)
65	57, 58, 63, 64	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (∪ 𝑆 ∖ (◡𝐹 “ 𝑥)) ∈ 𝑆)
66	56, 65	eqeltrd 2838	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → ((◡𝐹 “ ∪ 𝑇) ∖ (◡𝐹 “ 𝑥)) ∈ 𝑆)
67	54, 66	eqeltrd 2838	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) ∈ 𝑆)
68		imaeq2 5925	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (∪ 𝑇 ∖ 𝑥) → (◡𝐹 “ 𝑎) = (◡𝐹 “ (∪ 𝑇 ∖ 𝑥)))
69	68	eleq1d 2822	. . . . . . . . . . . . 13 ⊢ (𝑎 = (∪ 𝑇 ∖ 𝑥) → ((◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) ∈ 𝑆))
70	69	elrab 3602	. . . . . . . . . . . 12 ⊢ ((∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ↔ ((∪ 𝑇 ∖ 𝑥) ∈ 𝑇 ∧ (◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) ∈ 𝑆))
71	50, 67, 70	sylanbrc 586	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
72	71	ralrimiva 3105	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
73	6	ad3antrrr 730	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑇 ∈ ∪ ran sigAlgebra)
74	34	sspwi 4527	. . . . . . . . . . . . . . . 16 ⊢ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 𝑇
75	74	sseli 3896	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} → 𝑥 ∈ 𝒫 𝑇)
76	75	ad2antlr 727	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑥 ∈ 𝒫 𝑇)
77		simpr 488	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑥 ≼ ω)
78		sigaclcu 31797	. . . . . . . . . . . . . 14 ⊢ ((𝑇 ∈ ∪ ran sigAlgebra ∧ 𝑥 ∈ 𝒫 𝑇 ∧ 𝑥 ≼ ω) → ∪ 𝑥 ∈ 𝑇)
79	73, 76, 77, 78	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∪ 𝑥 ∈ 𝑇)
80		simpllr 776	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆))
81	80	simpld 498	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝐹:∪ 𝑆⟶∪ 𝑇)
82		unipreima 30700	. . . . . . . . . . . . . . 15 ⊢ (Fun 𝐹 → (◡𝐹 “ ∪ 𝑥) = ∪ 𝑦 ∈ 𝑥 (◡𝐹 “ 𝑦))
83	81, 52, 82	3syl 18	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → (◡𝐹 “ ∪ 𝑥) = ∪ 𝑦 ∈ 𝑥 (◡𝐹 “ 𝑦))
84	1	ad3antrrr 730	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑆 ∈ ∪ ran sigAlgebra)
85		simpr 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑥)
86		simpllr 776	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
87		elelpwi 4525	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
88	85, 86, 87	syl2anc 587	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
89		imaeq2 5925	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝑦 → (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑦))
90	89	eleq1d 2822	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑦 → ((◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (◡𝐹 “ 𝑦) ∈ 𝑆))
91	90	elrab 3602	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (𝑦 ∈ 𝑇 ∧ (◡𝐹 “ 𝑦) ∈ 𝑆))
92	91	simprbi 500	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} → (◡𝐹 “ 𝑦) ∈ 𝑆)
93	88, 92	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → (◡𝐹 “ 𝑦) ∈ 𝑆)
94	93	ralrimiva 3105	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∀𝑦 ∈ 𝑥 (◡𝐹 “ 𝑦) ∈ 𝑆)
95		nfcv 2904	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑦𝑥
96	95	sigaclcuni 31798	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ ∀𝑦 ∈ 𝑥 (◡𝐹 “ 𝑦) ∈ 𝑆 ∧ 𝑥 ≼ ω) → ∪ 𝑦 ∈ 𝑥 (◡𝐹 “ 𝑦) ∈ 𝑆)
97	84, 94, 77, 96	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∪ 𝑦 ∈ 𝑥 (◡𝐹 “ 𝑦) ∈ 𝑆)
98	83, 97	eqeltrd 2838	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → (◡𝐹 “ ∪ 𝑥) ∈ 𝑆)
99		imaeq2 5925	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = ∪ 𝑥 → (◡𝐹 “ 𝑎) = (◡𝐹 “ ∪ 𝑥))
100	99	eleq1d 2822	. . . . . . . . . . . . . 14 ⊢ (𝑎 = ∪ 𝑥 → ((◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (◡𝐹 “ ∪ 𝑥) ∈ 𝑆))
101	100	elrab 3602	. . . . . . . . . . . . 13 ⊢ (∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (∪ 𝑥 ∈ 𝑇 ∧ (◡𝐹 “ ∪ 𝑥) ∈ 𝑆))
102	79, 98, 101	sylanbrc 586	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
103	102	ex 416	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}))
104	103	ralrimiva 3105	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}))
105	44, 72, 104	3jca 1130	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})))
106		rabexg 5224	. . . . . . . . . . 11 ⊢ (𝑇 ∈ ∪ ran sigAlgebra → {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ V)
107		issiga 31792	. . . . . . . . . . 11 ⊢ ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ V → ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇 ∧ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})))))
108	6, 106, 107	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇 ∧ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})))))
109	108	biimpar 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇 ∧ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})))) → {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇))
110	33, 37, 105, 109	syl12anc 837	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇))
111	3	unieqd 4833	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ 𝑇 = ∪ (sigaGen‘𝐾))
112		unisg 31823	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ V → ∪ (sigaGen‘𝐾) = ∪ 𝐾)
113	4, 112	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ (sigaGen‘𝐾) = ∪ 𝐾)
114	111, 113	eqtrd 2777	. . . . . . . . . . 11 ⊢ (𝜑 → ∪ 𝑇 = ∪ 𝐾)
115	114	fveq2d 6721	. . . . . . . . . 10 ⊢ (𝜑 → (sigAlgebra‘∪ 𝑇) = (sigAlgebra‘∪ 𝐾))
116	115	eleq2d 2823	. . . . . . . . 9 ⊢ (𝜑 → ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾)))
117	116	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾)))
118	110, 117	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾))
119	15	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐾 ⊆ 𝑇)
120		simprr 773	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)
121		ssrab 3986	. . . . . . . 8 ⊢ (𝐾 ⊆ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (𝐾 ⊆ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆))
122	119, 120, 121	sylanbrc 586	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐾 ⊆ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
123		sigagenss 31829	. . . . . . 7 ⊢ (({𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾) ∧ 𝐾 ⊆ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆}) → (sigaGen‘𝐾) ⊆ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
124	118, 122, 123	syl2anc 587	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → (sigaGen‘𝐾) ⊆ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
125	32, 124	eqsstrd 3939	. . . . 5 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 ⊆ {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
126	34	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝑇)
127	125, 126	eqssd 3918	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 = {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆})
128		rabid2 3293	. . . 4 ⊢ (𝑇 = {𝑎 ∈ 𝑇 ∣ (◡𝐹 “ 𝑎) ∈ 𝑆} ↔ ∀𝑎 ∈ 𝑇 (◡𝐹 “ 𝑎) ∈ 𝑆)
129	127, 128	sylib 221	. . 3 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑎 ∈ 𝑇 (◡𝐹 “ 𝑎) ∈ 𝑆)
130	1	adantr 484	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑆 ∈ ∪ ran sigAlgebra)
131	6	adantr 484	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 ∈ ∪ ran sigAlgebra)
132	130, 131	ismbfm 31931	. . 3 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → (𝐹 ∈ (𝑆MblFnM𝑇) ↔ (𝐹 ∈ (∪ 𝑇 ↑m ∪ 𝑆) ∧ ∀𝑎 ∈ 𝑇 (◡𝐹 “ 𝑎) ∈ 𝑆)))
133	31, 129, 132	mpbir2and 713	. 2 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐹 ∈ (𝑆MblFnM𝑇))
134	21, 133	impbida 801	1 ⊢ (𝜑 → (𝐹 ∈ (𝑆MblFnM𝑇) ↔ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (◡𝐹 “ 𝑎) ∈ 𝑆)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1089   = wceq 1543   ∈ wcel 2110  ∀wral 3061  {crab 3065  Vcvv 3408   ∖ cdif 3863   ⊆ wss 3866  𝒫 cpw 4513  ∪ cuni 4819  ∪ ciun 4904   class class class wbr 5053  ^◡ccnv 5550  ran crn 5552   “ cima 5554  Fun wfun 6374  ⟶wf 6376  ‘cfv 6380  (class class class)co 7213  ωcom 7644   ↑_m cmap 8508   ≼ cdom 8624  sigAlgebracsiga 31788  sigaGencsigagen 31818  MblFnMcmbfm 31929

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-rep 5179  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523  ax-inf2 9256  ax-ac2 10077

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-pss 3885  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-tp 4546  df-op 4548  df-uni 4820  df-int 4860  df-iun 4906  df-iin 4907  df-br 5054  df-opab 5116  df-mpt 5136  df-tr 5162  df-id 5455  df-eprel 5460  df-po 5468  df-so 5469  df-fr 5509  df-se 5510  df-we 5511  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-pred 6160  df-ord 6216  df-on 6217  df-lim 6218  df-suc 6219  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-isom 6389  df-riota 7170  df-ov 7216  df-oprab 7217  df-mpo 7218  df-om 7645  df-1st 7761  df-2nd 7762  df-wrecs 8047  df-recs 8108  df-rdg 8146  df-1o 8202  df-2o 8203  df-er 8391  df-map 8510  df-en 8627  df-dom 8628  df-sdom 8629  df-fin 8630  df-oi 9126  df-dju 9517  df-card 9555  df-acn 9558  df-ac 9730  df-siga 31789  df-sigagen 31819  df-mbfm 31930

This theorem is referenced by:  cnmbfm  31942  mbfmco2  31944