Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  itcoval Structured version   Visualization version   GIF version

Theorem itcoval 49717
Description: The value of the function that returns the n-th iterate of a class (usually a function) with regard to composition. (Contributed by AV, 2-May-2024.)
Assertion
Ref Expression
itcoval (𝐹 ∈ 𝑉 → (IterComp‘𝐹) = seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))))
Distinct variable group:   𝑔,𝐹,𝑖,𝑗
Allowed substitution hints:   𝑉(𝑔, 𝑖, 𝑗)

Proof of Theorem itcoval
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 df-itco 49715 . 2 IterComp = (𝑓 ∈ V ↦ seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓))))
2 eqidd 2762 . . 3 (𝑓 = 𝐹 → 0 = 0)
3 coeq1 5835 . . . 4 (𝑓 = 𝐹 → (𝑓 ∘ 𝑔) = (𝐹 ∘ 𝑔))
43mpoeq3dv 7491 . . 3 (𝑓 = 𝐹 → (𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)) = (𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)))
5 dmeq 5885 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
65reseq2d 5970 . . . . 5 (𝑓 = 𝐹 → ( I ↾ dom 𝑓) = ( I ↾ dom 𝐹))
7 id 23 . . . . 5 (𝑓 = 𝐹 → 𝑓 = 𝐹)
86, 7ifeq12d 4504 . . . 4 (𝑓 = 𝐹 → if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓) = if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))
98mpteq2dv 5199 . . 3 (𝑓 = 𝐹 → (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓)) = (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹)))
102, 4, 9seqeq123d 14133 . 2 (𝑓 = 𝐹 → seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓))) = seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))))
11 elex 3472 . 2 (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
12 seqex 14126 . . 3 seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))) ∈ V
1312a1i 11 . 2 (𝐹 ∈ 𝑉 → seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))) ∈ V)
141, 10, 11, 13fvmptd3 7009 1 (𝐹 ∈ 𝑉 → (IterComp‘𝐹) = seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ifcif 4482   ↦ cmpt 5186   I cid 5545  dom cdm 5651   ↾ cres 5653   ∘ ccom 5655  ‘cfv 6531   ∈ cmpo 7414  0cc0 11181  ℕ0cn0 12587  seqcseq 14124  IterCompcitco 49713
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  ax-un 7740  ax-inf2 9626
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-pss 3919  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-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  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-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-seq 14125  df-itco 49715
This theorem is used by:  itcoval0  49718  itcoval1  49719  itcoval2  49720  itcoval3  49721  itcovalsuc  49723
  Copyright terms: Public domain W3C validator