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

Theorem uvcval 21972
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 21971 . . . 4 ((𝑅𝑉𝐼𝑊) → 𝑈 = (𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
54fveq1d 6890 . . 3 ((𝑅𝑉𝐼𝑊) → (𝑈𝐽) = ((𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽))
653adant3 1150 . 2 ((𝑅𝑉𝐼𝑊𝐽𝐼) → (𝑈𝐽) = ((𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽))
7 eqid 2766 . . 3 (𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) = (𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))
8 eqeq2 2778 . . . . 5 (𝑗 = 𝐽 → (𝑘 = 𝑗𝑘 = 𝐽))
98ifbid 4516 . . . 4 (𝑗 = 𝐽 → if(𝑘 = 𝑗, 1 , 0 ) = if(𝑘 = 𝐽, 1 , 0 ))
109mpteq2dv 5210 . . 3 (𝑗 = 𝐽 → (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )) = (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )))
11 simp3 1156 . . 3 ((𝑅𝑉𝐼𝑊𝐽𝐼) → 𝐽𝐼)
12 mptexg 7226 . . . 4 (𝐼𝑊 → (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V)
13123ad2ant2 1152 . . 3 ((𝑅𝑉𝐼𝑊𝐽𝐼) → (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V)
147, 10, 11, 13fvmptd3 7020 . 2 ((𝑅𝑉𝐼𝑊𝐽𝐼) → ((𝑗𝐼 ↦ (𝑘𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽) = (𝑘𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )))
156, 14eqtrd 2801 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 2146  Vcvv 3458  ifcif 4492  cmpt 5197  cfv 6543  (class class class)co 7423  0gc0g 17517  1rcur 20294   unitVec cuvc 21969
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pr 5409
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-uvc 21970
This theorem is used by:  uvcvval  21973
  Copyright terms: Public domain W3C validator