Theorem acsfn 17750

Description: Algebraicity of a conditional point closure condition. (Contributed by Stefan O'Rear, 3-Apr-2015.)

Assertion

Ref	Expression
acsfn	⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → {𝑎 ∈ 𝒫 𝑋 ∣ (𝑇 ⊆ 𝑎 → 𝐾 ∈ 𝑎)} ∈ (ACS‘𝑋))

Distinct variable groups:   𝐾,𝑎   𝑇,𝑎   𝑉,𝑎   𝑋,𝑎

Proof of Theorem acsfn

Dummy variables 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		funmpt 6572	. . . . . . 7 ⊢ Fun (𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅))
2		funiunfv 7246	. . . . . . 7 ⊢ (Fun (𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) → ∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅))‘𝑐) = ∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)))
3	1, 2	mp1i 14	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → ∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅))‘𝑐) = ∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)))
4		elinel1 4147	. . . . . . . . . . . 12 ⊢ (𝑐 ∈ (𝒫 𝑎 ∩ Fin) → 𝑐 ∈ 𝒫 𝑎)
5	4	elpwid 4566	. . . . . . . . . . 11 ⊢ (𝑐 ∈ (𝒫 𝑎 ∩ Fin) → 𝑐 ⊆ 𝑎)
6		elpwi 4564	. . . . . . . . . . 11 ⊢ (𝑎 ∈ 𝒫 𝑋 → 𝑎 ⊆ 𝑋)
7	5, 6	sylan9ssr 3945	. . . . . . . . . 10 ⊢ ((𝑎 ∈ 𝒫 𝑋 ∧ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)) → 𝑐 ⊆ 𝑋)
8		velpw 4562	. . . . . . . . . 10 ⊢ (𝑐 ∈ 𝒫 𝑋 ↔ 𝑐 ⊆ 𝑋)
9	7, 8	sylibr 237	. . . . . . . . 9 ⊢ ((𝑎 ∈ 𝒫 𝑋 ∧ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)) → 𝑐 ∈ 𝒫 𝑋)
10	9	adantll 727	. . . . . . . 8 ⊢ (((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)) → 𝑐 ∈ 𝒫 𝑋)
11		eqeq1 2764	. . . . . . . . . 10 ⊢ (𝑏 = 𝑐 → (𝑏 = 𝑇 ↔ 𝑐 = 𝑇))
12	11	ifbid 4506	. . . . . . . . 9 ⊢ (𝑏 = 𝑐 → if(𝑏 = 𝑇, {𝐾}, ∅) = if(𝑐 = 𝑇, {𝐾}, ∅))
13		eqid 2760	. . . . . . . . 9 ⊢ (𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) = (𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅))
14		snex 5404	. . . . . . . . . 10 ⊢ {𝐾} ∈ V
15		0ex 5264	. . . . . . . . . 10 ⊢ ∅ ∈ V
16	14, 15	ifex 4533	. . . . . . . . 9 ⊢ if(𝑐 = 𝑇, {𝐾}, ∅) ∈ V
17	12, 13, 16	fvmpt 6987	. . . . . . . 8 ⊢ (𝑐 ∈ 𝒫 𝑋 → ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅))‘𝑐) = if(𝑐 = 𝑇, {𝐾}, ∅))
18	10, 17	syl 18	. . . . . . 7 ⊢ (((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)) → ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅))‘𝑐) = if(𝑐 = 𝑇, {𝐾}, ∅))
19	18	iuneq2dv 4976	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → ∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅))‘𝑐) = ∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅))
20	3, 19	eqtr3d 2797	. . . . 5 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → ∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)) = ∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅))
21	20	sseq1d 3962	. . . 4 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎 ↔ ∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎))
22		iunss 5003	. . . . 5 ⊢ (∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎 ↔ ∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎)
23		sseq1 3956	. . . . . . . . 9 ⊢ ({𝐾} = if(𝑐 = 𝑇, {𝐾}, ∅) → ({𝐾} ⊆ 𝑎 ↔ if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎))
24	23	bibi1d 346	. . . . . . . 8 ⊢ ({𝐾} = if(𝑐 = 𝑇, {𝐾}, ∅) → (({𝐾} ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)) ↔ (if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎))))
25		sseq1 3956	. . . . . . . . 9 ⊢ (∅ = if(𝑐 = 𝑇, {𝐾}, ∅) → (∅ ⊆ 𝑎 ↔ if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎))
26	25	bibi1d 346	. . . . . . . 8 ⊢ (∅ = if(𝑐 = 𝑇, {𝐾}, ∅) → ((∅ ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)) ↔ (if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎))))
27		snssg 4744	. . . . . . . . . 10 ⊢ (𝐾 ∈ 𝑋 → (𝐾 ∈ 𝑎 ↔ {𝐾} ⊆ 𝑎))
28	27	adantr 486	. . . . . . . . 9 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑐 = 𝑇) → (𝐾 ∈ 𝑎 ↔ {𝐾} ⊆ 𝑎))
29		biimt 363	. . . . . . . . . 10 ⊢ (𝑐 = 𝑇 → (𝐾 ∈ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
30	29	adantl 487	. . . . . . . . 9 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑐 = 𝑇) → (𝐾 ∈ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
31	28, 30	bitr3d 284	. . . . . . . 8 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑐 = 𝑇) → ({𝐾} ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
32		0ss 4350	. . . . . . . . . . 11 ⊢ ∅ ⊆ 𝑎
33	32	a1i 11	. . . . . . . . . 10 ⊢ (¬ 𝑐 = 𝑇 → ∅ ⊆ 𝑎)
34		pm2.21 124	. . . . . . . . . 10 ⊢ (¬ 𝑐 = 𝑇 → (𝑐 = 𝑇 → 𝐾 ∈ 𝑎))
35	33, 34	2thd 268	. . . . . . . . 9 ⊢ (¬ 𝑐 = 𝑇 → (∅ ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
36	35	adantl 487	. . . . . . . 8 ⊢ ((𝐾 ∈ 𝑋 ∧ ¬ 𝑐 = 𝑇) → (∅ ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
37	24, 26, 31, 36	ifbothda 4521	. . . . . . 7 ⊢ (𝐾 ∈ 𝑋 → (if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎 ↔ (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
38	37	ralbidv 3185	. . . . . 6 ⊢ (𝐾 ∈ 𝑋 → (∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎 ↔ ∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)(𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
39	38	ad3antlr 744	. . . . 5 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎 ↔ ∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)(𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
40	22, 39	bitrid 286	. . . 4 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (∪ 𝑐 ∈ (𝒫 𝑎 ∩ Fin)if(𝑐 = 𝑇, {𝐾}, ∅) ⊆ 𝑎 ↔ ∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)(𝑐 = 𝑇 → 𝐾 ∈ 𝑎)))
41		inss1 4182	. . . . . . . 8 ⊢ (𝒫 𝑎 ∩ Fin) ⊆ 𝒫 𝑎
42	6	sspwd 4570	. . . . . . . 8 ⊢ (𝑎 ∈ 𝒫 𝑋 → 𝒫 𝑎 ⊆ 𝒫 𝑋)
43	41, 42	sstrid 3942	. . . . . . 7 ⊢ (𝑎 ∈ 𝒫 𝑋 → (𝒫 𝑎 ∩ Fin) ⊆ 𝒫 𝑋)
44	43	adantl 487	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (𝒫 𝑎 ∩ Fin) ⊆ 𝒫 𝑋)
45		ralss 4004	. . . . . 6 ⊢ ((𝒫 𝑎 ∩ Fin) ⊆ 𝒫 𝑋 → (∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)(𝑐 = 𝑇 → 𝐾 ∈ 𝑎) ↔ ∀𝑐 ∈ 𝒫 𝑋(𝑐 ∈ (𝒫 𝑎 ∩ Fin) → (𝑐 = 𝑇 → 𝐾 ∈ 𝑎))))
46	44, 45	syl 18	. . . . 5 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)(𝑐 = 𝑇 → 𝐾 ∈ 𝑎) ↔ ∀𝑐 ∈ 𝒫 𝑋(𝑐 ∈ (𝒫 𝑎 ∩ Fin) → (𝑐 = 𝑇 → 𝐾 ∈ 𝑎))))
47		bi2.04 392	. . . . . . 7 ⊢ ((𝑐 ∈ (𝒫 𝑎 ∩ Fin) → (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)) ↔ (𝑐 = 𝑇 → (𝑐 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)))
48	47	ralbii 3108	. . . . . 6 ⊢ (∀𝑐 ∈ 𝒫 𝑋(𝑐 ∈ (𝒫 𝑎 ∩ Fin) → (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)) ↔ ∀𝑐 ∈ 𝒫 𝑋(𝑐 = 𝑇 → (𝑐 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)))
49		elpwg 4560	. . . . . . . . 9 ⊢ (𝑇 ∈ Fin → (𝑇 ∈ 𝒫 𝑋 ↔ 𝑇 ⊆ 𝑋))
50	49	biimparc 485	. . . . . . . 8 ⊢ ((𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin) → 𝑇 ∈ 𝒫 𝑋)
51	50	ad2antlr 740	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → 𝑇 ∈ 𝒫 𝑋)
52		eleq1 2848	. . . . . . . . 9 ⊢ (𝑐 = 𝑇 → (𝑐 ∈ (𝒫 𝑎 ∩ Fin) ↔ 𝑇 ∈ (𝒫 𝑎 ∩ Fin)))
53	52	imbi1d 344	. . . . . . . 8 ⊢ (𝑐 = 𝑇 → ((𝑐 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎) ↔ (𝑇 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)))
54	53	ceqsralv 3490	. . . . . . 7 ⊢ (𝑇 ∈ 𝒫 𝑋 → (∀𝑐 ∈ 𝒫 𝑋(𝑐 = 𝑇 → (𝑐 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)) ↔ (𝑇 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)))
55	51, 54	syl 18	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (∀𝑐 ∈ 𝒫 𝑋(𝑐 = 𝑇 → (𝑐 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)) ↔ (𝑇 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)))
56	48, 55	bitrid 286	. . . . 5 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (∀𝑐 ∈ 𝒫 𝑋(𝑐 ∈ (𝒫 𝑎 ∩ Fin) → (𝑐 = 𝑇 → 𝐾 ∈ 𝑎)) ↔ (𝑇 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎)))
57		simplrr 790	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → 𝑇 ∈ Fin)
58	57	biantrud 541	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (𝑇 ∈ 𝒫 𝑎 ↔ (𝑇 ∈ 𝒫 𝑎 ∧ 𝑇 ∈ Fin)))
59		elin 3915	. . . . . . . 8 ⊢ (𝑇 ∈ (𝒫 𝑎 ∩ Fin) ↔ (𝑇 ∈ 𝒫 𝑎 ∧ 𝑇 ∈ Fin))
60	58, 59	bitr4di 292	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (𝑇 ∈ 𝒫 𝑎 ↔ 𝑇 ∈ (𝒫 𝑎 ∩ Fin)))
61		vex 3454	. . . . . . . 8 ⊢ 𝑎 ∈ V
62	61	elpw2 5299	. . . . . . 7 ⊢ (𝑇 ∈ 𝒫 𝑎 ↔ 𝑇 ⊆ 𝑎)
63	60, 62	bitr3di 289	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (𝑇 ∈ (𝒫 𝑎 ∩ Fin) ↔ 𝑇 ⊆ 𝑎))
64	63	imbi1d 344	. . . . 5 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → ((𝑇 ∈ (𝒫 𝑎 ∩ Fin) → 𝐾 ∈ 𝑎) ↔ (𝑇 ⊆ 𝑎 → 𝐾 ∈ 𝑎)))
65	46, 56, 64	3bitrd 308	. . . 4 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → (∀𝑐 ∈ (𝒫 𝑎 ∩ Fin)(𝑐 = 𝑇 → 𝐾 ∈ 𝑎) ↔ (𝑇 ⊆ 𝑎 → 𝐾 ∈ 𝑎)))
66	21, 40, 65	3bitrrd 309	. . 3 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑎 ∈ 𝒫 𝑋) → ((𝑇 ⊆ 𝑎 → 𝐾 ∈ 𝑎) ↔ ∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎))
67	66	rabbidva 3418	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → {𝑎 ∈ 𝒫 𝑋 ∣ (𝑇 ⊆ 𝑎 → 𝐾 ∈ 𝑎)} = {𝑎 ∈ 𝒫 𝑋 ∣ ∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎})
68		simpll 779	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → 𝑋 ∈ 𝑉)
69		snelpwi 5419	. . . . . . 7 ⊢ (𝐾 ∈ 𝑋 → {𝐾} ∈ 𝒫 𝑋)
70	69	ad2antlr 740	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → {𝐾} ∈ 𝒫 𝑋)
71		0elpw 5320	. . . . . 6 ⊢ ∅ ∈ 𝒫 𝑋
72		ifcl 4528	. . . . . 6 ⊢ (({𝐾} ∈ 𝒫 𝑋 ∧ ∅ ∈ 𝒫 𝑋) → if(𝑏 = 𝑇, {𝐾}, ∅) ∈ 𝒫 𝑋)
73	70, 71, 72	sylancl 598	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → if(𝑏 = 𝑇, {𝐾}, ∅) ∈ 𝒫 𝑋)
74	73	adantr 486	. . . 4 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) ∧ 𝑏 ∈ 𝒫 𝑋) → if(𝑏 = 𝑇, {𝐾}, ∅) ∈ 𝒫 𝑋)
75	74	fmpttd 7109	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → (𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)):𝒫 𝑋⟶𝒫 𝑋)
76		isacs1i 17748	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)):𝒫 𝑋⟶𝒫 𝑋) → {𝑎 ∈ 𝒫 𝑋 ∣ ∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎} ∈ (ACS‘𝑋))
77	68, 75, 76	syl2anc 596	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → {𝑎 ∈ 𝒫 𝑋 ∣ ∪ ((𝑏 ∈ 𝒫 𝑋 ↦ if(𝑏 = 𝑇, {𝐾}, ∅)) “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎} ∈ (ACS‘𝑋))
78	67, 77	eqeltrd 2860	1 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐾 ∈ 𝑋) ∧ (𝑇 ⊆ 𝑋 ∧ 𝑇 ∈ Fin)) → {𝑎 ∈ 𝒫 𝑋 ∣ (𝑇 ⊆ 𝑎 → 𝐾 ∈ 𝑎)} ∈ (ACS‘𝑋))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  {crab 3412   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  ifcif 4482  𝒫 cpw 4557  {csn 4584  ∪ cuni 4867  ∪ ciun 4951   ↦ cmpt 5186   “ cima 5658  Fun wfun 6527  ⟶wf 6529  ‘cfv 6533  Fincfn 8955  ACScacs 17672

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  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-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-mre 17673  df-acs 17676

This theorem is used by:  acsfn0  17751  acsfn1  17752  acsfn2  17754  acsfn1p  20968