Theorem isacs1i 17283

Description: A closure system determined by a function is a closure system and algebraic. (Contributed by Stefan O'Rear, 3-Apr-2015.)

Assertion

Ref	Expression
isacs1i	⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋))

Distinct variable groups:   𝐹,𝑠   𝑋,𝑠

Allowed substitution hint:   𝑉(𝑠)

Proof of Theorem isacs1i

Dummy variables 𝑎 𝑡 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 4009	. . . 4 ⊢ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ⊆ 𝒫 𝑋
2	1	a1i 11	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ⊆ 𝒫 𝑋)
3		pweq 4546	. . . . . . . 8 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → 𝒫 𝑠 = 𝒫 (𝑋 ∩ ∩ 𝑡))
4	3	ineq1d 4142	. . . . . . 7 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → (𝒫 𝑠 ∩ Fin) = (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin))
5	4	imaeq2d 5958	. . . . . 6 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)))
6	5	unieqd 4850	. . . . 5 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) = ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)))
7		id 22	. . . . 5 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → 𝑠 = (𝑋 ∩ ∩ 𝑡))
8	6, 7	sseq12d 3950	. . . 4 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → (∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 ↔ ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝑋 ∩ ∩ 𝑡)))
9		inss1 4159	. . . . . 6 ⊢ (𝑋 ∩ ∩ 𝑡) ⊆ 𝑋
10		elpw2g 5263	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → ((𝑋 ∩ ∩ 𝑡) ∈ 𝒫 𝑋 ↔ (𝑋 ∩ ∩ 𝑡) ⊆ 𝑋))
11	9, 10	mpbiri 257	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∩ ∩ 𝑡) ∈ 𝒫 𝑋)
12	11	ad2antrr 722	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝑋 ∩ ∩ 𝑡) ∈ 𝒫 𝑋)
13		imassrn 5969	. . . . . . . . 9 ⊢ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ran 𝐹
14		frn 6591	. . . . . . . . . 10 ⊢ (𝐹:𝒫 𝑋⟶𝒫 𝑋 → ran 𝐹 ⊆ 𝒫 𝑋)
15	14	adantl 481	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ran 𝐹 ⊆ 𝒫 𝑋)
16	13, 15	sstrid 3928	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝒫 𝑋)
17	16	unissd 4846	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∪ 𝒫 𝑋)
18		unipw 5360	. . . . . . 7 ⊢ ∪ 𝒫 𝑋 = 𝑋
19	17, 18	sseqtrdi 3967	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑋)
20	19	adantr 480	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑋)
21		inss2 4160	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∩ ∩ 𝑡) ⊆ ∩ 𝑡
22		intss1 4891	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ 𝑡 → ∩ 𝑡 ⊆ 𝑎)
23	21, 22	sstrid 3928	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ 𝑡 → (𝑋 ∩ ∩ 𝑡) ⊆ 𝑎)
24	23	adantl 481	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → (𝑋 ∩ ∩ 𝑡) ⊆ 𝑎)
25	24	sspwd 4545	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → 𝒫 (𝑋 ∩ ∩ 𝑡) ⊆ 𝒫 𝑎)
26	25	ssrind 4166	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin) ⊆ (𝒫 𝑎 ∩ Fin))
27		imass2 5999	. . . . . . . . . 10 ⊢ ((𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin) ⊆ (𝒫 𝑎 ∩ Fin) → (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
29	28	unissd 4846	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
30		ssel2 3912	. . . . . . . . . 10 ⊢ ((𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∧ 𝑎 ∈ 𝑡) → 𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠})
31		pweq 4546	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑎 → 𝒫 𝑠 = 𝒫 𝑎)
32	31	ineq1d 4142	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑎 → (𝒫 𝑠 ∩ Fin) = (𝒫 𝑎 ∩ Fin))
33	32	imaeq2d 5958	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑎 → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑎 ∩ Fin)))
34	33	unieqd 4850	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑎 → ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) = ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
35		id 22	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑎 → 𝑠 = 𝑎)
36	34, 35	sseq12d 3950	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑎 → (∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 ↔ ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎))
37	36	elrab 3617	. . . . . . . . . . 11 ⊢ (𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎))
38	37	simprbi 496	. . . . . . . . . 10 ⊢ (𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} → ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
39	30, 38	syl 17	. . . . . . . . 9 ⊢ ((𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
40	39	adantll 710	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
41	29, 40	sstrd 3927	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑎)
42	41	ralrimiva 3107	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∀𝑎 ∈ 𝑡 ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑎)
43		ssint 4892	. . . . . 6 ⊢ (∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∩ 𝑡 ↔ ∀𝑎 ∈ 𝑡 ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑎)
44	42, 43	sylibr 233	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∩ 𝑡)
45	20, 44	ssind 4163	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝑋 ∩ ∩ 𝑡))
46	8, 12, 45	elrabd 3619	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝑋 ∩ ∩ 𝑡) ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠})
47	2, 46	ismred2 17229	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (Moore‘𝑋))
48		fssxp 6612	. . . 4 ⊢ (𝐹:𝒫 𝑋⟶𝒫 𝑋 → 𝐹 ⊆ (𝒫 𝑋 × 𝒫 𝑋))
49		pwexg 5296	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ V)
50	49, 49	xpexd 7579	. . . 4 ⊢ (𝑋 ∈ 𝑉 → (𝒫 𝑋 × 𝒫 𝑋) ∈ V)
51		ssexg 5242	. . . 4 ⊢ ((𝐹 ⊆ (𝒫 𝑋 × 𝒫 𝑋) ∧ (𝒫 𝑋 × 𝒫 𝑋) ∈ V) → 𝐹 ∈ V)
52	48, 50, 51	syl2anr 596	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → 𝐹 ∈ V)
53		simpr 484	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → 𝐹:𝒫 𝑋⟶𝒫 𝑋)
54		pweq 4546	. . . . . . . . . 10 ⊢ (𝑠 = 𝑡 → 𝒫 𝑠 = 𝒫 𝑡)
55	54	ineq1d 4142	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝒫 𝑠 ∩ Fin) = (𝒫 𝑡 ∩ Fin))
56	55	imaeq2d 5958	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
57	56	unieqd 4850	. . . . . . 7 ⊢ (𝑠 = 𝑡 → ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) = ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)))
58		id 22	. . . . . . 7 ⊢ (𝑠 = 𝑡 → 𝑠 = 𝑡)
59	57, 58	sseq12d 3950	. . . . . 6 ⊢ (𝑠 = 𝑡 → (∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
60	59	elrab3 3618	. . . . 5 ⊢ (𝑡 ∈ 𝒫 𝑋 → (𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
61	60	rgen 3073	. . . 4 ⊢ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)
62	53, 61	jctir 520	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
63		feq1 6565	. . . 4 ⊢ (𝑓 = 𝐹 → (𝑓:𝒫 𝑋⟶𝒫 𝑋 ↔ 𝐹:𝒫 𝑋⟶𝒫 𝑋))
64		imaeq1 5953	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓 “ (𝒫 𝑡 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
65	64	unieqd 4850	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) = ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)))
66	65	sseq1d 3948	. . . . . 6 ⊢ (𝑓 = 𝐹 → (∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡 ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
67	66	bibi2d 342	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡) ↔ (𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
68	67	ralbidv 3120	. . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡) ↔ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
69	63, 68	anbi12d 630	. . 3 ⊢ (𝑓 = 𝐹 → ((𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)) ↔ (𝐹:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))))
70	52, 62, 69	spcedv 3527	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ∃𝑓(𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
71		isacs 17277	. 2 ⊢ ({𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋) ↔ ({𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (Moore‘𝑋) ∧ ∃𝑓(𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))))
72	47, 70, 71	sylanbrc 582	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539  ∃wex 1783   ∈ wcel 2108  ∀wral 3063  {crab 3067  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883  𝒫 cpw 4530  ∪ cuni 4836  ∩ cint 4876   × cxp 5578  ran crn 5581   “ cima 5583  ⟶wf 6414  ‘cfv 6418  Fincfn 8691  Moorecmre 17208  ACScacs 17211

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fv 6426  df-mre 17212  df-acs 17215

This theorem is referenced by:  acsfn  17285