| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > add1p1 | Structured version Visualization version GIF version | ||
| Description: Adding two times 1 to a number. (Contributed by AV, 22-Sep-2018.) |
| Ref | Expression |
|---|---|
| add1p1 | ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . 3 ⊢ (𝑁 ∈ ℂ → 𝑁 ∈ ℂ) | |
| 2 | 1cnd 11341 | . . 3 ⊢ (𝑁 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2, 2 | addassd 11370 | . 2 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1))) |
| 4 | 1p1e2 12506 | . . . 4 ⊢ (1 + 1) = 2 | |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℂ → (1 + 1) = 2) |
| 6 | 5 | oveq2d 7467 | . 2 ⊢ (𝑁 ∈ ℂ → (𝑁 + (1 + 1)) = (𝑁 + 2)) |
| 7 | 3, 6 | eqtrd 2798 | 1 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 (class class class)co 7451 ℂcc 11237 1c1 11240 + caddc 11242 2c2 12437 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-1cn 11297 ax-addass 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-iota 6520 df-fv 6574 df-ov 7454 df-2 12445 |
| This theorem is used by: nneo 12823 ccatw2s1len 14815 chfacfscmul0 23231 chfacfscmulfsupp 23232 chfacfscmulgsum 23233 chfacfpmmul0 23235 chfacfpmmulfsupp 23236 chfacfpmmulgsum 23237 upgrwlkdvdelem 30379 poimirlem7 38813 fmtnoprmfac2 48986 fmtnofac1 48989 evenltle 49149 gpg5nbgrvtx03starlem2 49501 |
| Copyright terms: Public domain | W3C validator |