![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > uvcval | Structured version Visualization version GIF version |
Description: Value of a single unit vector in a free module. (Contributed by Stefan O'Rear, 3-Feb-2015.) |
Ref | Expression |
---|---|
uvcfval.u | ⊢ 𝑈 = (𝑅 unitVec 𝐼) |
uvcfval.o | ⊢ 1 = (1r‘𝑅) |
uvcfval.z | ⊢ 0 = (0g‘𝑅) |
Ref | Expression |
---|---|
uvcval | ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → (𝑈‘𝐽) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 ))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uvcfval.u | . . . . 5 ⊢ 𝑈 = (𝑅 unitVec 𝐼) | |
2 | uvcfval.o | . . . . 5 ⊢ 1 = (1r‘𝑅) | |
3 | uvcfval.z | . . . . 5 ⊢ 0 = (0g‘𝑅) | |
4 | 1, 2, 3 | uvcfval 21829 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝑈 = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))) |
5 | 4 | fveq1d 6924 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑈‘𝐽) = ((𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽)) |
6 | 5 | 3adant3 1132 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → (𝑈‘𝐽) = ((𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽)) |
7 | eqid 2740 | . . 3 ⊢ (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) | |
8 | eqeq2 2752 | . . . . 5 ⊢ (𝑗 = 𝐽 → (𝑘 = 𝑗 ↔ 𝑘 = 𝐽)) | |
9 | 8 | ifbid 4571 | . . . 4 ⊢ (𝑗 = 𝐽 → if(𝑘 = 𝑗, 1 , 0 ) = if(𝑘 = 𝐽, 1 , 0 )) |
10 | 9 | mpteq2dv 5268 | . . 3 ⊢ (𝑗 = 𝐽 → (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 ))) |
11 | simp3 1138 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → 𝐽 ∈ 𝐼) | |
12 | mptexg 7260 | . . . 4 ⊢ (𝐼 ∈ 𝑊 → (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V) | |
13 | 12 | 3ad2ant2 1134 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V) |
14 | 7, 10, 11, 13 | fvmptd3 7054 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → ((𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 ))) |
15 | 6, 14 | eqtrd 2780 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → (𝑈‘𝐽) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 ))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ifcif 4548 ↦ cmpt 5249 ‘cfv 6575 (class class class)co 7450 0gc0g 17501 1rcur 20210 unitVec cuvc 21827 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6527 df-fun 6577 df-fn 6578 df-f 6579 df-f1 6580 df-fo 6581 df-f1o 6582 df-fv 6583 df-ov 7453 df-oprab 7454 df-mpo 7455 df-uvc 21828 |
This theorem is referenced by: uvcvval 21831 |
Copyright terms: Public domain | W3C validator |