Theorem isacs1i 17679

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 4031	. . . 4 ⊢ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ⊆ 𝒫 𝑋
2	1	a1i 11	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ⊆ 𝒫 𝑋)
3		pweq 4566	. . . . . . . 8 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → 𝒫 𝑠 = 𝒫 (𝑋 ∩ ∩ 𝑡))
4	3	ineq1d 4169	. . . . . . 7 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → (𝒫 𝑠 ∩ Fin) = (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin))
5	4	imaeq2d 6044	. . . . . 6 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)))
6	5	unieqd 4875	. . . . 5 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) = ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)))
7		id 22	. . . . 5 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → 𝑠 = (𝑋 ∩ ∩ 𝑡))
8	6, 7	sseq12d 3967	. . . 4 ⊢ (𝑠 = (𝑋 ∩ ∩ 𝑡) → (∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 ↔ ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝑋 ∩ ∩ 𝑡)))
9		inss1 4186	. . . . . 6 ⊢ (𝑋 ∩ ∩ 𝑡) ⊆ 𝑋
10		elpw2g 5286	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → ((𝑋 ∩ ∩ 𝑡) ∈ 𝒫 𝑋 ↔ (𝑋 ∩ ∩ 𝑡) ⊆ 𝑋))
11	9, 10	mpbiri 260	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∩ ∩ 𝑡) ∈ 𝒫 𝑋)
12	11	ad2antrr 736	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝑋 ∩ ∩ 𝑡) ∈ 𝒫 𝑋)
13		imassrn 6055	. . . . . . . . 9 ⊢ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ran 𝐹
14		frn 6693	. . . . . . . . . 10 ⊢ (𝐹:𝒫 𝑋⟶𝒫 𝑋 → ran 𝐹 ⊆ 𝒫 𝑋)
15	14	adantl 485	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ran 𝐹 ⊆ 𝒫 𝑋)
16	13, 15	sstrid 3945	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝒫 𝑋)
17	16	unissd 4872	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∪ 𝒫 𝑋)
18		unipw 5414	. . . . . . 7 ⊢ ∪ 𝒫 𝑋 = 𝑋
19	17, 18	sseqtrdi 3974	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑋)
20	19	adantr 484	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑋)
21		inss2 4187	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∩ ∩ 𝑡) ⊆ ∩ 𝑡
22		intss1 4918	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ 𝑡 → ∩ 𝑡 ⊆ 𝑎)
23	21, 22	sstrid 3945	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ 𝑡 → (𝑋 ∩ ∩ 𝑡) ⊆ 𝑎)
24	23	adantl 485	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → (𝑋 ∩ ∩ 𝑡) ⊆ 𝑎)
25	24	sspwd 4565	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → 𝒫 (𝑋 ∩ ∩ 𝑡) ⊆ 𝒫 𝑎)
26	25	ssrind 4193	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin) ⊆ (𝒫 𝑎 ∩ Fin))
27		imass2 6086	. . . . . . . . . 10 ⊢ ((𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin) ⊆ (𝒫 𝑎 ∩ Fin) → (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
29	28	unissd 4872	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
30		ssel2 3929	. . . . . . . . . 10 ⊢ ((𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∧ 𝑎 ∈ 𝑡) → 𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠})
31		pweq 4566	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑎 → 𝒫 𝑠 = 𝒫 𝑎)
32	31	ineq1d 4169	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑎 → (𝒫 𝑠 ∩ Fin) = (𝒫 𝑎 ∩ Fin))
33	32	imaeq2d 6044	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑎 → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑎 ∩ Fin)))
34	33	unieqd 4875	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑎 → ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) = ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
35		id 22	. . . . . . . . . . . . 13 ⊢ (𝑠 = 𝑎 → 𝑠 = 𝑎)
36	34, 35	sseq12d 3967	. . . . . . . . . . . 12 ⊢ (𝑠 = 𝑎 → (∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 ↔ ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎))
37	36	elrab 3649	. . . . . . . . . . 11 ⊢ (𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑎 ∈ 𝒫 𝑋 ∧ ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎))
38	37	simprbi 501	. . . . . . . . . 10 ⊢ (𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} → ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
39	30, 38	syl 17	. . . . . . . . 9 ⊢ ((𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
40	39	adantll 724	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
41	29, 40	sstrd 3944	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎 ∈ 𝑡) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑎)
42	41	ralrimiva 3153	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∀𝑎 ∈ 𝑡 ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑎)
43		ssint 4919	. . . . . 6 ⊢ (∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∩ 𝑡 ↔ ∀𝑎 ∈ 𝑡 ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ 𝑎)
44	42, 43	sylibr 236	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ ∩ 𝑡)
45	20, 44	ssind 4190	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∪ (𝐹 “ (𝒫 (𝑋 ∩ ∩ 𝑡) ∩ Fin)) ⊆ (𝑋 ∩ ∩ 𝑡))
46	8, 12, 45	elrabd 3651	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝑋 ∩ ∩ 𝑡) ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠})
47	2, 46	ismred2 17621	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (Moore‘𝑋))
48		fssxp 6713	. . . 4 ⊢ (𝐹:𝒫 𝑋⟶𝒫 𝑋 → 𝐹 ⊆ (𝒫 𝑋 × 𝒫 𝑋))
49		pwexg 5332	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ V)
50	49, 49	xpexd 7728	. . . 4 ⊢ (𝑋 ∈ 𝑉 → (𝒫 𝑋 × 𝒫 𝑋) ∈ V)
51		ssexg 5276	. . . 4 ⊢ ((𝐹 ⊆ (𝒫 𝑋 × 𝒫 𝑋) ∧ (𝒫 𝑋 × 𝒫 𝑋) ∈ V) → 𝐹 ∈ V)
52	48, 50, 51	syl2anr 606	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → 𝐹 ∈ V)
53		simpr 488	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → 𝐹:𝒫 𝑋⟶𝒫 𝑋)
54		pweq 4566	. . . . . . . . . 10 ⊢ (𝑠 = 𝑡 → 𝒫 𝑠 = 𝒫 𝑡)
55	54	ineq1d 4169	. . . . . . . . 9 ⊢ (𝑠 = 𝑡 → (𝒫 𝑠 ∩ Fin) = (𝒫 𝑡 ∩ Fin))
56	55	imaeq2d 6044	. . . . . . . 8 ⊢ (𝑠 = 𝑡 → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
57	56	unieqd 4875	. . . . . . 7 ⊢ (𝑠 = 𝑡 → ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) = ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)))
58		id 22	. . . . . . 7 ⊢ (𝑠 = 𝑡 → 𝑠 = 𝑡)
59	57, 58	sseq12d 3967	. . . . . 6 ⊢ (𝑠 = 𝑡 → (∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
60	59	elrab3 3650	. . . . 5 ⊢ (𝑡 ∈ 𝒫 𝑋 → (𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
61	60	rgen 3077	. . . 4 ⊢ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)
62	53, 61	jctir 528	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
63		feq1 6663	. . . 4 ⊢ (𝑓 = 𝐹 → (𝑓:𝒫 𝑋⟶𝒫 𝑋 ↔ 𝐹:𝒫 𝑋⟶𝒫 𝑋))
64		imaeq1 6039	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓 “ (𝒫 𝑡 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
65	64	unieqd 4875	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) = ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)))
66	65	sseq1d 3965	. . . . . 6 ⊢ (𝑓 = 𝐹 → (∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡 ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
67	66	bibi2d 344	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡) ↔ (𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
68	67	ralbidv 3184	. . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡) ↔ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
69	63, 68	anbi12d 641	. . 3 ⊢ (𝑓 = 𝐹 → ((𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)) ↔ (𝐹:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))))
70	52, 62, 69	spcedv 3556	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → ∃𝑓(𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
71		isacs 17673	. 2 ⊢ ({𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋) ↔ ({𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (Moore‘𝑋) ∧ ∃𝑓(𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ ∪ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))))
72	47, 70, 71	sylanbrc 592	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 ∣ ∪ (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559  ∃wex 1798   ∈ wcel 2141  ∀wral 3075  {crab 3413  Vcvv 3453   ∩ cin 3901   ⊆ wss 3902  𝒫 cpw 4552  ∪ cuni 4862  ∩ cint 4902   × cxp 5641  ran crn 5644   “ cima 5646  ⟶wf 6511  ‘cfv 6515  Fincfn 8920  Moorecmre 17600  ACScacs 17603

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-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  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-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  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-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  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-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-fv 6523  df-mre 17604  df-acs 17607

This theorem is referenced by:  acsfn  17681