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

Theorem nmpropd 24821
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 2761 . . . 4 (𝜑𝑥 = 𝑥)
4 eqidd 2761 . . . . 5 (𝜑 → (Base‘𝐾) = (Base‘𝐾))
5 nmpropd.2 . . . . . 6 (𝜑 → (+g𝐾) = (+g𝐿))
65oveqdr 7442 . . . . 5 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
74, 1, 6grpidpropd 18756 . . . 4 (𝜑 → (0g𝐾) = (0g𝐿))
82, 3, 7oveq123d 7435 . . 3 (𝜑 → (𝑥(dist‘𝐾)(0g𝐾)) = (𝑥(dist‘𝐿)(0g𝐿)))
91, 8mpteq12dv 5192 . 2 (𝜑 → (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g𝐾))) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g𝐿))))
10 eqid 2760 . . 3 (norm‘𝐾) = (norm‘𝐾)
11 eqid 2760 . . 3 (Base‘𝐾) = (Base‘𝐾)
12 eqid 2760 . . 3 (0g𝐾) = (0g𝐾)
13 eqid 2760 . . 3 (dist‘𝐾) = (dist‘𝐾)
1410, 11, 12, 13nmfval 24815 . 2 (norm‘𝐾) = (𝑥 ∈ (Base‘𝐾) ↦ (𝑥(dist‘𝐾)(0g𝐾)))
15 eqid 2760 . . 3 (norm‘𝐿) = (norm‘𝐿)
16 eqid 2760 . . 3 (Base‘𝐿) = (Base‘𝐿)
17 eqid 2760 . . 3 (0g𝐿) = (0g𝐿)
18 eqid 2760 . . 3 (dist‘𝐿) = (dist‘𝐿)
1915, 16, 17, 18nmfval 24815 . 2 (norm‘𝐿) = (𝑥 ∈ (Base‘𝐿) ↦ (𝑥(dist‘𝐿)(0g𝐿)))
209, 14, 193eqtr4g 2820 1 (𝜑 → (norm‘𝐾) = (norm‘𝐿))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  cmpt 5186  cfv 6533  (class class class)co 7414  Basecbs 17302  +gcplusg 17343  distcds 17352  0gc0g 17525  normcnm 24803
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-0g 17527  df-nm 24809
This theorem is used by:  sranlm  24911  rlmnm  24916  zlmnm  34475
  Copyright terms: Public domain W3C validator