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

Theorem nmfval 23789
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 6804 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
3 nmfval.x . . . . . 6 𝑋 = (Base‘𝑊)
42, 3eqtr4di 2794 . . . . 5 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑋)
5 fveq2 6804 . . . . . . 7 (𝑤 = 𝑊 → (dist‘𝑤) = (dist‘𝑊))
6 nmfval.d . . . . . . 7 𝐷 = (dist‘𝑊)
75, 6eqtr4di 2794 . . . . . 6 (𝑤 = 𝑊 → (dist‘𝑤) = 𝐷)
8 eqidd 2737 . . . . . 6 (𝑤 = 𝑊𝑥 = 𝑥)
9 fveq2 6804 . . . . . . 7 (𝑤 = 𝑊 → (0g𝑤) = (0g𝑊))
10 nmfval.z . . . . . . 7 0 = (0g𝑊)
119, 10eqtr4di 2794 . . . . . 6 (𝑤 = 𝑊 → (0g𝑤) = 0 )
127, 8, 11oveq123d 7328 . . . . 5 (𝑤 = 𝑊 → (𝑥(dist‘𝑤)(0g𝑤)) = (𝑥𝐷 0 ))
134, 12mpteq12dv 5172 . . . 4 (𝑤 = 𝑊 → (𝑥 ∈ (Base‘𝑤) ↦ (𝑥(dist‘𝑤)(0g𝑤))) = (𝑥𝑋 ↦ (𝑥𝐷 0 )))
14 df-nm 23783 . . . 4 norm = (𝑤 ∈ V ↦ (𝑥 ∈ (Base‘𝑤) ↦ (𝑥(dist‘𝑤)(0g𝑤))))
15 eqid 2736 . . . . . 6 (𝑥𝑋 ↦ (𝑥𝐷 0 )) = (𝑥𝑋 ↦ (𝑥𝐷 0 ))
16 df-ov 7310 . . . . . . . 8 (𝑥𝐷 0 ) = (𝐷‘⟨𝑥, 0 ⟩)
17 fvrn0 6834 . . . . . . . 8 (𝐷‘⟨𝑥, 0 ⟩) ∈ (ran 𝐷 ∪ {∅})
1816, 17eqeltri 2833 . . . . . . 7 (𝑥𝐷 0 ) ∈ (ran 𝐷 ∪ {∅})
1918a1i 11 . . . . . 6 (𝑥𝑋 → (𝑥𝐷 0 ) ∈ (ran 𝐷 ∪ {∅}))
2015, 19fmpti 7018 . . . . 5 (𝑥𝑋 ↦ (𝑥𝐷 0 )):𝑋⟶(ran 𝐷 ∪ {∅})
213fvexi 6818 . . . . 5 𝑋 ∈ V
226fvexi 6818 . . . . . . 7 𝐷 ∈ V
2322rnex 7791 . . . . . 6 ran 𝐷 ∈ V
24 p0ex 5316 . . . . . 6 {∅} ∈ V
2523, 24unex 7628 . . . . 5 (ran 𝐷 ∪ {∅}) ∈ V
26 fex2 7812 . . . . 5 (((𝑥𝑋 ↦ (𝑥𝐷 0 )):𝑋⟶(ran 𝐷 ∪ {∅}) ∧ 𝑋 ∈ V ∧ (ran 𝐷 ∪ {∅}) ∈ V) → (𝑥𝑋 ↦ (𝑥𝐷 0 )) ∈ V)
2720, 21, 25, 26mp3an 1461 . . . 4 (𝑥𝑋 ↦ (𝑥𝐷 0 )) ∈ V
2813, 14, 27fvmpt 6907 . . 3 (𝑊 ∈ V → (norm‘𝑊) = (𝑥𝑋 ↦ (𝑥𝐷 0 )))
29 fvprc 6796 . . . . 5 𝑊 ∈ V → (norm‘𝑊) = ∅)
30 mpt0 6605 . . . . 5 (𝑥 ∈ ∅ ↦ (𝑥𝐷 0 )) = ∅
3129, 30eqtr4di 2794 . . . 4 𝑊 ∈ V → (norm‘𝑊) = (𝑥 ∈ ∅ ↦ (𝑥𝐷 0 )))
32 fvprc 6796 . . . . . 6 𝑊 ∈ V → (Base‘𝑊) = ∅)
333, 32eqtrid 2788 . . . . 5 𝑊 ∈ V → 𝑋 = ∅)
3433mpteq1d 5176 . . . 4 𝑊 ∈ V → (𝑥𝑋 ↦ (𝑥𝐷 0 )) = (𝑥 ∈ ∅ ↦ (𝑥𝐷 0 )))
3531, 34eqtr4d 2779 . . 3 𝑊 ∈ V → (norm‘𝑊) = (𝑥𝑋 ↦ (𝑥𝐷 0 )))
3628, 35pm2.61i 182 . 2 (norm‘𝑊) = (𝑥𝑋 ↦ (𝑥𝐷 0 ))
371, 36eqtri 2764 1 𝑁 = (𝑥𝑋 ↦ (𝑥𝐷 0 ))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1539  wcel 2104  Vcvv 3437  cun 3890  c0 4262  {csn 4565  cop 4571  cmpt 5164  ran crn 5601  wf 6454  cfv 6458  (class class class)co 7307  Basecbs 16957  distcds 17016  0gc0g 17195  normcnm 23777
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-sep 5232  ax-nul 5239  ax-pow 5297  ax-pr 5361  ax-un 7620
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3287  df-v 3439  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-br 5082  df-opab 5144  df-mpt 5165  df-id 5500  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-fv 6466  df-ov 7310  df-nm 23783
This theorem is referenced by:  nmval  23790  nmfval0  23791  nmpropd  23795  subgnm  23834  tngnm  23860  cnfldnm  23987  nmcn  24052  ressnm  31281
  Copyright terms: Public domain W3C validator