| 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 7449 | . . 3 ⊢ (𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) ∈ V | |
| 2 | fvex 6894 | . . 3 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) ∈ V | |
| 3 | tsetid 17463 | . . . 4 ⊢ TopSet = Slot (TopSet‘ndx) | |
| 4 | 3 | setsid 17324 | . . 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 705 | . 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 2760 | . . . . . . 7 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
| 10 | 8, 9 | tngds 24906 | . . . . . 6 ⊢ (𝑁 ∈ 𝑊 → (𝑁 ∘ (-g‘𝐺)) = (dist‘𝑇)) |
| 11 | 7, 10 | eqtr4id 2814 | . . . . 5 ⊢ (𝑁 ∈ 𝑊 → 𝐷 = (𝑁 ∘ (-g‘𝐺))) |
| 12 | 11 | adantl 487 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐷 = (𝑁 ∘ (-g‘𝐺))) |
| 13 | 12 | fveq2d 6885 | . . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (MetOpen‘𝐷) = (MetOpen‘(𝑁 ∘ (-g‘𝐺)))) |
| 14 | 6, 13 | eqtrid 2807 | . 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐽 = (MetOpen‘(𝑁 ∘ (-g‘𝐺)))) |
| 15 | eqid 2760 | . . . 4 ⊢ (𝑁 ∘ (-g‘𝐺)) = (𝑁 ∘ (-g‘𝐺)) | |
| 16 | eqid 2760 | . . . 4 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (MetOpen‘(𝑁 ∘ (-g‘𝐺))) | |
| 17 | 8, 9, 15, 16 | tngval 24897 | . . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝑇 = ((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
| 18 | 17 | fveq2d 6885 | . 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (TopSet‘𝑇) = (TopSet‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉))) |
| 19 | 5, 14, 18 | 3eqtr4a 2821 | 1 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐽 = (TopSet‘𝑇)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 〈cop 4590 ∘ ccom 5659 ‘cfv 6535 (class class class)co 7416 sSet csts 17280 ndxcnx 17310 TopSetcts 17373 distcds 17376 -gcsg 19085 MetOpencmopn 21607 toNrmGrp ctng 24836 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 ax-cnex 11205 ax-resscn 11206 ax-1cn 11207 ax-icn 11208 ax-addcl 11209 ax-addrcl 11210 ax-mulcl 11211 ax-mulrcl 11212 ax-mulcom 11213 ax-addass 11214 ax-mulass 11215 ax-distr 11216 ax-i2m1 11217 ax-1ne0 11218 ax-1rid 11219 ax-rnegex 11220 ax-rrecex 11221 ax-cnre 11222 ax-pre-lttri 11223 ax-pre-lttrn 11224 ax-pre-ltadd 11225 ax-pre-mulgt0 11226 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6301 df-ord 6362 df-on 6363 df-lim 6364 df-suc 6365 df-iota 6491 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-er 8703 df-en 8960 df-dom 8961 df-sdom 8962 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11492 df-neg 11493 df-nn 12283 df-2 12352 df-3 12353 df-4 12354 df-5 12355 df-6 12356 df-7 12357 df-8 12358 df-9 12359 df-n0 12554 df-z 12641 df-dec 12762 df-sets 17281 df-slot 17299 df-ndx 17311 df-tset 17386 df-ds 17389 df-tng 24842 |
| This theorem is used by: tngtopn 24908 |
| Copyright terms: Public domain | W3C validator |