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 49988
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 49986 . 2 IterComp = (𝑓 ∈ V ↦ seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓))))
2 eqidd 2764 . . 3 (𝑓 = 𝐹 → 0 = 0)
3 coeq1 5842 . . . 4 (𝑓 = 𝐹 → (𝑓 ∘ 𝑔) = (𝐹 ∘ 𝑔))
43mpoeq3dv 7525 . . 3 (𝑓 = 𝐹 → (𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)) = (𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)))
5 dmeq 5893 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
65reseq2d 5982 . . . . 5 (𝑓 = 𝐹 → ( I ↾ dom 𝑓) = ( I ↾ dom 𝐹))
7 id 23 . . . . 5 (𝑓 = 𝐹 → 𝑓 = 𝐹)
86, 7ifeq12d 4507 . . . 4 (𝑓 = 𝐹 → if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓) = if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))
98mpteq2dv 5203 . . 3 (𝑓 = 𝐹 → (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓)) = (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹)))
102, 4, 9seqeq123d 14183 . 2 (𝑓 = 𝐹 → seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓))) = seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))))
11 elex 3475 . 2 (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
12 seqex 14176 . . 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 7043 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 2147  Vcvv 3454  ifcif 4485   ↦ cmpt 5190   I cid 5550  dom cdm 5656   ↾ cres 5658   ∘ ccom 5660  ‘cfv 6561   ∈ cmpo 7448  0cc0 11230  ℕ0cn0 12636  seqcseq 14174  IterCompcitco 49984
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778  ax-inf2 9672
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-seq 14175  df-itco 49986
This theorem is used by:  itcoval0  49989  itcoval1  49990  itcoval2  49991  itcoval3  49992  itcovalsuc  49994
  Copyright terms: Public domain W3C validator