MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mvrval Structured version   Visualization version   GIF version

Theorem mvrval 19421
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 (𝜑𝑅𝑌)
mvrval.x (𝜑𝑋𝐼)
Assertion
Ref Expression
mvrval (𝜑 → (𝑉𝑋) = (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )))
Distinct variable groups:   0 ,𝑓   1 ,𝑓   𝑦,𝑓,𝐷   𝑦,𝑊   𝑓,,𝐼,𝑦   𝑅,𝑓   𝑓,𝑋,,𝑦
Allowed substitution hints:   𝜑(𝑦,𝑓,)   𝐷()   𝑅(𝑦,)   1 (𝑦,)   𝑉(𝑦,𝑓,)   𝑊(𝑓,)   𝑌(𝑦,𝑓,)   0 (𝑦,)

Proof of Theorem mvrval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 mvrfval.v . . . 4 𝑉 = (𝐼 mVar 𝑅)
2 mvrfval.d . . . 4 𝐷 = { ∈ (ℕ0𝑚 𝐼) ∣ ( “ ℕ) ∈ Fin}
3 mvrfval.z . . . 4 0 = (0g𝑅)
4 mvrfval.o . . . 4 1 = (1r𝑅)
5 mvrfval.i . . . 4 (𝜑𝐼𝑊)
6 mvrfval.r . . . 4 (𝜑𝑅𝑌)
71, 2, 3, 4, 5, 6mvrfval 19420 . . 3 (𝜑𝑉 = (𝑥𝐼 ↦ (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
87fveq1d 6193 . 2 (𝜑 → (𝑉𝑋) = ((𝑥𝐼 ↦ (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 )))‘𝑋))
9 mvrval.x . . 3 (𝜑𝑋𝐼)
10 eqeq2 2633 . . . . . . . . 9 (𝑥 = 𝑋 → (𝑦 = 𝑥𝑦 = 𝑋))
1110ifbid 4108 . . . . . . . 8 (𝑥 = 𝑋 → if(𝑦 = 𝑥, 1, 0) = if(𝑦 = 𝑋, 1, 0))
1211mpteq2dv 4745 . . . . . . 7 (𝑥 = 𝑋 → (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)) = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))
1312eqeq2d 2632 . . . . . 6 (𝑥 = 𝑋 → (𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)) ↔ 𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
1413ifbid 4108 . . . . 5 (𝑥 = 𝑋 → if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ) = if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))
1514mpteq2dv 4745 . . . 4 (𝑥 = 𝑋 → (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 )) = (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )))
16 eqid 2622 . . . 4 (𝑥𝐼 ↦ (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))) = (𝑥𝐼 ↦ (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 )))
17 ovex 6678 . . . . . 6 (ℕ0𝑚 𝐼) ∈ V
182, 17rabex2 4815 . . . . 5 𝐷 ∈ V
1918mptex 6486 . . . 4 (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) ∈ V
2015, 16, 19fvmpt 6282 . . 3 (𝑋𝐼 → ((𝑥𝐼 ↦ (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 )))‘𝑋) = (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )))
219, 20syl 17 . 2 (𝜑 → ((𝑥𝐼 ↦ (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 )))‘𝑋) = (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )))
228, 21eqtrd 2656 1 (𝜑 → (𝑉𝑋) = (𝑓𝐷 ↦ if(𝑓 = (𝑦𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1483  wcel 1990  {crab 2916  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  0cn0 11292  0gc0g 16100  1rcur 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:  mvrval2  19422  mplcoe3  19466  evlslem1  19515
  Copyright terms: Public domain W3C validator