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

Theorem uvcval 22004
Description: Value of a single unit vector in a free module. (Contributed by Stefan O'Rear, 3-Feb-2015.)
Hypotheses
Ref Expression
uvcfval.u 𝑈 = (𝑅 unitVec 𝐼)
uvcfval.o 1 = (1r𝑅)
uvcfval.z 0 = (0g𝑅)
Assertion
Ref Expression
uvcval ((𝑅𝑉𝐼𝑊𝐽𝐼) → (𝑈𝐽) = (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )))
Distinct variable groups:   1 ,𝑘   𝑅,𝑘   𝑘,𝐼   0 ,𝑘   𝑘,𝐽
Allowed substitution hints:   𝑈(𝑘)   𝑉(𝑘)   𝑊(𝑘)

Proof of Theorem uvcval
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 uvcfval.u . . . . 5 𝑈 = (𝑅 unitVec 𝐼)
2 uvcfval.o . . . . 5 1 = (1r𝑅)
3 uvcfval.z . . . . 5 0 = (0g𝑅)
41, 2, 3uvcfval 22003 . . . 4 ((𝑅𝑉𝐼𝑊) → 𝑈 = (𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
54fveq1d 6884 . . 3 ((𝑅𝑉𝐼𝑊) → (𝑈𝐽) = ((𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽))
653adant3 1150 . 2 ((𝑅𝑉𝐼𝑊𝐽𝐼) → (𝑈𝐽) = ((𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽))
7 eqid 2762 . . 3 (𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) = (𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))
8 eqeq2 2774 . . . . 5 (𝑗 = 𝐽 → (𝑘 = 𝑗𝑘 = 𝐽))
98ifbid 4509 . . . 4 (𝑗 = 𝐽 → if(𝑘 = 𝑗, 1 , 0 ) = if(𝑘 = 𝐽, 1 , 0 ))
109mpteq2dv 5203 . . 3 (𝑗 = 𝐽 → (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )) = (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )))
11 simp3 1156 . . 3 ((𝑅𝑉𝐼𝑊𝐽𝐼) → 𝐽𝐼)
12 mptexg 7224 . . . 4 (𝐼𝑊 → (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V)
13123ad2ant2 1152 . . 3 ((𝑅𝑉𝐼𝑊𝐽𝐼) → (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V)
147, 10, 11, 13fvmptd3 7014 . 2 ((𝑅𝑉𝐼𝑊𝐽𝐼) → ((𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽) = (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )))
156, 14eqtrd 2797 1 ((𝑅𝑉𝐼𝑊𝐽𝐼) → (𝑈𝐽) = (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  Vcvv 3453  ifcif 4485  cmpt 5190  cfv 6537  (class class class)co 7417  0gc0g 17530  1rcur 20326   unitVec cuvc 22001
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-uvc 22002
This theorem is used by:  uvcvval  22005
  Copyright terms: Public domain W3C validator