ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mvrfval GIF version

Theorem mvrfval 15210
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.
StepHypRef Expression
1 mvrfval.v . 2 𝑉 = (𝐼 mVar 𝑅)
2 mvrfval.i . . . 4 (𝜑 → 𝐼 ∈ 𝑊)
32elexd 2835 . . 3 (𝜑 → 𝐼 ∈ V)
4 mvrfval.r . . . 4 (𝜑 → 𝑅 ∈ 𝑌)
54elexd 2835 . . 3 (𝜑 → 𝑅 ∈ V)
62mptexd 5947 . . 3 (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))) ∈ V)
7 simpl 109 . . . . 5 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → 𝑖 = 𝐼)
87oveq2d 6104 . . . . . . . 8 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (ℕ0 ↑𝑚 𝑖) = (ℕ0 ↑𝑚 𝐼))
98rabeqdv 2815 . . . . . . 7 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
10 mvrfval.d . . . . . . 7 𝐷 = {ℎ ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
119, 10eqtr4di 2289 . . . . . 6 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = 𝐷)
12 mpteq1 4216 . . . . . . . . 9 (𝑖 = 𝐼 → (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))
1312adantr 276 . . . . . . . 8 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)))
1413eqeq2d 2250 . . . . . . 7 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)) ↔ 𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0))))
15 simpr 110 . . . . . . . . 9 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → 𝑟 = 𝑅)
1615fveq2d 5702 . . . . . . . 8 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (1r‘𝑟) = (1r‘𝑅))
17 mvrfval.o . . . . . . . 8 1 = (1r‘𝑅)
1816, 17eqtr4di 2289 . . . . . . 7 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (1r‘𝑟) = 1 )
1915fveq2d 5702 . . . . . . . 8 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (0g‘𝑟) = (0g‘𝑅))
20 mvrfval.z . . . . . . . 8 0 = (0g‘𝑅)
2119, 20eqtr4di 2289 . . . . . . 7 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (0g‘𝑟) = 0 )
2214, 18, 21ifbieq12d 3667 . . . . . 6 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)) = if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))
2311, 22mpteq12dv 4214 . . . . 5 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟))) = (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 )))
247, 23mpteq12dv 4214 . . . 4 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)))) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
25 df-mvr 15159 . . . 4 mVar = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑𝑚 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)))))
2624, 25ovmpoga 6221 . . 3 ((𝐼 ∈ V ∧ 𝑅 ∈ V ∧ (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))) ∈ V) → (𝐼 mVar 𝑅) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
273, 5, 6, 26syl3anc 1278 . 2 (𝜑 → (𝐼 mVar 𝑅) = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
281, 27eqtrid 2283 1 (𝜑 → 𝑉 = (𝑥 ∈ 𝐼 ↦ (𝑓 ∈ 𝐷 ↦ if(𝑓 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, 1, 0)), 1 , 0 ))))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  {crab 2532  Vcvv 2821  ifcif 3638   ↦ cmpt 4193  ◡ccnv 4775   “ cima 4779  ‘cfv 5380  (class class class)co 6088   ↑𝑚 cmap 6926  Fincfn 7027  0cc0 8186  1c1 8187  ℕcn 9314  ℕ0cn0 9575  0gc0g 13670  1rcur 14370   mVar cmvr 15156
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-setind 4686
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-mvr 15159
This theorem is used by:  mvrval  15211  mvrffi  15214
  Copyright terms: Public domain W3C validator