Theorem filconn 24009

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 23	. . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (Fil‘𝑋))
2		filunibas 24007	. . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋)
3	2	fveq2d 6886	. . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (Fil‘∪ 𝐹) = (Fil‘𝑋))
4	1, 3	eleqtrrd 2872	. 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (Fil‘∪ 𝐹))
5		nss 4009	. . . . . . . 8 ⊢ (¬ 𝑥 ⊆ {∅} ↔ ∃𝑦(𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅}))
6		simpll 778	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → 𝐹 ∈ (Fil‘∪ 𝐹))
7		ssel2 3940	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ⊆ (𝐹 ∪ {∅}) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ (𝐹 ∪ {∅}))
8	7	adantll 726	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ (𝐹 ∪ {∅}))
9		elun 4115	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ (𝐹 ∪ {∅}) ↔ (𝑦 ∈ 𝐹 ∨ 𝑦 ∈ {∅}))
10	8, 9	sylib 221	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → (𝑦 ∈ 𝐹 ∨ 𝑦 ∈ {∅}))
11	10	orcomd 884	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → (𝑦 ∈ {∅} ∨ 𝑦 ∈ 𝐹))
12	11	ord 877	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ 𝑦 ∈ 𝑥) → (¬ 𝑦 ∈ {∅} → 𝑦 ∈ 𝐹))
13	12	impr 459	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → 𝑦 ∈ 𝐹)
14		uniss 4884	. . . . . . . . . . . . . 14 ⊢ (𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ⊆ ∪ (𝐹 ∪ {∅}))
15	14	ad2antlr 739	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ⊆ ∪ (𝐹 ∪ {∅}))
16		uniun 4899	. . . . . . . . . . . . . 14 ⊢ ∪ (𝐹 ∪ {∅}) = (∪ 𝐹 ∪ ∪ {∅})
17		0ex 5272	. . . . . . . . . . . . . . . 16 ⊢ ∅ ∈ V
18	17	unisn 4895	. . . . . . . . . . . . . . 15 ⊢ ∪ {∅} = ∅
19	18	uneq2i 4127	. . . . . . . . . . . . . 14 ⊢ (∪ 𝐹 ∪ ∪ {∅}) = (∪ 𝐹 ∪ ∅)
20		un0 4358	. . . . . . . . . . . . . 14 ⊢ (∪ 𝐹 ∪ ∅) = ∪ 𝐹
21	16, 19, 20	3eqtrri 2797	. . . . . . . . . . . . 13 ⊢ ∪ 𝐹 = ∪ (𝐹 ∪ {∅})
22	15, 21	sseqtrrdi 3986	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ⊆ ∪ 𝐹)
23		elssuni 4908	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑥 → 𝑦 ⊆ ∪ 𝑥)
24	23	ad2antrl 740	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → 𝑦 ⊆ ∪ 𝑥)
25		filss 23979	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ (𝑦 ∈ 𝐹 ∧ ∪ 𝑥 ⊆ ∪ 𝐹 ∧ 𝑦 ⊆ ∪ 𝑥)) → ∪ 𝑥 ∈ 𝐹)
26	6, 13, 22, 24, 25	syl13anc 1397	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ∈ 𝐹)
27		elun1 4143	. . . . . . . . . . 11 ⊢ (∪ 𝑥 ∈ 𝐹 → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
28	26, 27	syl 18	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) ∧ (𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅})) → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
29	28	ex 417	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → ((𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
30	29	exlimdv 1960	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → (∃𝑦(𝑦 ∈ 𝑥 ∧ ¬ 𝑦 ∈ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
31	5, 30	biimtrid 245	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → (¬ 𝑥 ⊆ {∅} → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
32		uni0b 4903	. . . . . . . 8 ⊢ (∪ 𝑥 = ∅ ↔ 𝑥 ⊆ {∅})
33		ssun2 4140	. . . . . . . . . 10 ⊢ {∅} ⊆ (𝐹 ∪ {∅})
34	17	snid 4633	. . . . . . . . . 10 ⊢ ∅ ∈ {∅}
35	33, 34	sselii 3942	. . . . . . . . 9 ⊢ ∅ ∈ (𝐹 ∪ {∅})
36		eleq1 2857	. . . . . . . . 9 ⊢ (∪ 𝑥 = ∅ → (∪ 𝑥 ∈ (𝐹 ∪ {∅}) ↔ ∅ ∈ (𝐹 ∪ {∅})))
37	35, 36	mpbiri 261	. . . . . . . 8 ⊢ (∪ 𝑥 = ∅ → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
38	32, 37	sylbir 238	. . . . . . 7 ⊢ (𝑥 ⊆ {∅} → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
39	31, 38	pm2.61d2 183	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ⊆ (𝐹 ∪ {∅})) → ∪ 𝑥 ∈ (𝐹 ∪ {∅}))
40	39	ex 417	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
41	40	alrimiv 1954	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ∀𝑥(𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})))
42		filin 23980	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ∩ 𝑦) ∈ 𝐹)
43		elun1 4143	. . . . . . . . . 10 ⊢ ((𝑥 ∩ 𝑦) ∈ 𝐹 → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
44	42, 43	syl 18	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
45	44	3expa 1134	. . . . . . . 8 ⊢ (((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) ∧ 𝑦 ∈ 𝐹) → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
46	45	ralrimiva 3163	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
47		elsni 4611	. . . . . . . . 9 ⊢ (𝑦 ∈ {∅} → 𝑦 = ∅)
48		ineq2 4175	. . . . . . . . . . 11 ⊢ (𝑦 = ∅ → (𝑥 ∩ 𝑦) = (𝑥 ∩ ∅))
49		in0 4359	. . . . . . . . . . 11 ⊢ (𝑥 ∩ ∅) = ∅
50	48, 49	eqtrdi 2820	. . . . . . . . . 10 ⊢ (𝑦 = ∅ → (𝑥 ∩ 𝑦) = ∅)
51	50, 35	eqeltrdi 2877	. . . . . . . . 9 ⊢ (𝑦 = ∅ → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
52	47, 51	syl 18	. . . . . . . 8 ⊢ (𝑦 ∈ {∅} → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
53	52	rgen 3087	. . . . . . 7 ⊢ ∀𝑦 ∈ {∅} (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})
54		ralun 4159	. . . . . . 7 ⊢ ((∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}) ∧ ∀𝑦 ∈ {∅} (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})) → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
55	46, 53, 54	sylancl 597	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
56	55	ralrimiva 3163	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
57		elsni 4611	. . . . . . 7 ⊢ (𝑥 ∈ {∅} → 𝑥 = ∅)
58		ineq1 4174	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → (𝑥 ∩ 𝑦) = (∅ ∩ 𝑦))
59		0in 4361	. . . . . . . . . 10 ⊢ (∅ ∩ 𝑦) = ∅
60	58, 59	eqtrdi 2820	. . . . . . . . 9 ⊢ (𝑥 = ∅ → (𝑥 ∩ 𝑦) = ∅)
61	60, 35	eqeltrdi 2877	. . . . . . . 8 ⊢ (𝑥 = ∅ → (𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
62	61	ralrimivw 3167	. . . . . . 7 ⊢ (𝑥 = ∅ → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
63	57, 62	syl 18	. . . . . 6 ⊢ (𝑥 ∈ {∅} → ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
64	63	rgen 3087	. . . . 5 ⊢ ∀𝑥 ∈ {∅}∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})
65		ralun 4159	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐹 ∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}) ∧ ∀𝑥 ∈ {∅}∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅})) → ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
66	56, 64, 65	sylancl 597	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))
67		p0ex 5356	. . . . . 6 ⊢ {∅} ∈ V
68		unexg 7742	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ {∅} ∈ V) → (𝐹 ∪ {∅}) ∈ V)
69	67, 68	mpan2 703	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝐹 ∪ {∅}) ∈ V)
70		istopg 23021	. . . . 5 ⊢ ((𝐹 ∪ {∅}) ∈ V → ((𝐹 ∪ {∅}) ∈ Top ↔ (∀𝑥(𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})) ∧ ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))))
71	69, 70	syl 18	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝐹 ∪ {∅}) ∈ Top ↔ (∀𝑥(𝑥 ⊆ (𝐹 ∪ {∅}) → ∪ 𝑥 ∈ (𝐹 ∪ {∅})) ∧ ∀𝑥 ∈ (𝐹 ∪ {∅})∀𝑦 ∈ (𝐹 ∪ {∅})(𝑥 ∩ 𝑦) ∈ (𝐹 ∪ {∅}))))
72	41, 66, 71	mpbir2and 725	. . 3 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝐹 ∪ {∅}) ∈ Top)
73	21	cldopn 23157	. . . . . . . 8 ⊢ (𝑥 ∈ (Clsd‘(𝐹 ∪ {∅})) → (∪ 𝐹 ∖ 𝑥) ∈ (𝐹 ∪ {∅}))
74		elun 4115	. . . . . . . 8 ⊢ ((∪ 𝐹 ∖ 𝑥) ∈ (𝐹 ∪ {∅}) ↔ ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 ∨ (∪ 𝐹 ∖ 𝑥) ∈ {∅}))
75	73, 74	sylib 221	. . . . . . 7 ⊢ (𝑥 ∈ (Clsd‘(𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 ∨ (∪ 𝐹 ∖ 𝑥) ∈ {∅}))
76		elun 4115	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹 ∪ {∅}) ↔ (𝑥 ∈ 𝐹 ∨ 𝑥 ∈ {∅}))
77		filfbas 23974	. . . . . . . . . . . . . 14 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → 𝐹 ∈ (fBas‘∪ 𝐹))
78		fbncp 23965	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ∈ (fBas‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ¬ (∪ 𝐹 ∖ 𝑥) ∈ 𝐹)
79	77, 78	sylan 591	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ¬ (∪ 𝐹 ∖ 𝑥) ∈ 𝐹)
80	79	pm2.21d 122	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ 𝐹) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅))
81	80	ex 417	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ 𝐹 → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
82	57	a1i13 28	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ {∅} → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
83	81, 82	jaod 872	. . . . . . . . . 10 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝑥 ∈ 𝐹 ∨ 𝑥 ∈ {∅}) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
84	76, 83	biimtrid 245	. . . . . . . . 9 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ (𝐹 ∪ {∅}) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅)))
85	84	imp 411	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 → 𝑥 = ∅))
86		elsni 4611	. . . . . . . . 9 ⊢ ((∪ 𝐹 ∖ 𝑥) ∈ {∅} → (∪ 𝐹 ∖ 𝑥) = ∅)
87		elssuni 4908	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐹 ∪ {∅}) → 𝑥 ⊆ ∪ (𝐹 ∪ {∅}))
88	87, 21	sseqtrrdi 3986	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐹 ∪ {∅}) → 𝑥 ⊆ ∪ 𝐹)
89	88	adantl 486	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → 𝑥 ⊆ ∪ 𝐹)
90		ssdif0 4329	. . . . . . . . . . 11 ⊢ (∪ 𝐹 ⊆ 𝑥 ↔ (∪ 𝐹 ∖ 𝑥) = ∅)
91	90	biimpri 231	. . . . . . . . . 10 ⊢ ((∪ 𝐹 ∖ 𝑥) = ∅ → ∪ 𝐹 ⊆ 𝑥)
92		eqss 3960	. . . . . . . . . . 11 ⊢ (𝑥 = ∪ 𝐹 ↔ (𝑥 ⊆ ∪ 𝐹 ∧ ∪ 𝐹 ⊆ 𝑥))
93	92	simplbi2 505	. . . . . . . . . 10 ⊢ (𝑥 ⊆ ∪ 𝐹 → (∪ 𝐹 ⊆ 𝑥 → 𝑥 = ∪ 𝐹))
94	89, 91, 93	syl2im 41	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) = ∅ → 𝑥 = ∪ 𝐹))
95	86, 94	syl5 35	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → ((∪ 𝐹 ∖ 𝑥) ∈ {∅} → 𝑥 = ∪ 𝐹))
96	85, 95	orim12d 979	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → (((∪ 𝐹 ∖ 𝑥) ∈ 𝐹 ∨ (∪ 𝐹 ∖ 𝑥) ∈ {∅}) → (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹)))
97	75, 96	syl5 35	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘∪ 𝐹) ∧ 𝑥 ∈ (𝐹 ∪ {∅})) → (𝑥 ∈ (Clsd‘(𝐹 ∪ {∅})) → (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹)))
98	97	expimpd 458	. . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝑥 ∈ (𝐹 ∪ {∅}) ∧ 𝑥 ∈ (Clsd‘(𝐹 ∪ {∅}))) → (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹)))
99		elin 3929	. . . . 5 ⊢ (𝑥 ∈ ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) ↔ (𝑥 ∈ (𝐹 ∪ {∅}) ∧ 𝑥 ∈ (Clsd‘(𝐹 ∪ {∅}))))
100		vex 3467	. . . . . 6 ⊢ 𝑥 ∈ V
101	100	elpr 4619	. . . . 5 ⊢ (𝑥 ∈ {∅, ∪ 𝐹} ↔ (𝑥 = ∅ ∨ 𝑥 = ∪ 𝐹))
102	98, 99, 101	3imtr4g 299	. . . 4 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝑥 ∈ ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) → 𝑥 ∈ {∅, ∪ 𝐹}))
103	102	ssrdv 3951	. . 3 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) ⊆ {∅, ∪ 𝐹})
104	21	isconn2 23540	. . 3 ⊢ ((𝐹 ∪ {∅}) ∈ Conn ↔ ((𝐹 ∪ {∅}) ∈ Top ∧ ((𝐹 ∪ {∅}) ∩ (Clsd‘(𝐹 ∪ {∅}))) ⊆ {∅, ∪ 𝐹}))
105	72, 103, 104	sylanbrc 594	. 2 ⊢ (𝐹 ∈ (Fil‘∪ 𝐹) → (𝐹 ∪ {∅}) ∈ Conn)
106	4, 105	syl 18	1 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∪ {∅}) ∈ Conn)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1101  ∀wal 1565   = wceq 1567  ∃wex 1806   ∈ wcel 2149  ∀wral 3085  Vcvv 3463   ∖ cdif 3910   ∪ cun 3911   ∩ cin 3912   ⊆ wss 3913  ∅c0 4294  {csn 4594  {cpr 4596  ∪ cuni 4876  ‘cfv 6537  fBascfbas 21479  Topctop 23019  Clsdccld 23142  Conncconn 23537  Filcfil 23971

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-fbas 21488  df-top 23020  df-cld 23145  df-conn 23538  df-fil 23972

This theorem is referenced by:  ufildr  24057