MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nmpropd Structured version   Visualization version   GIF version

Theorem nmpropd 24968
Description: Weak property deduction for a norm. (Contributed by Mario Carneiro, 4-Oct-2015.)
Hypotheses
Ref Expression
nmpropd.1 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
nmpropd.2 (𝜑 → (+g‘𝐾) = (+g‘𝐿))
nmpropd.3 (𝜑 → (dist‘𝐾) = (dist‘𝐿))
Assertion
Ref Expression
nmpropd (𝜑 → (norm‘𝐾) = (norm‘𝐿))

Proof of Theorem nmpropd
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nmpropd.1 . . 3 (𝜑 → (Base‘𝐾) = (Base‘𝐿))
2 nmpropd.3 . . . 4 (𝜑 → (dist‘𝐾) = (dist‘𝐿))
3 eqidd 2764 . . . 4 (𝜑 → 𝑥 = 𝑥)
4 eqidd 2764 . . . . 5 (𝜑 → (Base‘𝐾) = (Base‘𝐾))
5 nmpropd.2 . . . . . 6 (𝜑 → (+g‘𝐾) = (+g‘𝐿))
65oveqdr 7479 . . . . 5 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
74, 1, 6grpidpropd 18892 . . . 4 (𝜑 → (0g‘𝐾) = (0g‘𝐿))
82, 3, 7oveq123d 7472 . . 3 (𝜑 → (𝑥(dist‘𝐾)(0g‘𝐾)) = (𝑥(dist‘𝐿)(0g‘𝐿)))
91, 8mpteq12dv 5198 . 2 (𝜑 → (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g‘𝐾))) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g‘𝐿))))
10 eqid 2763 . . 3 (norm‘𝐾) = (norm‘𝐾)
11 eqid 2763 . . 3 (Base‘𝐾) = (Base‘𝐾)
12 eqid 2763 . . 3 (0g‘𝐾) = (0g‘𝐾)
13 eqid 2763 . . 3 (dist‘𝐾) = (dist‘𝐾)
1410, 11, 12, 13nmfval 24962 . 2 (norm‘𝐾) = (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g‘𝐾)))
15 eqid 2763 . . 3 (norm‘𝐿) = (norm‘𝐿)
16 eqid 2763 . . 3 (Base‘𝐿) = (Base‘𝐿)
17 eqid 2763 . . 3 (0g‘𝐿) = (0g‘𝐿)
18 eqid 2763 . . 3 (dist‘𝐿) = (dist‘𝐿)
1915, 16, 17, 18nmfval 24962 . 2 (norm‘𝐿) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g‘𝐿)))
209, 14, 193eqtr4g 2823 1 (𝜑 → (norm‘𝐾) = (norm‘𝐿))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  distcds 17481  0gc0g 17660  normcnm 24950
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-0g 17662  df-nm 24956
This theorem is used by:  sranlm  25058  rlmnm  25063  zlmnm  34707
  Copyright terms: Public domain W3C validator