Theorem uncmp 22008

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 766	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → 𝐽 ∈ Top)
2		simpll 766	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝐽 ∈ Top)
3		ssun1 4099	. . . . . . . . . 10 ⊢ 𝑆 ⊆ (𝑆 ∪ 𝑇)
4		sseq2 3941	. . . . . . . . . 10 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → (𝑆 ⊆ 𝑋 ↔ 𝑆 ⊆ (𝑆 ∪ 𝑇)))
5	3, 4	mpbiri 261	. . . . . . . . 9 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → 𝑆 ⊆ 𝑋)
6	5	ad2antlr 726	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑆 ⊆ 𝑋)
7		uncmp.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝐽
8	7	cmpsub 22005	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝐽 ↾t 𝑆) ∈ Comp ↔ ∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
9	2, 6, 8	syl2anc 587	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑆) ∈ Comp ↔ ∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
10		simprr 772	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑋 = ∪ 𝑐)
11	6, 10	sseqtrd 3955	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑆 ⊆ ∪ 𝑐)
12		unieq 4811	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑐 → ∪ 𝑚 = ∪ 𝑐)
13	12	sseq2d 3947	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑐 → (𝑆 ⊆ ∪ 𝑚 ↔ 𝑆 ⊆ ∪ 𝑐))
14		pweq 4513	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑐 → 𝒫 𝑚 = 𝒫 𝑐)
15	14	ineq1d 4138	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑐 → (𝒫 𝑚 ∩ Fin) = (𝒫 𝑐 ∩ Fin))
16	15	rexeqdv 3365	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑐 → (∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ↔ ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
17	13, 16	imbi12d 348	. . . . . . . . . 10 ⊢ (𝑚 = 𝑐 → ((𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) ↔ (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
18	17	rspcv 3566	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝒫 𝐽 → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
19	18	ad2antrl 727	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → (𝑆 ⊆ ∪ 𝑐 → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛)))
20	11, 19	mpid 44	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑚 ∈ 𝒫 𝐽(𝑆 ⊆ ∪ 𝑚 → ∃𝑛 ∈ (𝒫 𝑚 ∩ Fin)𝑆 ⊆ ∪ 𝑛) → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
21	9, 20	sylbid 243	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑆) ∈ Comp → ∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛))
22		ssun2 4100	. . . . . . . . . 10 ⊢ 𝑇 ⊆ (𝑆 ∪ 𝑇)
23		sseq2 3941	. . . . . . . . . 10 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → (𝑇 ⊆ 𝑋 ↔ 𝑇 ⊆ (𝑆 ∪ 𝑇)))
24	22, 23	mpbiri 261	. . . . . . . . 9 ⊢ (𝑋 = (𝑆 ∪ 𝑇) → 𝑇 ⊆ 𝑋)
25	24	ad2antlr 726	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑇 ⊆ 𝑋)
26	7	cmpsub 22005	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((𝐽 ↾t 𝑇) ∈ Comp ↔ ∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
27	2, 25, 26	syl2anc 587	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑇) ∈ Comp ↔ ∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
28	25, 10	sseqtrd 3955	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → 𝑇 ⊆ ∪ 𝑐)
29		unieq 4811	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑐 → ∪ 𝑟 = ∪ 𝑐)
30	29	sseq2d 3947	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑐 → (𝑇 ⊆ ∪ 𝑟 ↔ 𝑇 ⊆ ∪ 𝑐))
31		pweq 4513	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑐 → 𝒫 𝑟 = 𝒫 𝑐)
32	31	ineq1d 4138	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑐 → (𝒫 𝑟 ∩ Fin) = (𝒫 𝑐 ∩ Fin))
33	32	rexeqdv 3365	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑐 → (∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠 ↔ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
34	30, 33	imbi12d 348	. . . . . . . . . 10 ⊢ (𝑟 = 𝑐 → ((𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) ↔ (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
35	34	rspcv 3566	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝒫 𝐽 → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
36	35	ad2antrl 727	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → (𝑇 ⊆ ∪ 𝑐 → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠)))
37	28, 36	mpid 44	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∀𝑟 ∈ 𝒫 𝐽(𝑇 ⊆ ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
38	27, 37	sylbid 243	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝐽 ↾t 𝑇) ∈ Comp → ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
39		reeanv 3320	. . . . . . 7 ⊢ (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)(𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) ↔ (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ∧ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠))
40		elinel1 4122	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ∈ 𝒫 𝑐)
41	40	elpwid 4508	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ⊆ 𝑐)
42		elinel1 4122	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ∈ 𝒫 𝑐)
43	42	elpwid 4508	. . . . . . . . . . . . . . 15 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ⊆ 𝑐)
44	41, 43	anim12i 615	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → (𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐))
45	44	ad2antrl 727	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐))
46		unss 4111	. . . . . . . . . . . . 13 ⊢ ((𝑛 ⊆ 𝑐 ∧ 𝑠 ⊆ 𝑐) ↔ (𝑛 ∪ 𝑠) ⊆ 𝑐)
47	45, 46	sylib 221	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ⊆ 𝑐)
48		elinel2 4123	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (𝒫 𝑐 ∩ Fin) → 𝑛 ∈ Fin)
49		elinel2 4123	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ (𝒫 𝑐 ∩ Fin) → 𝑠 ∈ Fin)
50		unfi 8769	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ Fin ∧ 𝑠 ∈ Fin) → (𝑛 ∪ 𝑠) ∈ Fin)
51	48, 49, 50	syl2an 598	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → (𝑛 ∪ 𝑠) ∈ Fin)
52	51	ad2antrl 727	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ∈ Fin)
53	47, 52	jca 515	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
54		elin 3897	. . . . . . . . . . . 12 ⊢ ((𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin) ↔ ((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
55		vex 3444	. . . . . . . . . . . . . 14 ⊢ 𝑐 ∈ V
56	55	elpw2 5212	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ↔ (𝑛 ∪ 𝑠) ⊆ 𝑐)
57	56	anbi1i 626	. . . . . . . . . . . 12 ⊢ (((𝑛 ∪ 𝑠) ∈ 𝒫 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin) ↔ ((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin))
58	54, 57	bitr2i 279	. . . . . . . . . . 11 ⊢ (((𝑛 ∪ 𝑠) ⊆ 𝑐 ∧ (𝑛 ∪ 𝑠) ∈ Fin) ↔ (𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin))
59	53, 58	sylib 221	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin))
60		simpllr 775	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 = (𝑆 ∪ 𝑇))
61		ssun3 4101	. . . . . . . . . . . . . . . 16 ⊢ (𝑆 ⊆ ∪ 𝑛 → 𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
62		ssun4 4102	. . . . . . . . . . . . . . . 16 ⊢ (𝑇 ⊆ ∪ 𝑠 → 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
63	61, 62	anim12i 615	. . . . . . . . . . . . . . 15 ⊢ ((𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → (𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)))
64	63	ad2antll 728	. . . . . . . . . . . . . 14 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)))
65		unss 4111	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ⊆ (∪ 𝑛 ∪ ∪ 𝑠) ∧ 𝑇 ⊆ (∪ 𝑛 ∪ ∪ 𝑠)) ↔ (𝑆 ∪ 𝑇) ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
66	64, 65	sylib 221	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑆 ∪ 𝑇) ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
67	60, 66	eqsstrd 3953	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 ⊆ (∪ 𝑛 ∪ ∪ 𝑠))
68		uniun 4823	. . . . . . . . . . . 12 ⊢ ∪ (𝑛 ∪ 𝑠) = (∪ 𝑛 ∪ ∪ 𝑠)
69	67, 68	sseqtrrdi 3966	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 ⊆ ∪ (𝑛 ∪ 𝑠))
70		elpwi 4506	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ 𝒫 𝐽 → 𝑐 ⊆ 𝐽)
71	70	adantr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐) → 𝑐 ⊆ 𝐽)
72	71	ad2antlr 726	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑐 ⊆ 𝐽)
73	47, 72	sstrd 3925	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → (𝑛 ∪ 𝑠) ⊆ 𝐽)
74		uniss 4808	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∪ 𝑠) ⊆ 𝐽 → ∪ (𝑛 ∪ 𝑠) ⊆ ∪ 𝐽)
75	74, 7	sseqtrrdi 3966	. . . . . . . . . . . 12 ⊢ ((𝑛 ∪ 𝑠) ⊆ 𝐽 → ∪ (𝑛 ∪ 𝑠) ⊆ 𝑋)
76	73, 75	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ∪ (𝑛 ∪ 𝑠) ⊆ 𝑋)
77	69, 76	eqssd 3932	. . . . . . . . . 10 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → 𝑋 = ∪ (𝑛 ∪ 𝑠))
78		unieq 4811	. . . . . . . . . . 11 ⊢ (𝑑 = (𝑛 ∪ 𝑠) → ∪ 𝑑 = ∪ (𝑛 ∪ 𝑠))
79	78	rspceeqv 3586	. . . . . . . . . 10 ⊢ (((𝑛 ∪ 𝑠) ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑋 = ∪ (𝑛 ∪ 𝑠)) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)
80	59, 77, 79	syl2anc 587	. . . . . . . . 9 ⊢ ((((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) ∧ ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) ∧ (𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠))) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)
81	80	exp32 424	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((𝑛 ∈ (𝒫 𝑐 ∩ Fin) ∧ 𝑠 ∈ (𝒫 𝑐 ∩ Fin)) → ((𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
82	81	rexlimdvv 3252	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)(𝑆 ⊆ ∪ 𝑛 ∧ 𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
83	39, 82	syl5bir 246	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → ((∃𝑛 ∈ (𝒫 𝑐 ∩ Fin)𝑆 ⊆ ∪ 𝑛 ∧ ∃𝑠 ∈ (𝒫 𝑐 ∩ Fin)𝑇 ⊆ ∪ 𝑠) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
84	21, 38, 83	syl2and 610	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ (𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐)) → (((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
85	84	impancom 455	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → ((𝑐 ∈ 𝒫 𝐽 ∧ 𝑋 = ∪ 𝑐) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
86	85	expd 419	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → (𝑐 ∈ 𝒫 𝐽 → (𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
87	86	ralrimiv 3148	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
88	7	iscmp 21993	. 2 ⊢ (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
89	1, 87, 88	sylanbrc 586	1 ⊢ (((𝐽 ∈ Top ∧ 𝑋 = (𝑆 ∪ 𝑇)) ∧ ((𝐽 ↾t 𝑆) ∈ Comp ∧ (𝐽 ↾t 𝑇) ∈ Comp)) → 𝐽 ∈ Comp)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  ∃wrex 3107   ∪ cun 3879   ∩ cin 3880   ⊆ wss 3881  𝒫 cpw 4497  ∪ cuni 4800  (class class class)co 7135  Fincfn 8492   ↾_t crest 16686  Topctop 21498  Compccmp 21991

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-en 8493  df-dom 8494  df-fin 8496  df-fi 8859  df-rest 16688  df-topgen 16709  df-top 21499  df-topon 21516  df-bases 21551  df-cmp 21992

This theorem is referenced by:  fiuncmp  22009