Theorem filconn 23234

Description: A filter gives rise to a connected topology. (Contributed by Jeff Hankins, 6-Dec-2009.) (Revised by Stefan O'Rear, 2-Aug-2015.)

Assertion

Ref	Expression
filconn	⊢ (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ {∅}) ∈ Conn)

Proof of Theorem filconn

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 22	. . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
2		filunibas 23232	. . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋)
3	2	fveq2d 6846	. . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (Fil‘∪ 𝐹) = (Fil‘𝑋))
4	1, 3	eleqtrrd 2841	. 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (Fil‘∪ 𝐹))
5		nss 4006	. . . . . . . 8 ⊢ (¬ 𝑥 ⊆ {∅} ↔ ∃𝑦(𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅}))
6		simpll 765	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → 𝐹 ∈ (Fil‘∪ 𝐹))
7		ssel2 3939	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ⊆ (𝐹 ∪ {∅}) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ (𝐹 ∪ {∅}))
8	7	adantll 712	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ (𝐹 ∪ {∅}))
9		elun 4108	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ (𝐹 ∪ {∅}) ↔ (𝑦 ∈ 𝐹 ∨ 𝑦 ∈ {∅}))
10	8, 9	sylib 217	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → (𝑦 ∈ 𝐹 ∨ 𝑦 ∈ {∅}))
11	10	orcomd 869	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → (𝑦 ∈ {∅} ∨ 𝑦 ∈ 𝐹))
12	11	ord 862	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → (¬ 𝑦 ∈ {∅} → 𝑦 ∈ 𝐹))
13	12	impr 455	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → 𝑦 ∈ 𝐹)
14		uniss 4873	. . . . . . . . . . . . . 14 ⊢ (𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ⊆ ∪ (𝐹 ∪ {∅}))
15	14	ad2antlr 725	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ⊆ ∪ (𝐹 ∪ {∅}))
16		uniun 4891	. . . . . . . . . . . . . 14 ⊢ ∪ (𝐹 ∪ {∅}) = (∪ 𝐹 ∪ ∪ {∅})
17		0ex 5264	. . . . . . . . . . . . . . . 16 ⊢ ∅ ∈ V
18	17	unisn 4887	. . . . . . . . . . . . . . 15 ⊢ ∪ {∅} = ∅
19	18	uneq2i 4120	. . . . . . . . . . . . . 14 ⊢ (∪ 𝐹 ∪ ∪ {∅}) = (∪ 𝐹 ∪ ∅)
20		un0 4350	. . . . . . . . . . . . . 14 ⊢ (∪ 𝐹 ∪ ∅) = ∪ 𝐹
21	16, 19, 20	3eqtrri 2769	. . . . . . . . . . . . 13 ⊢ ∪ 𝐹 = ∪ (𝐹 ∪ {∅})
22	15, 21	sseqtrrdi 3995	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ⊆ ∪ 𝐹)
23		elssuni 4898	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑥 → 𝑦 ⊆ ∪ 𝑥)
24	23	ad2antrl 726	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → 𝑦 ⊆ ∪ 𝑥)
25		filss 23204	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ (𝑦 ∈ 𝐹 ∧ ∪ 𝑥 ⊆ ∪ 𝐹 ∧ 𝑦 ⊆ ∪ 𝑥)) → ∪ 𝑥 ∈ 𝐹)
26	6, 13, 22, 24, 25	syl13anc 1372	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ∈ 𝐹)
27		elun1 4136	. . . . . . . . . . 11 ⊢ (∪ 𝑥 ∈ 𝐹 → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
28	26, 27	syl 17	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
29	28	ex 413	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → ((𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
30	29	exlimdv 1936	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → (∃𝑦(𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
31	5, 30	biimtrid 241	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → (¬ 𝑥 ⊆ {∅} → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
32		uni0b 4894	. . . . . . . 8 ⊢ (∪ 𝑥 = ∅ ↔ 𝑥 ⊆ {∅})
33		ssun2 4133	. . . . . . . . . 10 ⊢ {∅} ⊆ (𝐹 ∪ {∅})
34	17	snid 4622	. . . . . . . . . 10 ⊢ ∅ ∈ {∅}
35	33, 34	sselii 3941	. . . . . . . . 9 ⊢ ∅ ∈ (𝐹 ∪ {∅})
36		eleq1 2825	. . . . . . . . 9 ⊢ (∪ 𝑥 = ∅ → (∪ 𝑥 ∈ (𝐹 ∪ {∅}) ↔ ∅ ∈ (𝐹 ∪ {∅})))
37	35, 36	mpbiri 257	. . . . . . . 8 ⊢ (∪ 𝑥 = ∅ → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
38	32, 37	sylbir 234	. . . . . . 7 ⊢ (𝑥 ⊆ {∅} → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
39	31, 38	pm2.61d2 181	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
40	39	ex 413	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
41	40	alrimiv 1930	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ∀𝑥(𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
42		filin 23205	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ∩ 𝑦) ∈ 𝐹)
43		elun1 4136	. . . . . . . . . 10 ⊢ ((𝑥 ∩ 𝑦) ∈ 𝐹 → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
44	42, 43	syl 17	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
45	44	3expa 1118	. . . . . . . 8 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) ∧ 𝑦 ∈ 𝐹) → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
46	45	ralrimiva 3143	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
47		elsni 4603	. . . . . . . . 9 ⊢ (𝑦 ∈ {∅} → 𝑦 = ∅)
48		ineq2 4166	. . . . . . . . . . 11 ⊢ (𝑦 = ∅ → (𝑥 ∩ 𝑦) = (𝑥 ∩ ∅))
49		in0 4351	. . . . . . . . . . 11 ⊢ (𝑥 ∩ ∅) = ∅
50	48, 49	eqtrdi 2792	. . . . . . . . . 10 ⊢ (𝑦 = ∅ → (𝑥 ∩ 𝑦) = ∅)
51	50, 35	eqeltrdi 2846	. . . . . . . . 9 ⊢ (𝑦 = ∅ → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
52	47, 51	syl 17	. . . . . . . 8 ⊢ (𝑦 ∈ {∅} → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
53	52	rgen 3066	. . . . . . 7 ⊢ ∀𝑦 ∈ {∅} (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})
54		ralun 4152	. . . . . . 7 ⊢ ((∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}) ∧ ∀𝑦 ∈ {∅} (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})) → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
55	46, 53, 54	sylancl 586	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
56	55	ralrimiva 3143	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
57		elsni 4603	. . . . . . 7 ⊢ (𝑥 ∈ {∅} → 𝑥 = ∅)
58		ineq1 4165	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → (𝑥 ∩ 𝑦) = (∅ ∩ 𝑦))
59		0in 4353	. . . . . . . . . 10 ⊢ (∅ ∩ 𝑦) = ∅
60	58, 59	eqtrdi 2792	. . . . . . . . 9 ⊢ (𝑥 = ∅ → (𝑥 ∩ 𝑦) = ∅)
61	60, 35	eqeltrdi 2846	. . . . . . . 8 ⊢ (𝑥 = ∅ → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
62	61	ralrimivw 3147	. . . . . . 7 ⊢ (𝑥 = ∅ → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
63	57, 62	syl 17	. . . . . 6 ⊢ (𝑥 ∈ {∅} → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
64	63	rgen 3066	. . . . 5 ⊢ ∀𝑥 ∈ {∅}∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})
65		ralun 4152	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐹 ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}) ∧ ∀𝑥 ∈ {∅}∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})) → ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
66	56, 64, 65	sylancl 586	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
67		p0ex 5339	. . . . . 6 ⊢ {∅} ∈ V
68		unexg 7683	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ {∅} ∈ V) → (𝐹 ∪ {∅}) ∈ V)
69	67, 68	mpan2 689	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝐹 ∪ {∅}) ∈ V)
70		istopg 22244	. . . . 5 ⊢ ((𝐹 ∪ {∅}) ∈ V → ((𝐹 ∪ {∅}) ∈ Top ↔ (∀𝑥(𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})) ∧ ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))))
71	69, 70	syl 17	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝐹 ∪ {∅}) ∈ Top ↔ (∀𝑥(𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})) ∧ ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))))
72	41, 66, 71	mpbir2and 711	. . 3 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝐹 ∪ {∅}) ∈ Top)
73	21	cldopn 22382	. . . . . . . 8 ⊢ (𝑥 ∈ (Clsd‘(𝐹 ∪ {∅})) → (∪ 𝐹 ∖ 𝑥) ∈ (𝐹 ∪ {∅}))
74		elun 4108	. . . . . . . 8 ⊢ ((∪ 𝐹 ∖ 𝑥) ∈ (𝐹 ∪ {∅}) ↔ ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 ∨ (∪ 𝐹 ∖ 𝑥) ∈ {∅}))
75	73, 74	sylib 217	. . . . . . 7 ⊢ (𝑥 ∈ (Clsd‘(𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 ∨ (∪ 𝐹 ∖ 𝑥) ∈ {∅}))
76		elun 4108	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹 ∪ {∅}) ↔ (𝑥 ∈ 𝐹 ∨ 𝑥 ∈ {∅}))
77		filfbas 23199	. . . . . . . . . . . . . 14 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → 𝐹 ∈ (fBas‘∪ 𝐹))
78		fbncp 23190	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ∈ (fBas‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ¬ (∪ 𝐹 ∖ 𝑥) ∈ 𝐹)
79	77, 78	sylan 580	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ¬ (∪ 𝐹 ∖ 𝑥) ∈ 𝐹)
80	79	pm2.21d 121	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅))
81	80	ex 413	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ 𝐹 → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
82	57	a1i13 27	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ {∅} → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
83	81, 82	jaod 857	. . . . . . . . . 10 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝑥 ∈ 𝐹 ∨ 𝑥 ∈ {∅}) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
84	76, 83	biimtrid 241	. . . . . . . . 9 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ (𝐹 ∪ {∅}) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
85	84	imp 407	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅))
86		elsni 4603	. . . . . . . . 9 ⊢ ((∪ 𝐹 ∖ 𝑥) ∈ {∅} → (∪ 𝐹 ∖ 𝑥) = ∅)
87		elssuni 4898	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐹 ∪ {∅}) → 𝑥 ⊆ ∪ (𝐹 ∪ {∅}))
88	87, 21	sseqtrrdi 3995	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐹 ∪ {∅}) → 𝑥 ⊆ ∪ 𝐹)
89	88	adantl 482	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → 𝑥 ⊆ ∪ 𝐹)
90		ssdif0 4323	. . . . . . . . . . 11 ⊢ (∪ 𝐹 ⊆ 𝑥 ↔ (∪ 𝐹 ∖ 𝑥) = ∅)
91	90	biimpri 227	. . . . . . . . . 10 ⊢ ((∪ 𝐹 ∖ 𝑥) = ∅ → ∪ 𝐹 ⊆ 𝑥)
92		eqss 3959	. . . . . . . . . . 11 ⊢ (𝑥 = ∪ 𝐹 ↔ (𝑥 ⊆ ∪ 𝐹 ∧ ∪ 𝐹 ⊆ 𝑥))
93	92	simplbi2 501	. . . . . . . . . 10 ⊢ (𝑥 ⊆ ∪ 𝐹 → (∪ 𝐹 ⊆ 𝑥 → 𝑥 = ∪ 𝐹))
94	89, 91, 93	syl2im 40	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) = ∅ → 𝑥 = ∪ 𝐹))
95	86, 94	syl5 34	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) ∈ {∅} → 𝑥 = ∪ 𝐹))
96	85, 95	orim12d 963	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → (((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 ∨ (∪ 𝐹 ∖ 𝑥) ∈ {∅}) → (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹)))
97	75, 96	syl5 34	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → (𝑥 ∈ (Clsd‘(𝐹 ∪ {∅})) → (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹)))
98	97	expimpd 454	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝑥 ∈ (𝐹 ∪ {∅}) ∧ 𝑥 ∈ (Clsd‘(𝐹 ∪ {∅}))) → (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹)))
99		elin 3926	. . . . 5 ⊢ (𝑥 ∈ ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) ↔ (𝑥 ∈ (𝐹 ∪ {∅}) ∧ 𝑥 ∈ (Clsd‘(𝐹 ∪ {∅}))))
100		vex 3449	. . . . . 6 ⊢ 𝑥 ∈ V
101	100	elpr 4609	. . . . 5 ⊢ (𝑥 ∈ {∅, ∪ 𝐹} ↔ (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹))
102	98, 99, 101	3imtr4g 295	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) → 𝑥 ∈ {∅, ∪ 𝐹}))
103	102	ssrdv 3950	. . 3 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) ⊆ {∅, ∪ 𝐹})
104	21	isconn2 22765	. . 3 ⊢ ((𝐹 ∪ {∅}) ∈ Conn ↔ ((𝐹 ∪ {∅}) ∈ Top ∧ ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) ⊆ {∅, ∪ 𝐹}))
105	72, 103, 104	sylanbrc 583	. 2 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝐹 ∪ {∅}) ∈ Conn)
106	4, 105	syl 17	1 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ {∅}) ∈ Conn)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   ∧ w3a 1087  ∀wal 1539   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∀wral 3064  Vcvv 3445   ∖ cdif 3907   ∪ cun 3908   ∩ cin 3909   ⊆ wss 3910  ∅c0 4282  {csn 4586  {cpr 4588  ∪ cuni 4865  ‘cfv 6496  fBascfbas 20784  Topctop 22242  Clsdccld 22367  Conncconn 22762  Filcfil 23196

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-fv 6504  df-fbas 20793  df-top 22243  df-cld 22370  df-conn 22763  df-fil 23197

This theorem is referenced by:  ufildr  23282