![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tgclb | Structured version Visualization version GIF version |
Description: The property tgcl 22991 can be reversed: if the topology generated by 𝐵 is actually a topology, then 𝐵 must be a topological basis. This yields an alternative definition of TopBases. (Contributed by Mario Carneiro, 2-Sep-2015.) |
Ref | Expression |
---|---|
tgclb | ⊢ (𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tgcl 22991 | . 2 ⊢ (𝐵 ∈ TopBases → (topGen‘𝐵) ∈ Top) | |
2 | 0opn 22925 | . . . . . . . . . 10 ⊢ ((topGen‘𝐵) ∈ Top → ∅ ∈ (topGen‘𝐵)) | |
3 | 2 | elfvexd 6945 | . . . . . . . . 9 ⊢ ((topGen‘𝐵) ∈ Top → 𝐵 ∈ V) |
4 | bastg 22988 | . . . . . . . . 9 ⊢ (𝐵 ∈ V → 𝐵 ⊆ (topGen‘𝐵)) | |
5 | 3, 4 | syl 17 | . . . . . . . 8 ⊢ ((topGen‘𝐵) ∈ Top → 𝐵 ⊆ (topGen‘𝐵)) |
6 | 5 | sselda 3994 | . . . . . . 7 ⊢ (((topGen‘𝐵) ∈ Top ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (topGen‘𝐵)) |
7 | 5 | sselda 3994 | . . . . . . 7 ⊢ (((topGen‘𝐵) ∈ Top ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ (topGen‘𝐵)) |
8 | 6, 7 | anim12dan 619 | . . . . . 6 ⊢ (((topGen‘𝐵) ∈ Top ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵))) |
9 | inopn 22920 | . . . . . . 7 ⊢ (((topGen‘𝐵) ∈ Top ∧ 𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) → (𝑥 ∩ 𝑦) ∈ (topGen‘𝐵)) | |
10 | 9 | 3expb 1119 | . . . . . 6 ⊢ (((topGen‘𝐵) ∈ Top ∧ (𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵))) → (𝑥 ∩ 𝑦) ∈ (topGen‘𝐵)) |
11 | 8, 10 | syldan 591 | . . . . 5 ⊢ (((topGen‘𝐵) ∈ Top ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 ∩ 𝑦) ∈ (topGen‘𝐵)) |
12 | tg2 22987 | . . . . . 6 ⊢ (((𝑥 ∩ 𝑦) ∈ (topGen‘𝐵) ∧ 𝑧 ∈ (𝑥 ∩ 𝑦)) → ∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ (𝑥 ∩ 𝑦))) | |
13 | 12 | ralrimiva 3143 | . . . . 5 ⊢ ((𝑥 ∩ 𝑦) ∈ (topGen‘𝐵) → ∀𝑧 ∈ (𝑥 ∩ 𝑦)∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ (𝑥 ∩ 𝑦))) |
14 | 11, 13 | syl 17 | . . . 4 ⊢ (((topGen‘𝐵) ∈ Top ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∀𝑧 ∈ (𝑥 ∩ 𝑦)∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ (𝑥 ∩ 𝑦))) |
15 | 14 | ralrimivva 3199 | . . 3 ⊢ ((topGen‘𝐵) ∈ Top → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ (𝑥 ∩ 𝑦)∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ (𝑥 ∩ 𝑦))) |
16 | isbasis2g 22970 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∈ TopBases ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ (𝑥 ∩ 𝑦)∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ (𝑥 ∩ 𝑦)))) | |
17 | 3, 16 | syl 17 | . . 3 ⊢ ((topGen‘𝐵) ∈ Top → (𝐵 ∈ TopBases ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ (𝑥 ∩ 𝑦)∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 ∧ 𝑤 ⊆ (𝑥 ∩ 𝑦)))) |
18 | 15, 17 | mpbird 257 | . 2 ⊢ ((topGen‘𝐵) ∈ Top → 𝐵 ∈ TopBases) |
19 | 1, 18 | impbii 209 | 1 ⊢ (𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2105 ∀wral 3058 ∃wrex 3067 Vcvv 3477 ∩ cin 3961 ⊆ wss 3962 ∅c0 4338 ‘cfv 6562 topGenctg 17483 Topctop 22914 TopBasesctb 22967 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5582 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-iota 6515 df-fun 6564 df-fv 6570 df-topgen 17489 df-top 22915 df-bases 22968 |
This theorem is referenced by: bastop2 23016 iocpnfordt 23238 icomnfordt 23239 iooordt 23240 tgcn 23275 tgcnp 23276 2ndcctbss 23478 2ndcomap 23481 dis2ndc 23483 flftg 24019 met2ndci 24550 xrtgioo 24841 topfneec 36337 |
Copyright terms: Public domain | W3C validator |