Theorem uvcfval 22070

Description: Value of the unit-vector generator for a free module. (Contributed by Stefan O'Rear, 1-Feb-2015.)

Hypotheses

Ref	Expression
uvcfval.u	⊢ 𝑈 = (𝑅 unitVec 𝐼)
uvcfval.o	⊢ 1 = (1r‘𝑅)
uvcfval.z	⊢ 0 = (0g‘𝑅)

Assertion

Ref	Expression
uvcfval	⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝑈 = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))

Distinct variable groups:   1 ,𝑗,𝑘   𝑅,𝑗,𝑘   𝑗,𝐼,𝑘   0 ,𝑗,𝑘

Allowed substitution hints:   𝑈(𝑗, 𝑘)   𝑉(𝑗, 𝑘)   𝑊(𝑗, 𝑘)

Proof of Theorem uvcfval

Dummy variables 𝑖 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uvcfval.u	. 2 ⊢ 𝑈 = (𝑅 unitVec 𝐼)
2		elex 3472	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3		elex 3472	. . 3 ⊢ (𝐼 ∈ 𝑊 → 𝐼 ∈ V)
4		df-uvc 22069	. . . . 5 ⊢ unitVec = (𝑟 ∈ V, 𝑖 ∈ V ↦ (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)))))
5	4	a1i 11	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → unitVec = (𝑟 ∈ V, 𝑖 ∈ V ↦ (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟))))))
6		simpr 490	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → 𝑖 = 𝐼)
7		fveq2 6877	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
8		uvcfval.o	. . . . . . . . . 10 ⊢ 1 = (1r‘𝑅)
9	7, 8	eqtr4di 2814	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
10		fveq2 6877	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
11		uvcfval.z	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
12	10, 11	eqtr4di 2814	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
13	9, 12	ifeq12d 4504	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)) = if(𝑘 = 𝑗, 1 , 0 ))
14	13	adantr 486	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)) = if(𝑘 = 𝑗, 1 , 0 ))
15	6, 14	mpteq12dv 5192	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟))) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))
16	6, 15	mpteq12dv 5192	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)))) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
17	16	adantl 487	. . . 4 ⊢ (((𝑅 ∈ V ∧ 𝐼 ∈ V) ∧ (𝑟 = 𝑅 ∧ 𝑖 = 𝐼)) → (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)))) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
18		simpl 488	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → 𝑅 ∈ V)
19		simpr 490	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → 𝐼 ∈ V)
20		mptexg 7219	. . . . 5 ⊢ (𝐼 ∈ V → (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) ∈ V)
21	20	adantl 487	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) ∈ V)
22	5, 17, 18, 19, 21	ovmpod 7564	. . 3 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑅 unitVec 𝐼) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
23	2, 3, 22	syl2an 608	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 unitVec 𝐼) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
24	1, 23	eqtrid 2808	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝑈 = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ifcif 4482   ↦ cmpt 5186  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  0_gc0g 17590  1_rcur 20387   unitVec cuvc 22068

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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-uvc 22069

This theorem is used by:  uvcval  22071  uvcff  22077  frlmdim  34225