Theorem itcovalt2 47450

Description: The value of the function that returns the n-th iterate of the "times 2 plus a constant" function with regard to composition. (Contributed by AV, 7-May-2024.)

Hypothesis

Ref	Expression
itcovalt2.f	⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 𝐶))

Assertion

Ref	Expression
itcovalt2	⊢ ((𝐼 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → ((IterComp‘𝐹)‘𝐼) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝐼)) − 𝐶)))

Distinct variable groups:   𝐶,𝑛   𝑛,𝐼

Allowed substitution hint:   𝐹(𝑛)

Proof of Theorem itcovalt2

Dummy variables 𝑦 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6890	. . . . 5 ⊢ (𝑥 = 0 → ((IterComp‘𝐹)‘𝑥) = ((IterComp‘𝐹)‘0))
2		oveq2 7419	. . . . . . . 8 ⊢ (𝑥 = 0 → (2↑𝑥) = (2↑0))
3	2	oveq2d 7427	. . . . . . 7 ⊢ (𝑥 = 0 → ((𝑛 + 𝐶) · (2↑𝑥)) = ((𝑛 + 𝐶) · (2↑0)))
4	3	oveq1d 7426	. . . . . 6 ⊢ (𝑥 = 0 → (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶) = (((𝑛 + 𝐶) · (2↑0)) − 𝐶))
5	4	mpteq2dv 5249	. . . . 5 ⊢ (𝑥 = 0 → (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑0)) − 𝐶)))
6	1, 5	eqeq12d 2746	. . . 4 ⊢ (𝑥 = 0 → (((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) ↔ ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑0)) − 𝐶))))
7	6	imbi2d 339	. . 3 ⊢ (𝑥 = 0 → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶))) ↔ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑0)) − 𝐶)))))
8		fveq2 6890	. . . . 5 ⊢ (𝑥 = 𝑦 → ((IterComp‘𝐹)‘𝑥) = ((IterComp‘𝐹)‘𝑦))
9		oveq2 7419	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (2↑𝑥) = (2↑𝑦))
10	9	oveq2d 7427	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑛 + 𝐶) · (2↑𝑥)) = ((𝑛 + 𝐶) · (2↑𝑦)))
11	10	oveq1d 7426	. . . . . 6 ⊢ (𝑥 = 𝑦 → (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶) = (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))
12	11	mpteq2dv 5249	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶)))
13	8, 12	eqeq12d 2746	. . . 4 ⊢ (𝑥 = 𝑦 → (((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) ↔ ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))))
14	13	imbi2d 339	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶))) ↔ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶)))))
15		fveq2 6890	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → ((IterComp‘𝐹)‘𝑥) = ((IterComp‘𝐹)‘(𝑦 + 1)))
16		oveq2 7419	. . . . . . . 8 ⊢ (𝑥 = (𝑦 + 1) → (2↑𝑥) = (2↑(𝑦 + 1)))
17	16	oveq2d 7427	. . . . . . 7 ⊢ (𝑥 = (𝑦 + 1) → ((𝑛 + 𝐶) · (2↑𝑥)) = ((𝑛 + 𝐶) · (2↑(𝑦 + 1))))
18	17	oveq1d 7426	. . . . . 6 ⊢ (𝑥 = (𝑦 + 1) → (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶) = (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶))
19	18	mpteq2dv 5249	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶)))
20	15, 19	eqeq12d 2746	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → (((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) ↔ ((IterComp‘𝐹)‘(𝑦 + 1)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶))))
21	20	imbi2d 339	. . 3 ⊢ (𝑥 = (𝑦 + 1) → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶))) ↔ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘(𝑦 + 1)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶)))))
22		fveq2 6890	. . . . 5 ⊢ (𝑥 = 𝐼 → ((IterComp‘𝐹)‘𝑥) = ((IterComp‘𝐹)‘𝐼))
23		oveq2 7419	. . . . . . . 8 ⊢ (𝑥 = 𝐼 → (2↑𝑥) = (2↑𝐼))
24	23	oveq2d 7427	. . . . . . 7 ⊢ (𝑥 = 𝐼 → ((𝑛 + 𝐶) · (2↑𝑥)) = ((𝑛 + 𝐶) · (2↑𝐼)))
25	24	oveq1d 7426	. . . . . 6 ⊢ (𝑥 = 𝐼 → (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶) = (((𝑛 + 𝐶) · (2↑𝐼)) − 𝐶))
26	25	mpteq2dv 5249	. . . . 5 ⊢ (𝑥 = 𝐼 → (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝐼)) − 𝐶)))
27	22, 26	eqeq12d 2746	. . . 4 ⊢ (𝑥 = 𝐼 → (((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶)) ↔ ((IterComp‘𝐹)‘𝐼) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝐼)) − 𝐶))))
28	27	imbi2d 339	. . 3 ⊢ (𝑥 = 𝐼 → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑥) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑥)) − 𝐶))) ↔ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝐼) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝐼)) − 𝐶)))))
29		itcovalt2.f	. . . 4 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 𝐶))
30	29	itcovalt2lem1 47448	. . 3 ⊢ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑0)) − 𝐶)))
31		pm2.27 42	. . . . . . 7 ⊢ (𝐶 ∈ ℕ0 → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))) → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))))
32	31	adantl 480	. . . . . 6 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))) → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))))
33	29	itcovalt2lem2 47449	. . . . . 6 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → (((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶)) → ((IterComp‘𝐹)‘(𝑦 + 1)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶))))
34	32, 33	syld 47	. . . . 5 ⊢ ((𝑦 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))) → ((IterComp‘𝐹)‘(𝑦 + 1)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶))))
35	34	ex 411	. . . 4 ⊢ (𝑦 ∈ ℕ0 → (𝐶 ∈ ℕ0 → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))) → ((IterComp‘𝐹)‘(𝑦 + 1)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶)))))
36	35	com23 86	. . 3 ⊢ (𝑦 ∈ ℕ0 → ((𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝑦) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝑦)) − 𝐶))) → (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘(𝑦 + 1)) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑(𝑦 + 1))) − 𝐶)))))
37	7, 14, 21, 28, 30, 36	nn0ind 12661	. 2 ⊢ (𝐼 ∈ ℕ0 → (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘𝐼) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝐼)) − 𝐶))))
38	37	imp 405	1 ⊢ ((𝐼 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → ((IterComp‘𝐹)‘𝐼) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑𝐼)) − 𝐶)))

