Theorem mvrfval 19420

Description: Value of the generating elements of the power series structure. (Contributed by Mario Carneiro, 7-Jan-2015.)

Hypotheses

Ref	Expression
mvrfval.v	⊢ 𝑉 = (𝐼 mVar 𝑅)
mvrfval.d	⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
mvrfval.z	⊢ 0 = (0g‘𝑅)
mvrfval.o	⊢ 1 = (1r‘𝑅)
mvrfval.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
mvrfval.r	⊢ (𝜑 → 𝑅 ∈ 𝑌)

Assertion

Ref	Expression
mvrfval	⊢ (𝜑 → 𝑉 = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))

Distinct variable groups:   𝑥,𝑓, 0   1 ,𝑓,𝑥   𝑦,𝑓,𝐷,𝑥   𝑦,𝑊   𝑓,ℎ,𝐼,𝑥,𝑦   𝑅,𝑓,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑓,ℎ)   𝐷(ℎ)   𝑅(𝑦,ℎ)   1 (𝑦,ℎ)   𝑉(𝑥,𝑦,𝑓,ℎ)   𝑊(𝑥,𝑓,ℎ)   𝑌(𝑥,𝑦,𝑓,ℎ)   0 (𝑦,ℎ)

Proof of Theorem mvrfval

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

Step	Hyp	Ref	Expression
1		mvrfval.v	. 2 ⊢ 𝑉 = (𝐼 mVar 𝑅)
2		mvrfval.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
3		elex 3212	. . . 4 ⊢ (𝐼 ∈ 𝑊 → 𝐼 ∈ V)
4	2, 3	syl 17	. . 3 ⊢ (𝜑 → 𝐼 ∈ V)
5		mvrfval.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑌)
6		elex 3212	. . . 4 ⊢ (𝑅 ∈ 𝑌 → 𝑅 ∈ V)
7	5, 6	syl 17	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
8		mptexg 6484	. . . 4 ⊢ (𝐼 ∈ 𝑊 → (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))) ∈ V)
9	2, 8	syl 17	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))) ∈ V)
10		simpl 473	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → 𝑖 = 𝐼)
11	10	oveq2d 6666	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (ℕ0 ↑𝑚 𝑖) = (ℕ0 ↑𝑚 𝐼))
12		rabeq 3192	. . . . . . . 8 ⊢ ((ℕ0 ↑𝑚 𝑖) = (ℕ0 ↑𝑚 𝐼) → {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
13	11, 12	syl 17	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
14		mvrfval.d	. . . . . . 7 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
15	13, 14	syl6eqr 2674	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = 𝐷)
16		mpteq1 4737	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))
17	16	adantr 481	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))
18	17	eqeq2d 2632	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)) ↔ 𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0))))
19		simpr 477	. . . . . . . . 9 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → 𝑟 = 𝑅)
20	19	fveq2d 6195	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (1r‘𝑟) = (1r‘𝑅))
21		mvrfval.o	. . . . . . . 8 ⊢ 1 = (1r‘𝑅)
22	20, 21	syl6eqr 2674	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (1r‘𝑟) = 1 )
23	19	fveq2d 6195	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (0g‘𝑟) = (0g‘𝑅))
24		mvrfval.z	. . . . . . . 8 ⊢ 0 = (0g‘𝑅)
25	23, 24	syl6eqr 2674	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (0g‘𝑟) = 0 )
26	18, 22, 25	ifbieq12d 4113	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)) = if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))
27	15, 26	mpteq12dv 4733	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟))) = (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 )))
28	10, 27	mpteq12dv 4733	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)))) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
29		df-mvr 19357	. . . 4 ⊢ mVar = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)))))
30	28, 29	ovmpt2ga 6790	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V ∧ (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))) ∈ V) → (𝐼 mVar 𝑅) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
31	4, 7, 9, 30	syl3anc 1326	. 2 ⊢ (𝜑 → (𝐼 mVar 𝑅) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
32	1, 31	syl5eq 2668	1 ⊢ (𝜑 → 𝑉 = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  {crab 2916  Vcvv 3200  ifcif 4086   ↦ cmpt 4729  ^◡ccnv 5113   “ cima 5117  ‘cfv 5888  (class class class)co 6650   ↑_𝑚 cmap 7857  Fincfn 7955  0cc0 9936  1c1 9937  ℕcn 11020  ℕ₀cn0 11292  0_gc0g 16100  1_rcur 18501   mVar cmvr 19352

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-mvr 19357

This theorem is referenced by:  mvrval  19421  mvrf  19424  subrgmvr  19461