Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > itcoval | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
itcoval | ⊢ (𝐹 ∈ 𝑉 → (IterComp‘𝐹) = seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-itco 45957 | . 2 ⊢ IterComp = (𝑓 ∈ V ↦ seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓)))) | |
2 | eqidd 2740 | . . 3 ⊢ (𝑓 = 𝐹 → 0 = 0) | |
3 | coeq1 5763 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 ∘ 𝑔) = (𝐹 ∘ 𝑔)) | |
4 | 3 | mpoeq3dv 7345 | . . 3 ⊢ (𝑓 = 𝐹 → (𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)) = (𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔))) |
5 | dmeq 5809 | . . . . . 6 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹) | |
6 | 5 | reseq2d 5888 | . . . . 5 ⊢ (𝑓 = 𝐹 → ( I ↾ dom 𝑓) = ( I ↾ dom 𝐹)) |
7 | id 22 | . . . . 5 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹) | |
8 | 6, 7 | ifeq12d 4485 | . . . 4 ⊢ (𝑓 = 𝐹 → if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓) = if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹)) |
9 | 8 | mpteq2dv 5180 | . . 3 ⊢ (𝑓 = 𝐹 → (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓)) = (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))) |
10 | 2, 4, 9 | seqeq123d 13711 | . 2 ⊢ (𝑓 = 𝐹 → seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝑓 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝑓), 𝑓))) = seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹)))) |
11 | elex 3448 | . 2 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V) | |
12 | seqex 13704 | . . 3 ⊢ seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))) ∈ V | |
13 | 12 | a1i 11 | . 2 ⊢ (𝐹 ∈ 𝑉 → seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹))) ∈ V) |
14 | 1, 10, 11, 13 | fvmptd3 6892 | 1 ⊢ (𝐹 ∈ 𝑉 → (IterComp‘𝐹) = seq0((𝑔 ∈ V, 𝑗 ∈ V ↦ (𝐹 ∘ 𝑔)), (𝑖 ∈ ℕ0 ↦ if(𝑖 = 0, ( I ↾ dom 𝐹), 𝐹)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2109 Vcvv 3430 ifcif 4464 ↦ cmpt 5161 I cid 5487 dom cdm 5588 ↾ cres 5590 ∘ ccom 5592 ‘cfv 6430 ∈ cmpo 7270 0cc0 10855 ℕ0cn0 12216 seqcseq 13702 IterCompcitco 45955 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-rep 5213 ax-sep 5226 ax-nul 5233 ax-pr 5355 ax-un 7579 ax-inf2 9360 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4845 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-tr 5196 df-id 5488 df-eprel 5494 df-po 5502 df-so 5503 df-fr 5543 df-we 5545 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-pred 6199 df-ord 6266 df-on 6267 df-lim 6268 df-suc 6269 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-ov 7271 df-oprab 7272 df-mpo 7273 df-om 7701 df-2nd 7818 df-frecs 8081 df-wrecs 8112 df-recs 8186 df-rdg 8225 df-seq 13703 df-itco 45957 |
This theorem is referenced by: itcoval0 45960 itcoval1 45961 itcoval2 45962 itcoval3 45963 itcovalsuc 45965 |
Copyright terms: Public domain | W3C validator |