Theorem uvcfval 20928

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 3512	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3		elex 3512	. . 3 ⊢ (𝐼 ∈ 𝑊 → 𝐼 ∈ V)
4		df-uvc 20927	. . . . 5 ⊢ unitVec = (𝑟 ∈ V, 𝑖 ∈ V ↦ (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)))))
5	4	a1i 11	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → unitVec = (𝑟 ∈ V, 𝑖 ∈ V ↦ (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟))))))
6		simpr 487	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → 𝑖 = 𝐼)
7		fveq2 6670	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
8		uvcfval.o	. . . . . . . . . 10 ⊢ 1 = (1r‘𝑅)
9	7, 8	syl6eqr 2874	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
10		fveq2 6670	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
11		uvcfval.z	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
12	10, 11	syl6eqr 2874	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
13	9, 12	ifeq12d 4487	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)) = if(𝑘 = 𝑗, 1 , 0 ))
14	13	adantr 483	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)) = if(𝑘 = 𝑗, 1 , 0 ))
15	6, 14	mpteq12dv 5151	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟))) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))
16	6, 15	mpteq12dv 5151	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)))) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
17	16	adantl 484	. . . 4 ⊢ (((𝑅 ∈ V ∧ 𝐼 ∈ V) ∧ (𝑟 = 𝑅 ∧ 𝑖 = 𝐼)) → (𝑗 ∈ 𝑖 ↦ (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)))) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
18		simpl 485	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → 𝑅 ∈ V)
19		simpr 487	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → 𝐼 ∈ V)
20		mptexg 6984	. . . . 5 ⊢ (𝐼 ∈ V → (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) ∈ V)
21	20	adantl 484	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) ∈ V)
22	5, 17, 18, 19, 21	ovmpod 7302	. . 3 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑅 unitVec 𝐼) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
23	2, 3, 22	syl2an 597	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 unitVec 𝐼) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
24	1, 23	syl5eq 2868	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝑈 = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114  Vcvv 3494  ifcif 4467   ↦ cmpt 5146  ‘cfv 6355  (class class class)co 7156   ∈ cmpo 7158  0_gc0g 16713  1_rcur 19251   unitVec cuvc 20926

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-uvc 20927

This theorem is referenced by:  uvcval  20929  uvcff  20935  frlmdim  31009