Theorem uncmp 21626

Description: The union of two compact sets is compact. (Contributed by Jeff Hankins, 30-Jan-2010.)

Hypothesis

Ref	Expression
uncmp.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
uncmp	⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → 𝐽 ∈ Comp)

Proof of Theorem uncmp

Dummy variables 𝑐 𝑑 𝑚 𝑛 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 757	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → 𝐽 ∈ Top)
2		simpll 757	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝐽 ∈ Top)
3		ssun1 3999	. . . . . . . . . 10 ⊢ 𝑆 ⊆ (𝑆 ∪ 𝑇)
4		sseq2 3846	. . . . . . . . . 10 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → (𝑆 ⊆ 𝑋 ↔ 𝑆 ⊆ (𝑆 ∪ 𝑇)))
5	3, 4	mpbiri 250	. . . . . . . . 9 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → 𝑆 ⊆ 𝑋)
6	5	ad2antlr 717	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑆 ⊆ 𝑋)
7		uncmp.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽
8	7	cmpsub 21623	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝐽 ↾t 𝑆) ∈ Comp ↔ ∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
9	2, 6, 8	syl2anc 579	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑆) ∈ Comp ↔ ∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
10		simprr 763	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑋 = ∪ 𝑐)
11	6, 10	sseqtrd 3860	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑆 ⊆ ∪ 𝑐)
12		unieq 4681	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑐 → ∪ 𝑚 = ∪ 𝑐)
13	12	sseq2d 3852	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑐 → (𝑆 ⊆ ∪ 𝑚 ↔ 𝑆 ⊆ ∪ 𝑐))
14		pweq 4382	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑐 → 𝒫 𝑚 = 𝒫 𝑐)
15	14	ineq1d 4036	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑐 → (𝒫 𝑚 ∩ Fin) = (𝒫 𝑐 ∩ Fin))
16	15	rexeqdv 3341	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑐 → (∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ↔ ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
17	13, 16	imbi12d 336	. . . . . . . . . 10 ⊢ (𝑚 = 𝑐 → ((𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) ↔ (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
18	17	rspcv 3507	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝒫 𝐽 → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
19	18	ad2antrl 718	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
20	11, 19	mpid 44	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
21	9, 20	sylbid 232	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑆) ∈ Comp → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
22		ssun2 4000	. . . . . . . . . 10 ⊢ 𝑇 ⊆ (𝑆 ∪ 𝑇)
23		sseq2 3846	. . . . . . . . . 10 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → (𝑇 ⊆ 𝑋 ↔ 𝑇 ⊆ (𝑆 ∪ 𝑇)))
24	22, 23	mpbiri 250	. . . . . . . . 9 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → 𝑇 ⊆ 𝑋)
25	24	ad2antlr 717	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑇 ⊆ 𝑋)
26	7	cmpsub 21623	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((𝐽 ↾t 𝑇) ∈ Comp ↔ ∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
27	2, 25, 26	syl2anc 579	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑇) ∈ Comp ↔ ∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
28	25, 10	sseqtrd 3860	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑇 ⊆ ∪ 𝑐)
29		unieq 4681	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑐 → ∪ 𝑟 = ∪ 𝑐)
30	29	sseq2d 3852	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑐 → (𝑇 ⊆ ∪ 𝑟 ↔ 𝑇 ⊆ ∪ 𝑐))
31		pweq 4382	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑐 → 𝒫 𝑟 = 𝒫 𝑐)
32	31	ineq1d 4036	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑐 → (𝒫 𝑟 ∩ Fin) = (𝒫 𝑐 ∩ Fin))
33	32	rexeqdv 3341	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑐 → (∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠 ↔ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
34	30, 33	imbi12d 336	. . . . . . . . . 10 ⊢ (𝑟 = 𝑐 → ((𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) ↔ (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
35	34	rspcv 3507	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝒫 𝐽 → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
36	35	ad2antrl 718	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
37	28, 36	mpid 44	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
38	27, 37	sylbid 232	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑇) ∈ Comp → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
39		reeanv 3293	. . . . . . 7 ⊢ (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)(𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) ↔ (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ∧ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
40		elinel1 4022	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ∈ 𝒫 𝑐)
41	40	elpwid 4391	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ⊆ 𝑐)
42		elinel1 4022	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ∈ 𝒫 𝑐)
43	42	elpwid 4391	. . . . . . . . . . . . . . 15 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ⊆ 𝑐)
44	41, 43	anim12i 606	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → (𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐))
45	44	ad2antrl 718	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐))
46		unss 4010	. . . . . . . . . . . . 13 ⊢ ((𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐) ↔ (𝑛 ∪ 𝑠) ⊆ 𝑐)
47	45, 46	sylib 210	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ⊆ 𝑐)
48		elinel2 4023	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ∈ Fin)
49		elinel2 4023	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ∈ Fin)
50		unfi 8517	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ Fin ∧ 𝑠 ∈ Fin) → (𝑛 ∪ 𝑠) ∈ Fin)
51	48, 49, 50	syl2an 589	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → (𝑛 ∪ 𝑠) ∈ Fin)
52	51	ad2antrl 718	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ∈ Fin)
53	47, 52	jca 507	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
54		elin 4019	. . . . . . . . . . . 12 ⊢ ((𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin) ↔ ((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
55		vex 3401	. . . . . . . . . . . . . 14 ⊢ 𝑐 ∈ V
56	55	elpw2 5064	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ↔ (𝑛 ∪ 𝑠) ⊆ 𝑐)
57	56	anbi1i 617	. . . . . . . . . . . 12 ⊢ (((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin) ↔ ((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
58	54, 57	bitr2i 268	. . . . . . . . . . 11 ⊢ (((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin) ↔ (𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin))
59	53, 58	sylib 210	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin))
60		simpllr 766	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 = (𝑆 ∪ 𝑇))
61		ssun3 4001	. . . . . . . . . . . . . . . 16 ⊢ (𝑆 ⊆ ∪ 𝑛 → 𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
62		ssun4 4002	. . . . . . . . . . . . . . . 16 ⊢ (𝑇 ⊆ ∪ 𝑠 → 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
63	61, 62	anim12i 606	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → (𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)))
64	63	ad2antll 719	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)))
65		unss 4010	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)) ↔ (𝑆 ∪ 𝑇) ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
66	64, 65	sylib 210	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑆 ∪ 𝑇) ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
67	60, 66	eqsstrd 3858	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
68		uniun 4694	. . . . . . . . . . . 12 ⊢ ∪ (𝑛 ∪ 𝑠) = (∪ 𝑛 ∪ ∪ 𝑠)
69	67, 68	syl6sseqr 3871	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 ⊆ ∪ (𝑛 ∪ 𝑠))
70		elpwi 4389	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ 𝒫 𝐽 → 𝑐 ⊆ 𝐽)
71	70	adantr 474	. . . . . . . . . . . . . 14 ⊢ ((𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐) → 𝑐 ⊆ 𝐽)
72	71	ad2antlr 717	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑐 ⊆ 𝐽)
73	47, 72	sstrd 3831	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ⊆ 𝐽)
74		uniss 4696	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∪ 𝑠) ⊆ 𝐽 → ∪ (𝑛 ∪ 𝑠) ⊆ ∪ 𝐽)
75	74, 7	syl6sseqr 3871	. . . . . . . . . . . 12 ⊢ ((𝑛 ∪ 𝑠) ⊆ 𝐽 → ∪ (𝑛 ∪ 𝑠) ⊆ 𝑋)
76	73, 75	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ∪ (𝑛 ∪ 𝑠) ⊆ 𝑋)
77	69, 76	eqssd 3838	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 = ∪ (𝑛 ∪ 𝑠))
78		unieq 4681	. . . . . . . . . . 11 ⊢ (𝑑 = (𝑛 ∪ 𝑠) → ∪ 𝑑 = ∪ (𝑛 ∪ 𝑠))
79	78	rspceeqv 3529	. . . . . . . . . 10 ⊢ (((𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑋 = ∪ (𝑛 ∪ 𝑠)) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)
80	59, 77, 79	syl2anc 579	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)
81	80	exp32 413	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → ((𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
82	81	rexlimdvv 3220	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)(𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
83	39, 82	syl5bir 235	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ∧ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
84	21, 38, 83	syl2and 601	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
85	84	impancom 445	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → ((𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
86	85	expd 406	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → (𝑐 ∈ 𝒫 𝐽 → (𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
87	86	ralrimiv 3147	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
88	7	iscmp 21611	. 2 ⊢ (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
89	1, 87, 88	sylanbrc 578	1 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → 𝐽 ∈ Comp)

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   = wceq 1601   ∈ wcel 2107  ∀wral 3090  ∃wrex 3091   ∪ cun 3790   ∩ cin 3791   ⊆ wss 3792  𝒫 cpw 4379  ∪ cuni 4673  (class class class)co 6924  Fincfn 8243   ↾_t crest 16478  Topctop 21116  Compccmp 21609

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-rep 5008  ax-sep 5019  ax-nul 5027  ax-pow 5079  ax-pr 5140  ax-un 7228

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3or 1072  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-pss 3808  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-tp 4403  df-op 4405  df-uni 4674  df-int 4713  df-iun 4757  df-br 4889  df-opab 4951  df-mpt 4968  df-tr 4990  df-id 5263  df-eprel 5268  df-po 5276  df-so 5277  df-fr 5316  df-we 5318  df-xp 5363  df-rel 5364  df-cnv 5365  df-co 5366  df-dm 5367  df-rn 5368  df-res 5369  df-ima 5370  df-pred 5935  df-ord 5981  df-on 5982  df-lim 5983  df-suc 5984  df-iota 6101  df-fun 6139  df-fn 6140  df-f 6141  df-f1 6142  df-fo 6143  df-f1o 6144  df-fv 6145  df-ov 6927  df-oprab 6928  df-mpt2 6929  df-om 7346  df-1st 7447  df-2nd 7448  df-wrecs 7691  df-recs 7753  df-rdg 7791  df-1o 7845  df-oadd 7849  df-er 8028  df-en 8244  df-dom 8245  df-fin 8247  df-fi 8607  df-rest 16480  df-topgen 16501  df-top 21117  df-topon 21134  df-bases 21169  df-cmp 21610

This theorem is referenced by:  fiuncmp  21627