| 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 7403 | . . 3 ⊢ (𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) ∈ V | |
| 2 | fvex 6857 | . . 3 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) ∈ V | |
| 3 | tsetid 17287 | . . . 4 ⊢ TopSet = Slot (TopSet‘ndx) | |
| 4 | 3 | setsid 17148 | . . 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 693 | . 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 2737 | . . . . . . 7 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
| 10 | 8, 9 | tngds 24609 | . . . . . 6 ⊢ (𝑁 ∈ 𝑊 → (𝑁 ∘ (-g‘𝐺)) = (dist‘𝑇)) |
| 11 | 7, 10 | eqtr4id 2791 | . . . . 5 ⊢ (𝑁 ∈ 𝑊 → 𝐷 = (𝑁 ∘ (-g‘𝐺))) |
| 12 | 11 | adantl 481 | . . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐷 = (𝑁 ∘ (-g‘𝐺))) |
| 13 | 12 | fveq2d 6848 | . . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (MetOpen‘𝐷) = (MetOpen‘(𝑁 ∘ (-g‘𝐺)))) |
| 14 | 6, 13 | eqtrid 2784 | . 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐽 = (MetOpen‘(𝑁 ∘ (-g‘𝐺)))) |
| 15 | eqid 2737 | . . . 4 ⊢ (𝑁 ∘ (-g‘𝐺)) = (𝑁 ∘ (-g‘𝐺)) | |
| 16 | eqid 2737 | . . . 4 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (MetOpen‘(𝑁 ∘ (-g‘𝐺))) | |
| 17 | 8, 9, 15, 16 | tngval 24600 | . . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝑇 = ((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
| 18 | 17 | fveq2d 6848 | . 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (TopSet‘𝑇) = (TopSet‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉))) |
| 19 | 5, 14, 18 | 3eqtr4a 2798 | 1 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → 𝐽 = (TopSet‘𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 〈cop 4588 ∘ ccom 5638 ‘cfv 6502 (class class class)co 7370 sSet csts 17104 ndxcnx 17134 TopSetcts 17197 distcds 17200 -gcsg 18882 MetOpencmopn 21316 toNrmGrp ctng 24539 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-3 12223 df-4 12224 df-5 12225 df-6 12226 df-7 12227 df-8 12228 df-9 12229 df-n0 12416 df-z 12503 df-dec 12622 df-sets 17105 df-slot 17123 df-ndx 17135 df-tset 17210 df-ds 17213 df-tng 24545 |
| This theorem is referenced by: tngtopn 24611 |
| Copyright terms: Public domain | W3C validator |