![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > ackval2012 | Structured version Visualization version GIF version |
Description: The Ackermann function at (2,0), (2,1), (2,2). (Contributed by AV, 4-May-2024.) |
Ref | Expression |
---|---|
ackval2012 | ⊢ ⟨((Ack‘2)‘0), ((Ack‘2)‘1), ((Ack‘2)‘2)⟩ = ⟨3, 5, 7⟩ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ackval2 47556 | . 2 ⊢ (Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) | |
2 | oveq2 7409 | . . . . . 6 ⊢ (𝑛 = 0 → (2 · 𝑛) = (2 · 0)) | |
3 | 2 | oveq1d 7416 | . . . . 5 ⊢ (𝑛 = 0 → ((2 · 𝑛) + 3) = ((2 · 0) + 3)) |
4 | 2t0e0 12378 | . . . . . . 7 ⊢ (2 · 0) = 0 | |
5 | 4 | oveq1i 7411 | . . . . . 6 ⊢ ((2 · 0) + 3) = (0 + 3) |
6 | 3cn 12290 | . . . . . . 7 ⊢ 3 ∈ ℂ | |
7 | 6 | addlidi 11399 | . . . . . 6 ⊢ (0 + 3) = 3 |
8 | 5, 7 | eqtri 2752 | . . . . 5 ⊢ ((2 · 0) + 3) = 3 |
9 | 3, 8 | eqtrdi 2780 | . . . 4 ⊢ (𝑛 = 0 → ((2 · 𝑛) + 3) = 3) |
10 | 0nn0 12484 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
11 | 10 | a1i 11 | . . . 4 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → 0 ∈ ℕ0) |
12 | 3nn0 12487 | . . . . 5 ⊢ 3 ∈ ℕ0 | |
13 | 12 | a1i 11 | . . . 4 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → 3 ∈ ℕ0) |
14 | 1, 9, 11, 13 | fvmptd3 7011 | . . 3 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → ((Ack‘2)‘0) = 3) |
15 | oveq2 7409 | . . . . . 6 ⊢ (𝑛 = 1 → (2 · 𝑛) = (2 · 1)) | |
16 | 15 | oveq1d 7416 | . . . . 5 ⊢ (𝑛 = 1 → ((2 · 𝑛) + 3) = ((2 · 1) + 3)) |
17 | 2t1e2 12372 | . . . . . . 7 ⊢ (2 · 1) = 2 | |
18 | 17 | oveq1i 7411 | . . . . . 6 ⊢ ((2 · 1) + 3) = (2 + 3) |
19 | 2cn 12284 | . . . . . . 7 ⊢ 2 ∈ ℂ | |
20 | 3p2e5 12360 | . . . . . . 7 ⊢ (3 + 2) = 5 | |
21 | 6, 19, 20 | addcomli 11403 | . . . . . 6 ⊢ (2 + 3) = 5 |
22 | 18, 21 | eqtri 2752 | . . . . 5 ⊢ ((2 · 1) + 3) = 5 |
23 | 16, 22 | eqtrdi 2780 | . . . 4 ⊢ (𝑛 = 1 → ((2 · 𝑛) + 3) = 5) |
24 | 1nn0 12485 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
25 | 24 | a1i 11 | . . . 4 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → 1 ∈ ℕ0) |
26 | 5nn0 12489 | . . . . 5 ⊢ 5 ∈ ℕ0 | |
27 | 26 | a1i 11 | . . . 4 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → 5 ∈ ℕ0) |
28 | 1, 23, 25, 27 | fvmptd3 7011 | . . 3 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → ((Ack‘2)‘1) = 5) |
29 | oveq2 7409 | . . . . . 6 ⊢ (𝑛 = 2 → (2 · 𝑛) = (2 · 2)) | |
30 | 29 | oveq1d 7416 | . . . . 5 ⊢ (𝑛 = 2 → ((2 · 𝑛) + 3) = ((2 · 2) + 3)) |
31 | 2t2e4 12373 | . . . . . . 7 ⊢ (2 · 2) = 4 | |
32 | 31 | oveq1i 7411 | . . . . . 6 ⊢ ((2 · 2) + 3) = (4 + 3) |
33 | 4p3e7 12363 | . . . . . 6 ⊢ (4 + 3) = 7 | |
34 | 32, 33 | eqtri 2752 | . . . . 5 ⊢ ((2 · 2) + 3) = 7 |
35 | 30, 34 | eqtrdi 2780 | . . . 4 ⊢ (𝑛 = 2 → ((2 · 𝑛) + 3) = 7) |
36 | 2nn0 12486 | . . . . 5 ⊢ 2 ∈ ℕ0 | |
37 | 36 | a1i 11 | . . . 4 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → 2 ∈ ℕ0) |
38 | 7nn0 12491 | . . . . 5 ⊢ 7 ∈ ℕ0 | |
39 | 38 | a1i 11 | . . . 4 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → 7 ∈ ℕ0) |
40 | 1, 35, 37, 39 | fvmptd3 7011 | . . 3 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → ((Ack‘2)‘2) = 7) |
41 | 14, 28, 40 | oteq123d 4880 | . 2 ⊢ ((Ack‘2) = (𝑛 ∈ ℕ0 ↦ ((2 · 𝑛) + 3)) → ⟨((Ack‘2)‘0), ((Ack‘2)‘1), ((Ack‘2)‘2)⟩ = ⟨3, 5, 7⟩) |
42 | 1, 41 | ax-mp 5 | 1 ⊢ ⟨((Ack‘2)‘0), ((Ack‘2)‘1), ((Ack‘2)‘2)⟩ = ⟨3, 5, 7⟩ |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2098 ⟨cotp 4628 ↦ cmpt 5221 ‘cfv 6533 (class class class)co 7401 0cc0 11106 1c1 11107 + caddc 11109 · cmul 11111 2c2 12264 3c3 12265 4c4 12266 5c5 12267 7c7 12269 ℕ0cn0 12469 Ackcack 47532 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5275 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-inf2 9632 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-ot 4629 df-uni 4900 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-2nd 7969 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-5 12275 df-6 12276 df-7 12277 df-n0 12470 df-z 12556 df-uz 12820 df-seq 13964 df-itco 47533 df-ack 47534 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |