|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > bastop1 | Structured version Visualization version GIF version | ||
| 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.) | 
| Ref | Expression | 
|---|---|
| bastop1 | ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | tgss 22975 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐵) ⊆ (topGen‘𝐽)) | |
| 2 | tgtop 22980 | . . . . . 6 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽) | |
| 3 | 2 | adantr 480 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐽) = 𝐽) | 
| 4 | 1, 3 | sseqtrd 4020 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (topGen‘𝐵) ⊆ 𝐽) | 
| 5 | eqss 3999 | . . . . 5 ⊢ ((topGen‘𝐵) = 𝐽 ↔ ((topGen‘𝐵) ⊆ 𝐽 ∧ 𝐽 ⊆ (topGen‘𝐵))) | |
| 6 | 5 | baib 535 | . . . 4 ⊢ ((topGen‘𝐵) ⊆ 𝐽 → ((topGen‘𝐵) = 𝐽 ↔ 𝐽 ⊆ (topGen‘𝐵))) | 
| 7 | 4, 6 | syl 17 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ 𝐽 ⊆ (topGen‘𝐵))) | 
| 8 | dfss3 3972 | . . 3 ⊢ (𝐽 ⊆ (topGen‘𝐵) ↔ ∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵)) | |
| 9 | 7, 8 | bitrdi 287 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵))) | 
| 10 | ssexg 5323 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐽 ∧ 𝐽 ∈ Top) → 𝐵 ∈ V) | |
| 11 | 10 | ancoms 458 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → 𝐵 ∈ V) | 
| 12 | eltg3 22969 | . . . 4 ⊢ (𝐵 ∈ V → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))) | |
| 13 | 11, 12 | syl 17 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (𝑥 ∈ (topGen‘𝐵) ↔ ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))) | 
| 14 | 13 | ralbidv 3178 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → (∀𝑥 ∈ 𝐽 𝑥 ∈ (topGen‘𝐵) ↔ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))) | 
| 15 | 9, 14 | bitrd 279 | 1 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ∀wral 3061 Vcvv 3480 ⊆ wss 3951 ∪ cuni 4907 ‘cfv 6561 topGenctg 17482 Topctop 22899 | 
| 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 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-iota 6514 df-fun 6563 df-fv 6569 df-topgen 17488 df-top 22900 | 
| This theorem is referenced by: bastop2 23001 | 
| Copyright terms: Public domain | W3C validator |