| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tngtset | Structured version Visualization version GIF version | ||
| Description: The topology generated by a normed structure. (Contributed by Mario Carneiro, 3-Oct-2015.) |
| Ref | Expression |
|---|---|
| tngbas.t | ⊢ 𝑇 = (𝐺 toNrmGrp 𝑁) |
| tngtset.2 | ⊢ 𝐷 = (dist‘𝑇) |
| tngtset.3 | ⊢ 𝐽 = (MetOpen‘𝐷) |
| Ref | Expression |
|---|---|
| tngtset | ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐽 = (TopSet‘𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ovex 7444 | . . 3 ⊢ (𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) ∈ V | |
| 2 | fvex 6895 | . . 3 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) ∈ V | |
| 3 | tsetid 17406 | . . . 4 ⊢ TopSet = Slot (TopSet‘ndx) | |
| 4 | 3 | setsid 17267 | . . 3 ⊢ (((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) ∈ V ∧ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) ∈ V) → (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (TopSet‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉))) |
| 5 | 1, 2, 4 | mp2an 704 | . 2 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (TopSet‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
| 6 | tngtset.3 | . . 3 ⊢ 𝐽 = (MetOpen‘𝐷) | |
| 7 | tngtset.2 | . . . . . 6 ⊢ 𝐷 = (dist‘𝑇) | |
| 8 | tngbas.t | . . . . . . 7 ⊢ 𝑇 = (𝐺 toNrmGrp 𝑁) | |
| 9 | eqid 2769 | . . . . . . 7 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
| 10 | 8, 9 | tngds 24774 | . . . . . 6 ⊢ (𝑁 ∈ 𝑊 → (𝑁 ∘ (-g‘𝐺)) = (dist‘𝑇)) |
| 11 | 7, 10 | eqtr4id 2823 | . . . . 5 ⊢ (𝑁 ∈ 𝑊 → 𝐷 = (𝑁 ∘ (-g‘𝐺))) |
| 12 | 11 | adantl 486 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐷 = (𝑁 ∘ (-g‘𝐺))) |
| 13 | 12 | fveq2d 6886 | . . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (MetOpen‘𝐷) = (MetOpen‘(𝑁 ∘ (-g‘𝐺)))) |
| 14 | 6, 13 | eqtrid 2816 | . 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐽 = (MetOpen‘(𝑁 ∘ (-g‘𝐺)))) |
| 15 | eqid 2769 | . . . 4 ⊢ (𝑁 ∘ (-g‘𝐺)) = (𝑁 ∘ (-g‘𝐺)) | |
| 16 | eqid 2769 | . . . 4 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (MetOpen‘(𝑁 ∘ (-g‘𝐺))) | |
| 17 | 8, 9, 15, 16 | tngval 24765 | . . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝑇 = ((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
| 18 | 17 | fveq2d 6886 | . 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (TopSet‘𝑇) = (TopSet‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉))) |
| 19 | 5, 14, 18 | 3eqtr4a 2830 | 1 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐽 = (TopSet‘𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3463 〈cop 4600 ∘ ccom 5666 ‘cfv 6537 (class class class)co 7411 sSet csts 17223 ndxcnx 17253 TopSetcts 17316 distcds 17319 -gcsg 19002 MetOpencmopn 21481 toNrmGrp ctng 24704 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-sets 17224 df-slot 17242 df-ndx 17254 df-tset 17329 df-ds 17332 df-tng 24710 |
| This theorem is referenced by: tngtopn 24776 |
| Copyright terms: Public domain | W3C validator |