Syntax hints:   → wi 4   ∧ wa 394   = wceq 1539   ∈ wcel 2104   ↦ cmpt 5230  ‘cfv 6542  (class class class)co 7411  0cc0 11112  1c1 11113   + caddc 11115   · cmul 11117   − cmin 11448  2c2 12271  ℕ₀cn0 12476  ↑cexp 14031  IterCompcitco 47430

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7727  ax-inf2 9638  ax-cnex 11168  ax-resscn 11169  ax-1cn 11170  ax-icn 11171  ax-addcl 11172  ax-addrcl 11173  ax-mulcl 11174  ax-mulrcl 11175  ax-mulcom 11176  ax-addass 11177  ax-mulass 11178  ax-distr 11179  ax-i2m1 11180  ax-1ne0 11181  ax-1rid 11182  ax-rnegex 11183  ax-rrecex 11184  ax-cnre 11185  ax-pre-lttri 11186  ax-pre-lttrn 11187  ax-pre-ltadd 11188  ax-pre-mulgt0 11189

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6299  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7367  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7858  df-2nd 7978  df-frecs 8268  df-wrecs 8299  df-recs 8373  df-rdg 8412  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-pnf 11254  df-mnf 11255  df-xr 11256  df-ltxr 11257  df-le 11258  df-sub 11450  df-neg 11451  df-nn 12217  df-2 12279  df-n0 12477  df-z 12563  df-uz 12827  df-seq 13971  df-exp 14032  df-itco 47432

This theorem is referenced by:  ackval3  47456