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

Theorem nmfval 24814
Description: The value of the norm function as the distance to zero. (Contributed by Mario Carneiro, 2-Oct-2015.)
Hypotheses
Ref Expression
nmfval.n 𝑁 = (norm‘𝑊)
nmfval.x 𝑋 = (Base‘𝑊)
nmfval.z 0 = (0g𝑊)
nmfval.d 𝐷 = (dist‘𝑊)
Assertion
Ref Expression
nmfval 𝑁 = (𝑥𝑋 ↦ (𝑥𝐷 0 ))
Distinct variable groups:   𝑥,𝐷   𝑥,𝑊   𝑥,𝑋   𝑥, 0
Allowed substitution hint:   𝑁(𝑥)

Proof of Theorem nmfval
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 nmfval.n . 2 𝑁 = (norm‘𝑊)
2 fveq2 6878 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
3 nmfval.x . . . . . 6 𝑋 = (Base‘𝑊)
42, 3eqtr4di 2813 . . . . 5 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑋)
5 fveq2 6878 . . . . . . 7 (𝑤 = 𝑊 → (dist‘𝑤) = (dist‘𝑊))
6 nmfval.d . . . . . . 7 𝐷 = (dist‘𝑊)
75, 6eqtr4di 2813 . . . . . 6 (𝑤 = 𝑊 → (dist‘𝑤) = 𝐷)
8 eqidd 2761 . . . . . 6 (𝑤 = 𝑊𝑥 = 𝑥)
9 fveq2 6878 . . . . . . 7 (𝑤 = 𝑊 → (0g𝑤) = (0g𝑊))
10 nmfval.z . . . . . . 7 0 = (0g𝑊)
119, 10eqtr4di 2813 . . . . . 6 (𝑤 = 𝑊 → (0g𝑤) = 0 )
127, 8, 11oveq123d 7434 . . . . 5 (𝑤 = 𝑊 → (𝑥(dist‘𝑤)(0g𝑤)) = (𝑥𝐷 0 ))
134, 12mpteq12dv 5192 . . . 4 (𝑤 = 𝑊 → (𝑥 ∈ (Base‘𝑤) ↦ (𝑥(dist‘𝑤)(0g𝑤))) = (𝑥𝑋 ↦ (𝑥𝐷 0 )))
14 df-nm 24808 . . . 4 norm = (𝑤 ∈ V ↦ (𝑥 ∈ (Base‘𝑤) ↦ (𝑥(dist‘𝑤)(0g𝑤))))
15 eqid 2760 . . . . . 6 (𝑥𝑋 ↦ (𝑥𝐷 0 )) = (𝑥𝑋 ↦ (𝑥𝐷 0 ))
16 df-ov 7416 . . . . . . . 8 (𝑥𝐷 0 ) = (𝐷‘⟨𝑥, 0 ⟩)
17 fvrn0 6906 . . . . . . . 8 (𝐷‘⟨𝑥, 0 ⟩) ∈ (ran 𝐷 ∪ {∅})
1816, 17eqeltri 2856 . . . . . . 7 (𝑥𝐷 0 ) ∈ (ran 𝐷 ∪ {∅})
1918a1i 11 . . . . . 6 (𝑥𝑋 → (𝑥𝐷 0 ) ∈ (ran 𝐷 ∪ {∅}))
2015, 19fmpti 7105 . . . . 5 (𝑥𝑋 ↦ (𝑥𝐷 0 )):𝑋⟶(ran 𝐷 ∪ {∅})
213fvexi 6892 . . . . 5 𝑋 ∈ V
226fvexi 6892 . . . . . . 7 𝐷 ∈ V
2322rnex 7907 . . . . . 6 ran 𝐷 ∈ V
24 p0ex 5349 . . . . . 6 {∅} ∈ V
2523, 24unex 7746 . . . . 5 (ran 𝐷 ∪ {∅}) ∈ V
26 fex2 7933 . . . . 5 (((𝑥𝑋 ↦ (𝑥𝐷 0 )):𝑋⟶(ran 𝐷 ∪ {∅}) ∧ 𝑋 ∈ V ∧ (ran 𝐷 ∪ {∅}) ∈ V) → (𝑥𝑋 ↦ (𝑥𝐷 0 )) ∈ V)
2720, 21, 25, 26mp3an 1490 . . . 4 (𝑥𝑋 ↦ (𝑥𝐷 0 )) ∈ V
2813, 14, 27fvmpt 6986 . . 3 (𝑊 ∈ V → (norm‘𝑊) = (𝑥𝑋 ↦ (𝑥𝐷 0 )))
29 fvprc 6870 . . . . 5 𝑊 ∈ V → (norm‘𝑊) = ∅)
30 mpt0 6674 . . . . 5 (𝑥 ∈ ∅ ↦ (𝑥𝐷 0 )) = ∅
3129, 30eqtr4di 2813 . . . 4 𝑊 ∈ V → (norm‘𝑊) = (𝑥 ∈ ∅ ↦ (𝑥𝐷 0 )))
32 fvprc 6870 . . . . . 6 𝑊 ∈ V → (Base‘𝑊) = ∅)
333, 32eqtrid 2807 . . . . 5 𝑊 ∈ V → 𝑋 = ∅)
3433mpteq1d 5195 . . . 4 𝑊 ∈ V → (𝑥𝑋 ↦ (𝑥𝐷 0 )) = (𝑥 ∈ ∅ ↦ (𝑥𝐷 0 )))
3531, 34eqtr4d 2798 . . 3 𝑊 ∈ V → (norm‘𝑊) = (𝑥𝑋 ↦ (𝑥𝐷 0 )))
3628, 35pm2.61i 184 . 2 (norm‘𝑊) = (𝑥𝑋 ↦ (𝑥𝐷 0 ))
371, 36eqtri 2783 1 𝑁 = (𝑥𝑋 ↦ (𝑥𝐷 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570  wcel 2145  Vcvv 3450  cun 3897  c0 4279  {csn 4584  cop 4590  cmpt 5186  ran crn 5656  wf 6529  cfv 6533  (class class class)co 7413  Basecbs 17301  distcds 17351  0gc0g 17524  normcnm 24802
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 7736
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 7416  df-nm 24808
This theorem is used by:  nmval  24815  nmfval0  24816  nmpropd  24820  subgnm  24859  tngnm  24877  cnfldnm  25004  nmcn  25071  ressnm  33404
  Copyright terms: Public domain W3C validator