Theorem uvcfval 22003

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 3474	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3		elex 3474	. . 3 ⊢ (𝐼 ∈ 𝑊 → 𝐼 ∈ V)
4		df-uvc 22002	. . . . 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 6882	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
8		uvcfval.o	. . . . . . . . . 10 ⊢ 1 = (1r‘𝑅)
9	7, 8	eqtr4di 2815	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
10		fveq2 6882	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
11		uvcfval.z	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
12	10, 11	eqtr4di 2815	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
13	9, 12	ifeq12d 4507	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)) = if(𝑘 = 𝑗, 1 , 0 ))
14	13	adantr 486	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟)) = if(𝑘 = 𝑗, 1 , 0 ))
15	6, 14	mpteq12dv 5196	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑖 = 𝐼) → (𝑘 ∈ 𝑖 ↦ if(𝑘 = 𝑗, (1r‘𝑟), (0g‘𝑟))) = (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 )))
16	6, 15	mpteq12dv 5196	. . . . 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 7224	. . . . 5 ⊢ (𝐼 ∈ V → (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) ∈ V)
21	20	adantl 487	. . . 4 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))) ∈ V)
22	5, 17, 18, 19, 21	ovmpod 7569	. . 3 ⊢ ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑅 unitVec 𝐼) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
23	2, 3, 22	syl2an 608	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 unitVec 𝐼) = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))
24	1, 23	eqtrid 2809	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝑈 = (𝑗 ∈ 𝐼 ↦ (𝑘 ∈ 𝐼 ↦ if(𝑘 = 𝑗, 1 , 0 ))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3453  ifcif 4485   ↦ cmpt 5190  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419  0_gc0g 17530  1_rcur 20326   unitVec cuvc 22001

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-uvc 22002

This theorem is used by:  uvcval  22004  uvcff  22010  frlmdim  34129