![]() |
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 21558 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝑈 = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))) |
5 | 4 | fveq1d 6893 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑈‘𝐽) = ((𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽)) |
6 | 5 | 3adant3 1132 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → (𝑈‘𝐽) = ((𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽)) |
7 | eqid 2732 | . . 3 ⊢ (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) | |
8 | eqeq2 2744 | . . . . 5 ⊢ (𝑗 = 𝐽 → (𝑘 = 𝑗 ↔ 𝑘 = 𝐽)) | |
9 | 8 | ifbid 4551 | . . . 4 ⊢ (𝑗 = 𝐽 → if(𝑘 = 𝑗, 1 , 0 ) = if(𝑘 = 𝐽, 1 , 0 )) |
10 | 9 | mpteq2dv 5250 | . . 3 ⊢ (𝑗 = 𝐽 → (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 ))) |
11 | simp3 1138 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → 𝐽 ∈ 𝐼) | |
12 | mptexg 7225 | . . . 4 ⊢ (𝐼 ∈ 𝑊 → (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V) | |
13 | 12 | 3ad2ant2 1134 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 )) ∈ V) |
14 | 7, 10, 11, 13 | fvmptd3 7021 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → ((𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))‘𝐽) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 ))) |
15 | 6, 14 | eqtrd 2772 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊 ∧ 𝐽 ∈ 𝐼) → (𝑈‘𝐽) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝐽, 1 , 0 ))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ifcif 4528 ↦ cmpt 5231 ‘cfv 6543 (class class class)co 7411 0gc0g 17389 1rcur 20075 unitVec cuvc 21556 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7414 df-oprab 7415 df-mpo 7416 df-uvc 21557 |
This theorem is referenced by: uvcvval 21560 |
Copyright terms: Public domain | W3C validator |