Theorem uncmp 22011

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 765	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → 𝐽 ∈ Top)
2		simpll 765	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝐽 ∈ Top)
3		ssun1 4148	. . . . . . . . . 10 ⊢ 𝑆 ⊆ (𝑆 ∪ 𝑇)
4		sseq2 3993	. . . . . . . . . 10 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → (𝑆 ⊆ 𝑋 ↔ 𝑆 ⊆ (𝑆 ∪ 𝑇)))
5	3, 4	mpbiri 260	. . . . . . . . 9 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → 𝑆 ⊆ 𝑋)
6	5	ad2antlr 725	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑆 ⊆ 𝑋)
7		uncmp.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽
8	7	cmpsub 22008	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝐽 ↾t 𝑆) ∈ Comp ↔ ∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
9	2, 6, 8	syl2anc 586	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑆) ∈ Comp ↔ ∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
10		simprr 771	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑋 = ∪ 𝑐)
11	6, 10	sseqtrd 4007	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑆 ⊆ ∪ 𝑐)
12		unieq 4849	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑐 → ∪ 𝑚 = ∪ 𝑐)
13	12	sseq2d 3999	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑐 → (𝑆 ⊆ ∪ 𝑚 ↔ 𝑆 ⊆ ∪ 𝑐))
14		pweq 4555	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑐 → 𝒫 𝑚 = 𝒫 𝑐)
15	14	ineq1d 4188	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑐 → (𝒫 𝑚 ∩ Fin) = (𝒫 𝑐 ∩ Fin))
16	15	rexeqdv 3416	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑐 → (∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ↔ ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
17	13, 16	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑚 = 𝑐 → ((𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) ↔ (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
18	17	rspcv 3618	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝒫 𝐽 → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
19	18	ad2antrl 726	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
20	11, 19	mpid 44	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
21	9, 20	sylbid 242	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑆) ∈ Comp → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
22		ssun2 4149	. . . . . . . . . 10 ⊢ 𝑇 ⊆ (𝑆 ∪ 𝑇)
23		sseq2 3993	. . . . . . . . . 10 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → (𝑇 ⊆ 𝑋 ↔ 𝑇 ⊆ (𝑆 ∪ 𝑇)))
24	22, 23	mpbiri 260	. . . . . . . . 9 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → 𝑇 ⊆ 𝑋)
25	24	ad2antlr 725	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑇 ⊆ 𝑋)
26	7	cmpsub 22008	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((𝐽 ↾t 𝑇) ∈ Comp ↔ ∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
27	2, 25, 26	syl2anc 586	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑇) ∈ Comp ↔ ∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
28	25, 10	sseqtrd 4007	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑇 ⊆ ∪ 𝑐)
29		unieq 4849	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑐 → ∪ 𝑟 = ∪ 𝑐)
30	29	sseq2d 3999	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑐 → (𝑇 ⊆ ∪ 𝑟 ↔ 𝑇 ⊆ ∪ 𝑐))
31		pweq 4555	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑐 → 𝒫 𝑟 = 𝒫 𝑐)
32	31	ineq1d 4188	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑐 → (𝒫 𝑟 ∩ Fin) = (𝒫 𝑐 ∩ Fin))
33	32	rexeqdv 3416	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑐 → (∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠 ↔ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
34	30, 33	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑟 = 𝑐 → ((𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) ↔ (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
35	34	rspcv 3618	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝒫 𝐽 → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
36	35	ad2antrl 726	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
37	28, 36	mpid 44	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
38	27, 37	sylbid 242	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑇) ∈ Comp → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
39		reeanv 3367	. . . . . . 7 ⊢ (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)(𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) ↔ (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ∧ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
40		elinel1 4172	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ∈ 𝒫 𝑐)
41	40	elpwid 4550	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ⊆ 𝑐)
42		elinel1 4172	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ∈ 𝒫 𝑐)
43	42	elpwid 4550	. . . . . . . . . . . . . . 15 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ⊆ 𝑐)
44	41, 43	anim12i 614	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → (𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐))
45	44	ad2antrl 726	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐))
46		unss 4160	. . . . . . . . . . . . 13 ⊢ ((𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐) ↔ (𝑛 ∪ 𝑠) ⊆ 𝑐)
47	45, 46	sylib 220	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ⊆ 𝑐)
48		elinel2 4173	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ∈ Fin)
49		elinel2 4173	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ∈ Fin)
50		unfi 8785	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ Fin ∧ 𝑠 ∈ Fin) → (𝑛 ∪ 𝑠) ∈ Fin)
51	48, 49, 50	syl2an 597	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → (𝑛 ∪ 𝑠) ∈ Fin)
52	51	ad2antrl 726	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ∈ Fin)
53	47, 52	jca 514	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
54		elin 4169	. . . . . . . . . . . 12 ⊢ ((𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin) ↔ ((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
55		vex 3497	. . . . . . . . . . . . . 14 ⊢ 𝑐 ∈ V
56	55	elpw2 5248	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ↔ (𝑛 ∪ 𝑠) ⊆ 𝑐)
57	56	anbi1i 625	. . . . . . . . . . . 12 ⊢ (((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin) ↔ ((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
58	54, 57	bitr2i 278	. . . . . . . . . . 11 ⊢ (((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin) ↔ (𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin))
59	53, 58	sylib 220	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin))
60		simpllr 774	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 = (𝑆 ∪ 𝑇))
61		ssun3 4150	. . . . . . . . . . . . . . . 16 ⊢ (𝑆 ⊆ ∪ 𝑛 → 𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
62		ssun4 4151	. . . . . . . . . . . . . . . 16 ⊢ (𝑇 ⊆ ∪ 𝑠 → 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
63	61, 62	anim12i 614	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → (𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)))
64	63	ad2antll 727	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)))
65		unss 4160	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)) ↔ (𝑆 ∪ 𝑇) ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
66	64, 65	sylib 220	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑆 ∪ 𝑇) ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
67	60, 66	eqsstrd 4005	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
68		uniun 4861	. . . . . . . . . . . 12 ⊢ ∪ (𝑛 ∪ 𝑠) = (∪ 𝑛 ∪ ∪ 𝑠)
69	67, 68	sseqtrrdi 4018	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 ⊆ ∪ (𝑛 ∪ 𝑠))
70		elpwi 4548	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ 𝒫 𝐽 → 𝑐 ⊆ 𝐽)
71	70	adantr 483	. . . . . . . . . . . . . 14 ⊢ ((𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐) → 𝑐 ⊆ 𝐽)
72	71	ad2antlr 725	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑐 ⊆ 𝐽)
73	47, 72	sstrd 3977	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ⊆ 𝐽)
74		uniss 4846	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∪ 𝑠) ⊆ 𝐽 → ∪ (𝑛 ∪ 𝑠) ⊆ ∪ 𝐽)
75	74, 7	sseqtrrdi 4018	. . . . . . . . . . . 12 ⊢ ((𝑛 ∪ 𝑠) ⊆ 𝐽 → ∪ (𝑛 ∪ 𝑠) ⊆ 𝑋)
76	73, 75	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ∪ (𝑛 ∪ 𝑠) ⊆ 𝑋)
77	69, 76	eqssd 3984	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 = ∪ (𝑛 ∪ 𝑠))
78		unieq 4849	. . . . . . . . . . 11 ⊢ (𝑑 = (𝑛 ∪ 𝑠) → ∪ 𝑑 = ∪ (𝑛 ∪ 𝑠))
79	78	rspceeqv 3638	. . . . . . . . . 10 ⊢ (((𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑋 = ∪ (𝑛 ∪ 𝑠)) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)
80	59, 77, 79	syl2anc 586	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)
81	80	exp32 423	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → ((𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
82	81	rexlimdvv 3293	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)(𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
83	39, 82	syl5bir 245	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ∧ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
84	21, 38, 83	syl2and 609	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
85	84	impancom 454	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → ((𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
86	85	expd 418	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → (𝑐 ∈ 𝒫 𝐽 → (𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
87	86	ralrimiv 3181	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
88	7	iscmp 21996	. 2 ⊢ (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
89	1, 87, 88	sylanbrc 585	1 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → 𝐽 ∈ Comp)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ∀wral 3138  ∃wrex 3139   ∪ cun 3934   ∩ cin 3935   ⊆ wss 3936  𝒫 cpw 4539  ∪ cuni 4838  (class class class)co 7156  Fincfn 8509   ↾_t crest 16694  Topctop 21501  Compccmp 21994

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-oadd 8106  df-er 8289  df-en 8510  df-dom 8511  df-fin 8513  df-fi 8875  df-rest 16696  df-topgen 16717  df-top 21502  df-topon 21519  df-bases 21554  df-cmp 21995

This theorem is referenced by:  fiuncmp  22012