Theorem bastop1 23200

Description: A subset of a topology is a basis for the topology iff every member of the topology is a union of members of the basis. We use the idiom "(topGen‘𝐵) = 𝐽 " to express "𝐵 is a basis for topology 𝐽 " since we do not have a separate notation for this. Definition 15.35 of [Schechter] p. 428. (Contributed by NM, 2-Feb-2008.) (Proof shortened by Mario Carneiro, 2-Sep-2015.)

Assertion

Ref	Expression
bastop1	⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐽,𝑦

Proof of Theorem bastop1

Step	Hyp	Ref	Expression
1		tgss 23175	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐵) ⊆ (topGen‘𝐽))
2		tgtop 23180	. . . . . 6 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
3	2	adantr 486	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐽) = 𝐽)
4	1, 3	sseqtrd 3974	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐵) ⊆ 𝐽)
5		eqss 3953	. . . . 5 ⊢ ((topGen‘𝐵) = 𝐽 ↔ ((topGen‘𝐵) ⊆ 𝐽 ∧ 𝐽 ⊆ (topGen‘𝐵)))
6	5	baib 545	. . . 4 ⊢ ((topGen‘𝐵) ⊆ 𝐽 → ((topGen‘𝐵) = 𝐽 ↔ 𝐽 ⊆ (topGen‘𝐵)))
7	4, 6	syl 18	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ 𝐽 ⊆ (topGen‘𝐵)))
8		dfss3 3927	. . 3 ⊢ (𝐽 ⊆ (topGen‘𝐵) ↔ ∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵))
9	7, 8	bitrdi 290	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵)))
10		ssexg 5292	. . . . 5 ⊢ ((𝐵 ⊆ 𝐽 ∧ 𝐽 ∈ Top) → 𝐵 ∈ V)
11	10	ancoms 464	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → 𝐵 ∈ V)
12		eltg3 23169	. . . 4 ⊢ (𝐵 ∈ V → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
13	11, 12	syl 18	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
14	13	ralbidv 3190	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵) ↔ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
15	9, 14	bitrd 282	1 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2146  ∀wral 3081  Vcvv 3457   ⊆ wss 3906  ∪ cuni 4874  ‘cfv 6540  topGenctg 17512  Topctop 23100

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-topgen 17518  df-top 23101

This theorem is used by:  bastop2  23201