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

Theorem mvrval2 22283
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 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
mvrfval.z 0 = (0g‘𝑅)
mvrfval.o 1 = (1r‘𝑅)
mvrfval.i (𝜑 → 𝐼 ∈ 𝑊)
mvrfval.r (𝜑 → 𝑅 ∈ 𝑌)
mvrval.x (𝜑 → 𝑋 ∈ 𝐼)
mvrval2.f (𝜑 → 𝐹 ∈ 𝐷)
Assertion
Ref Expression
mvrval2 (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))
Distinct variable groups:   𝑦,𝐷   𝑦,𝑊   𝑦,ℎ,𝐼   ℎ,𝑋,𝑦
Allowed substitution hints:   𝜑(𝑦, ℎ)   𝐷(ℎ)   𝑅(𝑦, ℎ)   1 (𝑦, ℎ)   𝐹(𝑦, ℎ)   𝑉(𝑦, ℎ)   𝑊(ℎ)   𝑌(𝑦, ℎ)   0 (𝑦, ℎ)

Proof of Theorem mvrval2
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 mvrfval.v . . . 4 𝑉 = (𝐼 mVar 𝑅)
2 mvrfval.d . . . 4 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
3 mvrfval.z . . . 4 0 = (0g‘𝑅)
4 mvrfval.o . . . 4 1 = (1r‘𝑅)
5 mvrfval.i . . . 4 (𝜑 → 𝐼 ∈ 𝑊)
6 mvrfval.r . . . 4 (𝜑 → 𝑅 ∈ 𝑌)
7 mvrval.x . . . 4 (𝜑 → 𝑋 ∈ 𝐼)
81, 2, 3, 4, 5, 6, 7mvrval 22282 . . 3 (𝜑 → (𝑉‘𝑋) = (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )))
98fveq1d 6885 . 2 (𝜑 → ((𝑉‘𝑋)‘𝐹) = ((𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))‘𝐹))
10 mvrval2.f . . 3 (𝜑 → 𝐹 ∈ 𝐷)
11 eqeq1 2765 . . . . 5 (𝑓 = 𝐹 → (𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) ↔ 𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
1211ifbid 4506 . . . 4 (𝑓 = 𝐹 → if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))
13 eqid 2761 . . . 4 (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) = (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))
144fvexi 6897 . . . . 5 1 ∈ V
153fvexi 6897 . . . . 5 0 ∈ V
1614, 15ifex 4533 . . . 4 if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ) ∈ V
1712, 13, 16fvmpt 6991 . . 3 (𝐹 ∈ 𝐷 → ((𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))‘𝐹) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))
1810, 17syl 18 . 2 (𝜑 → ((𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))‘𝐹) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))
199, 18eqtrd 2796 1 (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413  ifcif 4482   ↦ cmpt 5186  ◡ccnv 5650   “ cima 5654  ‘cfv 6537  (class class class)co 7418   ↑m cmap 8840  Fincfn 8966  0cc0 11193  1c1 11194  ℕcn 12328  ℕ0cn0 12599  0gc0g 17603  1rcur 20400   mVar cmvr 22206
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-pw 4559  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-mvr 22211
This theorem is used by:  mvrid  22284  mvrf1  22286  mvrcl  22292  mhpvarcl  22462  psdmvr  22483  mvrvalind  34163  esplyfval1  34198
  Copyright terms: Public domain W3C validator