Theorem bastop1 23366

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 23341	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐵) ⊆ (topGen‘𝐽))
2		tgtop 23346	. . . . . 6 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
3	2	adantr 486	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐽) = 𝐽)
4	1, 3	sseqtrd 3949	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐵) ⊆ 𝐽)
5		eqss 3928	. . . . 5 ⊢ ((topGen‘𝐵) = 𝐽 ↔ ((topGen‘𝐵) ⊆ 𝐽 ∧ 𝐽 ⊆ (topGen‘𝐵)))
6	5	baib 545	. . . 4 ⊢ ((topGen‘𝐵) ⊆ 𝐽 → ((topGen‘𝐵) = 𝐽 ↔ 𝐽 ⊆ (topGen‘𝐵)))
7	4, 6	syl 18	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ 𝐽 ⊆ (topGen‘𝐵)))
8		dfss3 3902	. . 3 ⊢ (𝐽 ⊆ (topGen‘𝐵) ↔ ∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵))
9	7, 8	bitrdi 290	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵)))
10		ssexg 5288	. . . . 5 ⊢ ((𝐵 ⊆ 𝐽 ∧ 𝐽 ∈ Top) → 𝐵 ∈ V)
11	10	ancoms 464	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → 𝐵 ∈ V)
12		eltg3 23335	. . . 4 ⊢ (𝐵 ∈ V → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
13	11, 12	syl 18	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))
14	13	ralbidv 3189	. 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 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4872  ‘cfv 6566  topGenctg 17658  Topctop 23266

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-topgen 17664  df-top 23267

This theorem is used by:  bastop2  23367