Theorem opnfbas 23566

Description: The collection of open supersets of a nonempty set in a topology is a neighborhoods of the set, one of the motivations for the filter concept. (Contributed by Jeff Hankins, 2-Sep-2009.) (Revised by Mario Carneiro, 7-Aug-2015.)

Hypothesis

Ref	Expression
opnfbas.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
opnfbas	⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∈ (fBas‘𝑋))

Distinct variable groups:   𝑥,𝐽   𝑥,𝑆   𝑥,𝑋

Proof of Theorem opnfbas

Dummy variables 𝑠 𝑟 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 4076	. . . 4 ⊢ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ⊆ 𝐽
2		opnfbas.1	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
3	2	eqimss2i 4042	. . . . 5 ⊢ ∪ 𝐽 ⊆ 𝑋
4		sspwuni 5102	. . . . 5 ⊢ (𝐽 ⊆ 𝒫 𝑋 ↔ ∪ 𝐽 ⊆ 𝑋)
5	3, 4	mpbir 230	. . . 4 ⊢ 𝐽 ⊆ 𝒫 𝑋
6	1, 5	sstri 3990	. . 3 ⊢ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ⊆ 𝒫 𝑋
7	6	a1i 11	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ⊆ 𝒫 𝑋)
8	2	topopn 22628	. . . . . . 7 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
9	8	anim1i 613	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑋 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑋))
10	9	3adant3 1130	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (𝑋 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑋))
11		sseq2 4007	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑆 ⊆ 𝑥 ↔ 𝑆 ⊆ 𝑋))
12	11	elrab 3682	. . . . 5 ⊢ (𝑋 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ↔ (𝑋 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑋))
13	10, 12	sylibr 233	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → 𝑋 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥})
14	13	ne0d 4334	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ≠ ∅)
15		ss0 4397	. . . . . . 7 ⊢ (𝑆 ⊆ ∅ → 𝑆 = ∅)
16	15	necon3ai 2963	. . . . . 6 ⊢ (𝑆 ≠ ∅ → ¬ 𝑆 ⊆ ∅)
17	16	3ad2ant3 1133	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ¬ 𝑆 ⊆ ∅)
18	17	intnand 487	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ¬ (∅ ∈ 𝐽 ∧ 𝑆 ⊆ ∅))
19		df-nel 3045	. . . . 5 ⊢ (∅ ∉ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ↔ ¬ ∅ ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥})
20		sseq2 4007	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝑆 ⊆ 𝑥 ↔ 𝑆 ⊆ ∅))
21	20	elrab 3682	. . . . . 6 ⊢ (∅ ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ↔ (∅ ∈ 𝐽 ∧ 𝑆 ⊆ ∅))
22	21	notbii 319	. . . . 5 ⊢ (¬ ∅ ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ↔ ¬ (∅ ∈ 𝐽 ∧ 𝑆 ⊆ ∅))
23	19, 22	bitr2i 275	. . . 4 ⊢ (¬ (∅ ∈ 𝐽 ∧ 𝑆 ⊆ ∅) ↔ ∅ ∉ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥})
24	18, 23	sylib 217	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ∅ ∉ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥})
25		sseq2 4007	. . . . . . 7 ⊢ (𝑥 = 𝑟 → (𝑆 ⊆ 𝑥 ↔ 𝑆 ⊆ 𝑟))
26	25	elrab 3682	. . . . . 6 ⊢ (𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ↔ (𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟))
27		sseq2 4007	. . . . . . 7 ⊢ (𝑥 = 𝑠 → (𝑆 ⊆ 𝑥 ↔ 𝑆 ⊆ 𝑠))
28	27	elrab 3682	. . . . . 6 ⊢ (𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ↔ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))
29	26, 28	anbi12i 625	. . . . 5 ⊢ ((𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∧ 𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}) ↔ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠)))
30		simpl 481	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → 𝐽 ∈ Top)
31		simprll 775	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → 𝑟 ∈ 𝐽)
32		simprrl 777	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → 𝑠 ∈ 𝐽)
33		inopn 22621	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑟 ∈ 𝐽 ∧ 𝑠 ∈ 𝐽) → (𝑟 ∩ 𝑠) ∈ 𝐽)
34	30, 31, 32, 33	syl3anc 1369	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → (𝑟 ∩ 𝑠) ∈ 𝐽)
35		ssin 4229	. . . . . . . . . . . . 13 ⊢ ((𝑆 ⊆ 𝑟 ∧ 𝑆 ⊆ 𝑠) ↔ 𝑆 ⊆ (𝑟 ∩ 𝑠))
36	35	biimpi 215	. . . . . . . . . . . 12 ⊢ ((𝑆 ⊆ 𝑟 ∧ 𝑆 ⊆ 𝑠) → 𝑆 ⊆ (𝑟 ∩ 𝑠))
37	36	ad2ant2l 742	. . . . . . . . . . 11 ⊢ (((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠)) → 𝑆 ⊆ (𝑟 ∩ 𝑠))
38	37	adantl 480	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → 𝑆 ⊆ (𝑟 ∩ 𝑠))
39	34, 38	jca 510	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → ((𝑟 ∩ 𝑠) ∈ 𝐽 ∧ 𝑆 ⊆ (𝑟 ∩ 𝑠)))
40	39	3ad2antl1 1183	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → ((𝑟 ∩ 𝑠) ∈ 𝐽 ∧ 𝑆 ⊆ (𝑟 ∩ 𝑠)))
41		sseq2 4007	. . . . . . . . 9 ⊢ (𝑥 = (𝑟 ∩ 𝑠) → (𝑆 ⊆ 𝑥 ↔ 𝑆 ⊆ (𝑟 ∩ 𝑠)))
42	41	elrab 3682	. . . . . . . 8 ⊢ ((𝑟 ∩ 𝑠) ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ↔ ((𝑟 ∩ 𝑠) ∈ 𝐽 ∧ 𝑆 ⊆ (𝑟 ∩ 𝑠)))
43	40, 42	sylibr 233	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → (𝑟 ∩ 𝑠) ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥})
44		ssid 4003	. . . . . . 7 ⊢ (𝑟 ∩ 𝑠) ⊆ (𝑟 ∩ 𝑠)
45		sseq1 4006	. . . . . . . 8 ⊢ (𝑡 = (𝑟 ∩ 𝑠) → (𝑡 ⊆ (𝑟 ∩ 𝑠) ↔ (𝑟 ∩ 𝑠) ⊆ (𝑟 ∩ 𝑠)))
46	45	rspcev 3611	. . . . . . 7 ⊢ (((𝑟 ∩ 𝑠) ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∧ (𝑟 ∩ 𝑠) ⊆ (𝑟 ∩ 𝑠)) → ∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠))
47	43, 44, 46	sylancl 584	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) ∧ ((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠))) → ∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠))
48	47	ex 411	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (((𝑟 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑟) ∧ (𝑠 ∈ 𝐽 ∧ 𝑆 ⊆ 𝑠)) → ∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠)))
49	29, 48	biimtrid 241	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ((𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∧ 𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}) → ∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠)))
50	49	ralrimivv 3196	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ∀𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∀𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠))
51	14, 24, 50	3jca 1126	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ≠ ∅ ∧ ∅ ∉ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∧ ∀𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∀𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠)))
52		isfbas2 23559	. . . 4 ⊢ (𝑋 ∈ 𝐽 → ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∈ (fBas‘𝑋) ↔ ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ⊆ 𝒫 𝑋 ∧ ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ≠ ∅ ∧ ∅ ∉ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∧ ∀𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∀𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠)))))
53	8, 52	syl 17	. . 3 ⊢ (𝐽 ∈ Top → ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∈ (fBas‘𝑋) ↔ ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ⊆ 𝒫 𝑋 ∧ ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ≠ ∅ ∧ ∅ ∉ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∧ ∀𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∀𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠)))))
54	53	3ad2ant1 1131	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∈ (fBas‘𝑋) ↔ ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ⊆ 𝒫 𝑋 ∧ ({𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ≠ ∅ ∧ ∅ ∉ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∧ ∀𝑟 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∀𝑠 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}∃𝑡 ∈ {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥}𝑡 ⊆ (𝑟 ∩ 𝑠)))))
55	7, 51, 54	mpbir2and 709	1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → {𝑥 ∈ 𝐽 ∣ 𝑆 ⊆ 𝑥} ∈ (fBas‘𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1085   = wceq 1539   ∈ wcel 2104   ≠ wne 2938   ∉ wnel 3044  ∀wral 3059  ∃wrex 3068  {crab 3430   ∩ cin 3946   ⊆ wss 3947  ∅c0 4321  𝒫 cpw 4601  ∪ cuni 4907  ‘cfv 6542  fBascfbas 21132  Topctop 22615

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6494  df-fun 6544  df-fv 6550  df-fbas 21141  df-top 22616

This theorem is referenced by:  neifg  35559