| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ackval1 | Structured version Visualization version GIF version | ||
| Description: The Ackermann function at 1. (Contributed by AV, 4-May-2024.) |
| Ref | Expression |
|---|---|
| ackval1 | ⊢ (Ack‘1) = (𝑛 ∈ ℕ0 ↦ (𝑛 + 2)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1e0p1 12759 | . . 3 ⊢ 1 = (0 + 1) | |
| 2 | 1 | fveq2i 6886 | . 2 ⊢ (Ack‘1) = (Ack‘(0 + 1)) |
| 3 | 0nn0 12520 | . . 3 ⊢ 0 ∈ ℕ0 | |
| 4 | ackvalsuc1mpt 49441 | . . 3 ⊢ (0 ∈ ℕ0 → (Ack‘(0 + 1)) = (𝑛 ∈ ℕ0 ↦ (((IterComp‘(Ack‘0))‘(𝑛 + 1))‘1))) | |
| 5 | 3, 4 | ax-mp 5 | . 2 ⊢ (Ack‘(0 + 1)) = (𝑛 ∈ ℕ0 ↦ (((IterComp‘(Ack‘0))‘(𝑛 + 1))‘1)) |
| 6 | peano2nn0 12545 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ0) | |
| 7 | 1nn0 12521 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
| 8 | ackval0 49443 | . . . . . . . 8 ⊢ (Ack‘0) = (𝑖 ∈ ℕ0 ↦ (𝑖 + 1)) | |
| 9 | 8 | itcovalpc 49435 | . . . . . . 7 ⊢ (((𝑛 + 1) ∈ ℕ0 ∧ 1 ∈ ℕ0) → ((IterComp‘(Ack‘0))‘(𝑛 + 1)) = (𝑖 ∈ ℕ0 ↦ (𝑖 + (1 · (𝑛 + 1))))) |
| 10 | 6, 7, 9 | sylancl 597 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → ((IterComp‘(Ack‘0))‘(𝑛 + 1)) = (𝑖 ∈ ℕ0 ↦ (𝑖 + (1 · (𝑛 + 1))))) |
| 11 | nn0cn 12515 | . . . . . . . . . 10 ⊢ ((𝑛 + 1) ∈ ℕ0 → (𝑛 + 1) ∈ ℂ) | |
| 12 | 6, 11 | syl 18 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℂ) |
| 13 | 12 | mullidd 11228 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 → (1 · (𝑛 + 1)) = (𝑛 + 1)) |
| 14 | 13 | oveq2d 7428 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ0 → (𝑖 + (1 · (𝑛 + 1))) = (𝑖 + (𝑛 + 1))) |
| 15 | 14 | mpteq2dv 5206 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → (𝑖 ∈ ℕ0 ↦ (𝑖 + (1 · (𝑛 + 1)))) = (𝑖 ∈ ℕ0 ↦ (𝑖 + (𝑛 + 1)))) |
| 16 | 10, 15 | eqtrd 2798 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → ((IterComp‘(Ack‘0))‘(𝑛 + 1)) = (𝑖 ∈ ℕ0 ↦ (𝑖 + (𝑛 + 1)))) |
| 17 | 16 | fveq1d 6885 | . . . 4 ⊢ (𝑛 ∈ ℕ0 → (((IterComp‘(Ack‘0))‘(𝑛 + 1))‘1) = ((𝑖 ∈ ℕ0 ↦ (𝑖 + (𝑛 + 1)))‘1)) |
| 18 | eqidd 2764 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → (𝑖 ∈ ℕ0 ↦ (𝑖 + (𝑛 + 1))) = (𝑖 ∈ ℕ0 ↦ (𝑖 + (𝑛 + 1)))) | |
| 19 | oveq1 7419 | . . . . . 6 ⊢ (𝑖 = 1 → (𝑖 + (𝑛 + 1)) = (1 + (𝑛 + 1))) | |
| 20 | 19 | adantl 486 | . . . . 5 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑖 = 1) → (𝑖 + (𝑛 + 1)) = (1 + (𝑛 + 1))) |
| 21 | 7 | a1i 11 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → 1 ∈ ℕ0) |
| 22 | ovexd 7447 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → (1 + (𝑛 + 1)) ∈ V) | |
| 23 | 18, 20, 21, 22 | fvmptd 6999 | . . . 4 ⊢ (𝑛 ∈ ℕ0 → ((𝑖 ∈ ℕ0 ↦ (𝑖 + (𝑛 + 1)))‘1) = (1 + (𝑛 + 1))) |
| 24 | 1cnd 11203 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → 1 ∈ ℂ) | |
| 25 | nn0cn 12515 | . . . . . . 7 ⊢ (𝑛 ∈ ℕ0 → 𝑛 ∈ ℂ) | |
| 26 | peano2cn 11383 | . . . . . . 7 ⊢ (𝑛 ∈ ℂ → (𝑛 + 1) ∈ ℂ) | |
| 27 | 25, 26 | syl 18 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℂ) |
| 28 | 24, 27 | addcomd 11413 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → (1 + (𝑛 + 1)) = ((𝑛 + 1) + 1)) |
| 29 | 25, 24, 24 | addassd 11232 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → ((𝑛 + 1) + 1) = (𝑛 + (1 + 1))) |
| 30 | 1p1e2 12365 | . . . . . . 7 ⊢ (1 + 1) = 2 | |
| 31 | 30 | oveq2i 7423 | . . . . . 6 ⊢ (𝑛 + (1 + 1)) = (𝑛 + 2) |
| 32 | 31 | a1i 11 | . . . . 5 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + (1 + 1)) = (𝑛 + 2)) |
| 33 | 28, 29, 32 | 3eqtrd 2802 | . . . 4 ⊢ (𝑛 ∈ ℕ0 → (1 + (𝑛 + 1)) = (𝑛 + 2)) |
| 34 | 17, 23, 33 | 3eqtrd 2802 | . . 3 ⊢ (𝑛 ∈ ℕ0 → (((IterComp‘(Ack‘0))‘(𝑛 + 1))‘1) = (𝑛 + 2)) |
| 35 | 34 | mpteq2ia 5207 | . 2 ⊢ (𝑛 ∈ ℕ0 ↦ (((IterComp‘(Ack‘0))‘(𝑛 + 1))‘1)) = (𝑛 ∈ ℕ0 ↦ (𝑛 + 2)) |
| 36 | 2, 5, 35 | 3eqtri 2790 | 1 ⊢ (Ack‘1) = (𝑛 ∈ ℕ0 ↦ (𝑛 + 2)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 Vcvv 3455 ↦ cmpt 5193 ‘cfv 6538 (class class class)co 7412 ℂcc 11099 0cc0 11101 1c1 11102 + caddc 11104 · cmul 11106 2c2 12296 ℕ0cn0 12505 IterCompcitco 49420 Ackcack 49421 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-inf2 9611 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-n0 12506 df-z 12593 df-uz 12864 df-seq 14040 df-itco 49422 df-ack 49423 |
| This theorem is referenced by: ackval2 49445 ackval1012 49453 |
| Copyright terms: Public domain | W3C validator |