| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > itcovalt2lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for itcovalt2 49788: induction basis. (Contributed by AV, 5-May-2024.) |
| Ref | Expression |
|---|---|
| itcovalt2.f | ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 𝐶)) |
| Ref | Expression |
|---|---|
| itcovalt2lem1 | ⊢ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑0)) − 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0ex 12612 | . . . 4 ⊢ ℕ0 ∈ V | |
| 2 | ovexd 7455 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → ((2 · 𝑛) + 𝐶) ∈ V) | |
| 3 | 2 | rgen 3079 | . . . 4 ⊢ ∀𝑛 ∈ ℕ0 ((2 · 𝑛) + 𝐶) ∈ V |
| 4 | 1, 3 | pm3.2i 476 | . . 3 ⊢ (ℕ0 ∈ V ∧ ∀𝑛 ∈ ℕ0 ((2 · 𝑛) + 𝐶) ∈ V) |
| 5 | itcovalt2.f | . . . 4 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 𝐶)) | |
| 6 | 5 | itcoval0mpt 49777 | . . 3 ⊢ ((ℕ0 ∈ V ∧ ∀𝑛 ∈ ℕ0 ((2 · 𝑛) + 𝐶) ∈ V) → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ 𝑛)) |
| 7 | 4, 6 | mp1i 14 | . 2 ⊢ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ 𝑛)) |
| 8 | simpr 490 | . . . . . 6 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → 𝑛 ∈ ℕ0) | |
| 9 | 8 | nn0cnd 12669 | . . . . 5 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → 𝑛 ∈ ℂ) |
| 10 | simpl 488 | . . . . . 6 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → 𝐶 ∈ ℕ0) | |
| 11 | 10 | nn0cnd 12669 | . . . . 5 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → 𝐶 ∈ ℂ) |
| 12 | 2nn0 12623 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
| 13 | 12 | numexp0 17253 | . . . . . . . 8 ⊢ (2↑0) = 1 |
| 14 | 13 | a1i 11 | . . . . . . 7 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (2↑0) = 1) |
| 15 | 14 | oveq2d 7436 | . . . . . 6 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → ((𝑛 + 𝐶) · (2↑0)) = ((𝑛 + 𝐶) · 1)) |
| 16 | 8, 10 | nn0addcld 12671 | . . . . . . . 8 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (𝑛 + 𝐶) ∈ ℕ0) |
| 17 | 16 | nn0cnd 12669 | . . . . . . 7 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (𝑛 + 𝐶) ∈ ℂ) |
| 18 | 17 | mulridd 11326 | . . . . . 6 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → ((𝑛 + 𝐶) · 1) = (𝑛 + 𝐶)) |
| 19 | 15, 18 | eqtrd 2796 | . . . . 5 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → ((𝑛 + 𝐶) · (2↑0)) = (𝑛 + 𝐶)) |
| 20 | 9, 11, 19 | mvrraddd 11727 | . . . 4 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → (((𝑛 + 𝐶) · (2↑0)) − 𝐶) = 𝑛) |
| 21 | 20 | eqcomd 2767 | . . 3 ⊢ ((𝐶 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0) → 𝑛 = (((𝑛 + 𝐶) · (2↑0)) − 𝐶)) |
| 22 | 21 | mpteq2dva 5198 | . 2 ⊢ (𝐶 ∈ ℕ0 → (𝑛 ∈ ℕ0 ↦ 𝑛) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑0)) − 𝐶))) |
| 23 | 7, 22 | eqtrd 2796 | 1 ⊢ (𝐶 ∈ ℕ0 → ((IterComp‘𝐹)‘0) = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 𝐶) · (2↑0)) − 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 Vcvv 3451 ↦ cmpt 5186 ‘cfv 6538 (class class class)co 7420 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 − cmin 11541 2c2 12397 ℕ0cn0 12606 ↑cexp 14204 IterCompcitco 49768 |
| 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-pow 5327 ax-pr 5391 ax-un 7751 ax-inf2 9642 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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-nel 3063 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 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-n0 12607 df-z 12694 df-uz 12966 df-seq 14145 df-exp 14205 df-itco 49770 |
| This theorem is used by: itcovalt2 49788 |
| Copyright terms: Public domain | W3C validator |