| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isngp | Structured version Visualization version GIF version | ||
| Description: The property of being a normed group. (Contributed by Mario Carneiro, 2-Oct-2015.) |
| Ref | Expression |
|---|---|
| isngp.n | ⊢ 𝑁 = (norm‘𝐺) |
| isngp.z | ⊢ − = (-g‘𝐺) |
| isngp.d | ⊢ 𝐷 = (dist‘𝐺) |
| Ref | Expression |
|---|---|
| isngp | ⊢ (𝐺 ∈ NrmGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ MetSp ∧ (𝑁 ∘ − ) ⊆ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elin 4092 | . . 3 ⊢ (𝐺 ∈ (Grp ∩ MetSp) ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ MetSp)) | |
| 2 | 1 | anbi1i 636 | . 2 ⊢ ((𝐺 ∈ (Grp ∩ MetSp) ∧ (𝑁 ∘ − ) ⊆ 𝐷) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ MetSp) ∧ (𝑁 ∘ − ) ⊆ 𝐷)) |
| 3 | fveq2 6888 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (norm‘𝑔) = (norm‘𝐺)) | |
| 4 | isngp.n | . . . . . 6 ⊢ 𝑁 = (norm‘𝐺) | |
| 5 | 3, 4 | eqtr4di 2813 | . . . . 5 ⊢ (𝑔 = 𝐺 → (norm‘𝑔) = 𝑁) |
| 6 | fveq2 6888 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (-g‘𝑔) = (-g‘𝐺)) | |
| 7 | isngp.z | . . . . . 6 ⊢ − = (-g‘𝐺) | |
| 8 | 6, 7 | eqtr4di 2813 | . . . . 5 ⊢ (𝑔 = 𝐺 → (-g‘𝑔) = − ) |
| 9 | 5, 8 | coeq12d 5842 | . . . 4 ⊢ (𝑔 = 𝐺 → ((norm‘𝑔) ∘ (-g‘𝑔)) = (𝑁 ∘ − )) |
| 10 | fveq2 6888 | . . . . 5 ⊢ (𝑔 = 𝐺 → (dist‘𝑔) = (dist‘𝐺)) | |
| 11 | isngp.d | . . . . 5 ⊢ 𝐷 = (dist‘𝐺) | |
| 12 | 10, 11 | eqtr4di 2813 | . . . 4 ⊢ (𝑔 = 𝐺 → (dist‘𝑔) = 𝐷) |
| 13 | 9, 12 | sseq12d 3942 | . . 3 ⊢ (𝑔 = 𝐺 → (((norm‘𝑔) ∘ (-g‘𝑔)) ⊆ (dist‘𝑔) ↔ (𝑁 ∘ − ) ⊆ 𝐷)) |
| 14 | df-ngp 24909 | . . 3 ⊢ NrmGrp = {𝑔 ∈ (Grp ∩ MetSp) ∣ ((norm‘𝑔) ∘ (-g‘𝑔)) ⊆ (dist‘𝑔)} | |
| 15 | 13, 14 | elrab2 3648 | . 2 ⊢ (𝐺 ∈ NrmGrp ↔ (𝐺 ∈ (Grp ∩ MetSp) ∧ (𝑁 ∘ − ) ⊆ 𝐷)) |
| 16 | df-3an 1105 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐺 ∈ MetSp ∧ (𝑁 ∘ − ) ⊆ 𝐷) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ MetSp) ∧ (𝑁 ∘ − ) ⊆ 𝐷)) | |
| 17 | 2, 15, 16 | 3bitr4i 306 | 1 ⊢ (𝐺 ∈ NrmGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ MetSp ∧ (𝑁 ∘ − ) ⊆ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ⊆ wss 3896 ∩ cin 4088 ∘ ccom 5654 ‘cfv 6541 distcds 17444 Grpcgrp 19151 -gcsg 19153 MetSpcms 24644 normcnm 24902 NrmGrpcngp 24903 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-co 5659 df-iota 6496 df-fv 6549 df-ngp 24909 |
| This theorem is used by: isngp2 24923 ngpgrp 24925 ngpms 24926 tngngp2 24978 cnngp 25105 zhmnrg 34645 |
| Copyright terms: Public domain | W3C validator |