imambfm - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > imambfm		Structured version Visualization version GIF version

Theorem imambfm 34961

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 486	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝑆 ∈ ∪ ran sigAlgebra)
3		imambfm.3	. . . . . 6 ⊢ (𝜑 → 𝑇 = (sigaGen‘𝐾))
4		imambfm.1	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ V)
5	4	sgsiga 34842	. . . . . 6 ⊢ (𝜑 → (sigaGen‘𝐾) ∈ ∪ ran sigAlgebra)
6	3, 5	eqeltrd 2864	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ ∪ ran sigAlgebra)
7	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝑇 ∈ ∪ ran sigAlgebra)
8		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝐹 ∈ (𝑆MblFnM𝑇))
9	2, 7, 8	mbfmf 34954	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → 𝐹:∪ 𝑆⟶∪ 𝑇)
10	1	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑆 ∈ ∪ ran sigAlgebra)
11	6	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑇 ∈ ∪ ran sigAlgebra)
12		simplr 781	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝐹 ∈ (𝑆MblFnM𝑇))
13		sssigagen 34845	. . . . . . . . 9 ⊢ (𝐾 ∈ V → 𝐾 ⊆ (sigaGen‘𝐾))
14	4, 13	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ⊆ (sigaGen‘𝐾))
15	14, 3	sseqtrrd 3950	. . . . . . 7 ⊢ (𝜑 → 𝐾 ⊆ 𝑇)
16	15	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝐾 ⊆ 𝑇)
17		simpr 490	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑎 ∈ 𝐾)
18	16, 17	sseldd 3914	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → 𝑎 ∈ 𝑇)
19	10, 11, 12, 18	mbfmcnvima 34955	. . . 4 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) ∧ 𝑎 ∈ 𝐾) → (^◡𝐹 “ 𝑎) ∈ 𝑆)
20	19	ralrimiva 3158	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)
21	9, 20	jca 521	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑆MblFnM𝑇)) → (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆))
22		unielsiga 34827	. . . . . 6 ⊢ (𝑇 ∈ ∪ ran sigAlgebra → ∪ 𝑇 ∈ 𝑇)
23	6, 22	syl 18	. . . . 5 ⊢ (𝜑 → ∪ 𝑇 ∈ 𝑇)
24	23	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ∪ 𝑇 ∈ 𝑇)
25		unielsiga 34827	. . . . . 6 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → ∪ 𝑆 ∈ 𝑆)
26	1, 25	syl 18	. . . . 5 ⊢ (𝜑 → ∪ 𝑆 ∈ 𝑆)
27	26	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ∪ 𝑆 ∈ 𝑆)
28		simprl 783	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐹:∪ 𝑆⟶∪ 𝑇)
29		elmapg 8884	. . . . 5 ⊢ ((∪ 𝑇 ∈ 𝑇 ∧ ∪ 𝑆 ∈ 𝑆) → (𝐹 ∈ (∪ 𝑇 ↑_m ∪ 𝑆) ↔ 𝐹:∪ 𝑆⟶∪ 𝑇))
30	29	biimpar 483	. . . 4 ⊢ (((∪ 𝑇 ∈ 𝑇 ∧ ∪ 𝑆 ∈ 𝑆) ∧ 𝐹:∪ 𝑆⟶∪ 𝑇) → 𝐹 ∈ (∪ 𝑇 ↑_m ∪ 𝑆))
31	24, 27, 28, 30	syl21anc 851	. . 3 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐹 ∈ (∪ 𝑇 ↑_m ∪ 𝑆))
32	3	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 = (sigaGen‘𝐾))
33		simpl 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝜑)
34		ssrab2 4008	. . . . . . . . . . 11 ⊢ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝑇
35		pwuni 4909	. . . . . . . . . . 11 ⊢ 𝑇 ⊆ 𝒫 ∪ 𝑇
36	34, 35	sstri 3922	. . . . . . . . . 10 ⊢ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇
37	36	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇)
38		fimacnv 6751	. . . . . . . . . . . . 13 ⊢ (𝐹:∪ 𝑆⟶∪ 𝑇 → (^◡𝐹 “ ∪ 𝑇) = ∪ 𝑆)
39	38	ad2antrl 741	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → (^◡𝐹 “ ∪ 𝑇) = ∪ 𝑆)
40	39, 27	eqeltrd 2864	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → (^◡𝐹 “ ∪ 𝑇) ∈ 𝑆)
41		imaeq2 6059	. . . . . . . . . . . . 13 ⊢ (𝑎 = ∪ 𝑇 → (^◡𝐹 “ 𝑎) = (^◡𝐹 “ ∪ 𝑇))
42	41	eleq1d 2849	. . . . . . . . . . . 12 ⊢ (𝑎 = ∪ 𝑇 → ((^◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (^◡𝐹 “ ∪ 𝑇) ∈ 𝑆))
43	42	elrab 3648	. . . . . . . . . . 11 ⊢ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (∪ 𝑇 ∈ 𝑇 ∧ (^◡𝐹 “ ∪ 𝑇) ∈ 𝑆))
44	24, 40, 43	sylanbrc 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
45	6	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑇 ∈ ∪ ran sigAlgebra)
46	45, 22	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → ∪ 𝑇 ∈ 𝑇)
47		elrabi 3644	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} → 𝑥 ∈ 𝑇)
48	47	adantl 487	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑥 ∈ 𝑇)
49		difelsiga 34834	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ ∪ ran sigAlgebra ∧ ∪ 𝑇 ∈ 𝑇 ∧ 𝑥 ∈ 𝑇) → (∪ 𝑇 ∖ 𝑥) ∈ 𝑇)
50	45, 46, 48, 49	syl3anc 1399	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (∪ 𝑇 ∖ 𝑥) ∈ 𝑇)
51		simplrl 789	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝐹:∪ 𝑆⟶∪ 𝑇)
52		ffun 6731	. . . . . . . . . . . . . 14 ⊢ (𝐹:∪ 𝑆⟶∪ 𝑇 → Fun 𝐹)
53		difpreima 7085	. . . . . . . . . . . . . 14 ⊢ (Fun 𝐹 → (^◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) = ((^◡𝐹 “ ∪ 𝑇) ∖ (^◡𝐹 “ 𝑥)))
54	51, 52, 53	3syl 19	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (^◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) = ((^◡𝐹 “ ∪ 𝑇) ∖ (^◡𝐹 “ 𝑥)))
55	39	difeq1d 4065	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ((^◡𝐹 “ ∪ 𝑇) ∖ (^◡𝐹 “ 𝑥)) = (∪ 𝑆 ∖ (^◡𝐹 “ 𝑥)))
56	55	adantr 486	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → ((^◡𝐹 “ ∪ 𝑇) ∖ (^◡𝐹 “ 𝑥)) = (∪ 𝑆 ∖ (^◡𝐹 “ 𝑥)))
57	1	ad2antrr 739	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑆 ∈ ∪ ran sigAlgebra)
58	57, 25	syl 18	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → ∪ 𝑆 ∈ 𝑆)
59		imaeq2 6059	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑥 → (^◡𝐹 “ 𝑎) = (^◡𝐹 “ 𝑥))
60	59	eleq1d 2849	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = 𝑥 → ((^◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (^◡𝐹 “ 𝑥) ∈ 𝑆))
61	60	elrab 3648	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (𝑥 ∈ 𝑇 ∧ (^◡𝐹 “ 𝑥) ∈ 𝑆))
62	61	simprbi 503	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} → (^◡𝐹 “ 𝑥) ∈ 𝑆)
63	62	adantl 487	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (^◡𝐹 “ 𝑥) ∈ 𝑆)
64		difelsiga 34834	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ ∪ 𝑆 ∈ 𝑆 ∧ (^◡𝐹 “ 𝑥) ∈ 𝑆) → (∪ 𝑆 ∖ (^◡𝐹 “ 𝑥)) ∈ 𝑆)
65	57, 58, 63, 64	syl3anc 1399	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (∪ 𝑆 ∖ (^◡𝐹 “ 𝑥)) ∈ 𝑆)
66	56, 65	eqeltrd 2864	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → ((^◡𝐹 “ ∪ 𝑇) ∖ (^◡𝐹 “ 𝑥)) ∈ 𝑆)
67	54, 66	eqeltrd 2864	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (^◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) ∈ 𝑆)
68		imaeq2 6059	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (∪ 𝑇 ∖ 𝑥) → (^◡𝐹 “ 𝑎) = (^◡𝐹 “ (∪ 𝑇 ∖ 𝑥)))
69	68	eleq1d 2849	. . . . . . . . . . . . 13 ⊢ (𝑎 = (∪ 𝑇 ∖ 𝑥) → ((^◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (^◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) ∈ 𝑆))
70	69	elrab 3648	. . . . . . . . . . . 12 ⊢ ((∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ↔ ((∪ 𝑇 ∖ 𝑥) ∈ 𝑇 ∧ (^◡𝐹 “ (∪ 𝑇 ∖ 𝑥)) ∈ 𝑆))
71	50, 67, 70	sylanbrc 595	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
72	71	ralrimiva 3158	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
73	6	ad3antrrr 743	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑇 ∈ ∪ ran sigAlgebra)
74	34	sspwi 4572	. . . . . . . . . . . . . . . 16 ⊢ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 𝑇
75	74	sseli 3909	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} → 𝑥 ∈ 𝒫 𝑇)
76	75	ad2antlr 740	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑥 ∈ 𝒫 𝑇)
77		simpr 490	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑥 ≼ ω)
78		sigaclcu 34816	. . . . . . . . . . . . . 14 ⊢ ((𝑇 ∈ ∪ ran sigAlgebra ∧ 𝑥 ∈ 𝒫 𝑇 ∧ 𝑥 ≼ ω) → ∪ 𝑥 ∈ 𝑇)
79	73, 76, 77, 78	syl3anc 1399	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∪ 𝑥 ∈ 𝑇)
80		simpllr 788	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆))
81	80	simpld 500	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝐹:∪ 𝑆⟶∪ 𝑇)
82		unipreima 33306	. . . . . . . . . . . . . . 15 ⊢ (Fun 𝐹 → (^◡𝐹 “ ∪ 𝑥) = ∪ 𝑦 ∈ 𝑥 (^◡𝐹 “ 𝑦))
83	81, 52, 82	3syl 19	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → (^◡𝐹 “ ∪ 𝑥) = ∪ 𝑦 ∈ 𝑥 (^◡𝐹 “ 𝑦))
84	1	ad3antrrr 743	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → 𝑆 ∈ ∪ ran sigAlgebra)
85		simpr 490	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑥)
86		simpllr 788	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
87		elelpwi 4570	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → 𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
88	85, 86, 87	syl2anc 596	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
89		imaeq2 6059	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝑦 → (^◡𝐹 “ 𝑎) = (^◡𝐹 “ 𝑦))
90	89	eleq1d 2849	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑦 → ((^◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (^◡𝐹 “ 𝑦) ∈ 𝑆))
91	90	elrab 3648	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (𝑦 ∈ 𝑇 ∧ (^◡𝐹 “ 𝑦) ∈ 𝑆))
92	91	simprbi 503	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} → (^◡𝐹 “ 𝑦) ∈ 𝑆)
93	88, 92	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) ∧ 𝑦 ∈ 𝑥) → (^◡𝐹 “ 𝑦) ∈ 𝑆)
94	93	ralrimiva 3158	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∀𝑦 ∈ 𝑥 (^◡𝐹 “ 𝑦) ∈ 𝑆)
95		nfcv 2926	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑦𝑥
96	95	sigaclcuni 34817	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ ∀𝑦 ∈ 𝑥 (^◡𝐹 “ 𝑦) ∈ 𝑆 ∧ 𝑥 ≼ ω) → ∪ 𝑦 ∈ 𝑥 (^◡𝐹 “ 𝑦) ∈ 𝑆)
97	84, 94, 77, 96	syl3anc 1399	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∪ 𝑦 ∈ 𝑥 (^◡𝐹 “ 𝑦) ∈ 𝑆)
98	83, 97	eqeltrd 2864	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → (^◡𝐹 “ ∪ 𝑥) ∈ 𝑆)
99		imaeq2 6059	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = ∪ 𝑥 → (^◡𝐹 “ 𝑎) = (^◡𝐹 “ ∪ 𝑥))
100	99	eleq1d 2849	. . . . . . . . . . . . . 14 ⊢ (𝑎 = ∪ 𝑥 → ((^◡𝐹 “ 𝑎) ∈ 𝑆 ↔ (^◡𝐹 “ ∪ 𝑥) ∈ 𝑆))
101	100	elrab 3648	. . . . . . . . . . . . 13 ⊢ (∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (∪ 𝑥 ∈ 𝑇 ∧ (^◡𝐹 “ ∪ 𝑥) ∈ 𝑆))
102	79, 98, 101	sylanbrc 595	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) ∧ 𝑥 ≼ ω) → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
103	102	ex 418	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) ∧ 𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}))
104	103	ralrimiva 3158	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}))
105	44, 72, 104	3jca 1146	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})))
106		rabexg 5303	. . . . . . . . . . 11 ⊢ (𝑇 ∈ ∪ ran sigAlgebra → {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ V)
107		issiga 34811	. . . . . . . . . . 11 ⊢ ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ V → ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇 ∧ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})))))
108	6, 106, 107	3syl 19	. . . . . . . . . 10 ⊢ (𝜑 → ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇 ∧ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})))))
109	108	biimpar 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝒫 ∪ 𝑇 ∧ (∪ 𝑇 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (∪ 𝑇 ∖ 𝑥) ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∧ ∀𝑥 ∈ 𝒫 {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} (𝑥 ≼ ω → ∪ 𝑥 ∈ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})))) → {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇))
110	33, 37, 105, 109	syl12anc 850	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇))
111	3	unieqd 4883	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ 𝑇 = ∪ (sigaGen‘𝐾))
112		unisg 34843	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ V → ∪ (sigaGen‘𝐾) = ∪ 𝐾)
113	4, 112	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ (sigaGen‘𝐾) = ∪ 𝐾)
114	111, 113	eqtrd 2798	. . . . . . . . . . 11 ⊢ (𝜑 → ∪ 𝑇 = ∪ 𝐾)
115	114	fveq2d 6909	. . . . . . . . . 10 ⊢ (𝜑 → (sigAlgebra‘∪ 𝑇) = (sigAlgebra‘∪ 𝐾))
116	115	eleq2d 2850	. . . . . . . . 9 ⊢ (𝜑 → ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾)))
117	116	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝑇) ↔ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾)))
118	110, 117	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾))
119	15	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐾 ⊆ 𝑇)
120		simprr 785	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)
121		ssrab 3999	. . . . . . . 8 ⊢ (𝐾 ⊆ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ↔ (𝐾 ⊆ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆))
122	119, 120, 121	sylanbrc 595	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐾 ⊆ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
123		sigagenss 34849	. . . . . . 7 ⊢ (({𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ∈ (sigAlgebra‘∪ 𝐾) ∧ 𝐾 ⊆ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆}) → (sigaGen‘𝐾) ⊆ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
124	118, 122, 123	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → (sigaGen‘𝐾) ⊆ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
125	32, 124	eqsstrd 3947	. . . . 5 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 ⊆ {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
126	34	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ⊆ 𝑇)
127	125, 126	eqssd 3930	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 = {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆})
128		rabid2 3448	. . . 4 ⊢ (𝑇 = {𝑎 ∈ 𝑇 ∣ (^◡𝐹 “ 𝑎) ∈ 𝑆} ↔ ∀𝑎 ∈ 𝑇 (^◡𝐹 “ 𝑎) ∈ 𝑆)
129	127, 128	sylib 221	. . 3 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → ∀𝑎 ∈ 𝑇 (^◡𝐹 “ 𝑎) ∈ 𝑆)
130	1	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑆 ∈ ∪ ran sigAlgebra)
131	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝑇 ∈ ∪ ran sigAlgebra)
132	130, 131	ismbfm 34951	. . 3 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → (𝐹 ∈ (𝑆MblFnM𝑇) ↔ (𝐹 ∈ (∪ 𝑇 ↑_m ∪ 𝑆) ∧ ∀𝑎 ∈ 𝑇 (^◡𝐹 “ 𝑎) ∈ 𝑆)))
133	31, 129, 132	mpbir2and 726	. 2 ⊢ ((𝜑 ∧ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)) → 𝐹 ∈ (𝑆MblFnM𝑇))
134	21, 133	impbida 813	1 ⊢ (𝜑 → (𝐹 ∈ (𝑆MblFnM𝑇) ↔ (𝐹:∪ 𝑆⟶∪ 𝑇 ∧ ∀𝑎 ∈ 𝐾 (^◡𝐹 “ 𝑎) ∈ 𝑆)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {crab 3416 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 𝒫 cpw 4560 ∪ cuni 4870 ∪ ciun 4954 class class class wbr 5106 ^◡ccnv 5654 ran crn 5656 “ cima 5658 Fun wfun 6549 ⟶wf 6551 ‘cfv 6555 (class class class)co 7440 ωcom 7898 ↑_m cmap 8872 ≼ cdom 8996 sigAlgebracsiga 34807 sigaGencsigagen 34838 MblFnMcmbfm 34949

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-inf2 9666

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-isom 6564 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-2o 8502 df-er 8742 df-map 8874 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-oi 9528 df-dju 10006 df-card 10044 df-acn 10047 df-siga 34808 df-sigagen 34839 df-mbfm 34950

This theorem is used by: cnmbfm 34962 mbfmco2 34964

W3C validator