| 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 22 | . . 3 ⊢ (𝑁 ∈ ℂ → 𝑁 ∈ ℂ) | |
| 2 | 1cnd 11139 | . . 3 ⊢ (𝑁 ∈ ℂ → 1 ∈ ℂ) | |
| 3 | 1, 2, 2 | addassd 11166 | . 2 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1))) |
| 4 | 1p1e2 12277 | . . . 4 ⊢ (1 + 1) = 2 | |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℂ → (1 + 1) = 2) |
| 6 | 5 | oveq2d 7384 | . 2 ⊢ (𝑁 ∈ ℂ → (𝑁 + (1 + 1)) = (𝑁 + 2)) |
| 7 | 3, 6 | eqtrd 2772 | 1 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7368 ℂcc 11036 1c1 11039 + caddc 11041 2c2 12212 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-1cn 11096 ax-addass 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-ov 7371 df-2 12220 |
| This theorem is referenced by: nneo 12588 ccatw2s1len 14561 chfacfscmul0 22814 chfacfscmulfsupp 22815 chfacfscmulgsum 22816 chfacfpmmul0 22818 chfacfpmmulfsupp 22819 chfacfpmmulgsum 22820 upgrwlkdvdelem 29821 poimirlem7 37878 fmtnoprmfac2 47927 fmtnofac1 47930 evenltle 48077 gpg5nbgrvtx03starlem2 48429 |
| Copyright terms: Public domain | W3C validator |