| 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 2737 | . . . 4 ⊢ (𝜑 → 𝑥 = 𝑥) | |
| 4 | eqidd 2737 | . . . . 5 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐾)) | |
| 5 | nmpropd.2 | . . . . . 6 ⊢ (𝜑 → (+g‘𝐾) = (+g‘𝐿)) | |
| 6 | 5 | oveqdr 7395 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)) |
| 7 | 4, 1, 6 | grpidpropd 18630 | . . . 4 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿)) |
| 8 | 2, 3, 7 | oveq123d 7388 | . . 3 ⊢ (𝜑 → (𝑥(dist‘𝐾)(0g‘𝐾)) = (𝑥(dist‘𝐿)(0g‘𝐿))) |
| 9 | 1, 8 | mpteq12dv 5172 | . 2 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g‘𝐾))) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g‘𝐿)))) |
| 10 | eqid 2736 | . . 3 ⊢ (norm‘𝐾) = (norm‘𝐾) | |
| 11 | eqid 2736 | . . 3 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 12 | eqid 2736 | . . 3 ⊢ (0g‘𝐾) = (0g‘𝐾) | |
| 13 | eqid 2736 | . . 3 ⊢ (dist‘𝐾) = (dist‘𝐾) | |
| 14 | 10, 11, 12, 13 | nmfval 24553 | . 2 ⊢ (norm‘𝐾) = (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g‘𝐾))) |
| 15 | eqid 2736 | . . 3 ⊢ (norm‘𝐿) = (norm‘𝐿) | |
| 16 | eqid 2736 | . . 3 ⊢ (Base‘𝐿) = (Base‘𝐿) | |
| 17 | eqid 2736 | . . 3 ⊢ (0g‘𝐿) = (0g‘𝐿) | |
| 18 | eqid 2736 | . . 3 ⊢ (dist‘𝐿) = (dist‘𝐿) | |
| 19 | 15, 16, 17, 18 | nmfval 24553 | . 2 ⊢ (norm‘𝐿) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g‘𝐿))) |
| 20 | 9, 14, 19 | 3eqtr4g 2796 | 1 ⊢ (𝜑 → (norm‘𝐾) = (norm‘𝐿)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5166 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 +gcplusg 17220 distcds 17229 0gc0g 17402 normcnm 24541 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fv 6506 df-ov 7370 df-0g 17404 df-nm 24547 |
| This theorem is referenced by: sranlm 24649 rlmnm 24654 zlmnm 34108 |
| Copyright terms: Public domain | W3C validator |