| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nmpropd | Structured version Visualization version GIF version | ||
| Description: Weak property deduction for a norm. (Contributed by Mario Carneiro, 4-Oct-2015.) |
| Ref | Expression |
|---|---|
| nmpropd.1 | ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿)) |
| nmpropd.2 | ⊢ (𝜑 → (+g‘𝐾) = (+g‘𝐿)) |
| nmpropd.3 | ⊢ (𝜑 → (dist‘𝐾) = (dist‘𝐿)) |
| Ref | Expression |
|---|---|
| nmpropd | ⊢ (𝜑 → (norm‘𝐾) = (norm‘𝐿)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nmpropd.1 | . . 3 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿)) | |
| 2 | nmpropd.3 | . . . 4 ⊢ (𝜑 → (dist‘𝐾) = (dist‘𝐿)) | |
| 3 | eqidd 2740 | . . . 4 ⊢ (𝜑 → 𝑥 = 𝑥) | |
| 4 | eqidd 2740 | . . . . 5 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐾)) | |
| 5 | nmpropd.2 | . . . . . 6 ⊢ (𝜑 → (+g‘𝐾) = (+g‘𝐿)) | |
| 6 | 5 | oveqdr 7384 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)) |
| 7 | 4, 1, 6 | grpidpropd 18621 | . . . 4 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿)) |
| 8 | 2, 3, 7 | oveq123d 7377 | . . 3 ⊢ (𝜑 → (𝑥(dist‘𝐾)(0g‘𝐾)) = (𝑥(dist‘𝐿)(0g‘𝐿))) |
| 9 | 1, 8 | mpteq12dv 5159 | . 2 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g‘𝐾))) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g‘𝐿)))) |
| 10 | eqid 2739 | . . 3 ⊢ (norm‘𝐾) = (norm‘𝐾) | |
| 11 | eqid 2739 | . . 3 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 12 | eqid 2739 | . . 3 ⊢ (0g‘𝐾) = (0g‘𝐾) | |
| 13 | eqid 2739 | . . 3 ⊢ (dist‘𝐾) = (dist‘𝐾) | |
| 14 | 10, 11, 12, 13 | nmfval 24571 | . 2 ⊢ (norm‘𝐾) = (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g‘𝐾))) |
| 15 | eqid 2739 | . . 3 ⊢ (norm‘𝐿) = (norm‘𝐿) | |
| 16 | eqid 2739 | . . 3 ⊢ (Base‘𝐿) = (Base‘𝐿) | |
| 17 | eqid 2739 | . . 3 ⊢ (0g‘𝐿) = (0g‘𝐿) | |
| 18 | eqid 2739 | . . 3 ⊢ (dist‘𝐿) = (dist‘𝐿) | |
| 19 | 15, 16, 17, 18 | nmfval 24571 | . 2 ⊢ (norm‘𝐿) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g‘𝐿))) |
| 20 | 9, 14, 19 | 3eqtr4g 2799 | 1 ⊢ (𝜑 → (norm‘𝐾) = (norm‘𝐿)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ↦ cmpt 5153 ‘cfv 6485 (class class class)co 7356 Basecbs 17170 +gcplusg 17211 distcds 17220 0gc0g 17393 normcnm 24559 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-fv 6493 df-ov 7359 df-0g 17395 df-nm 24565 |
| This theorem is referenced by: sranlm 24667 rlmnm 24672 zlmnm 34148 |
| Copyright terms: Public domain | W3C validator |