MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  add1p1 Structured version   Visualization version   GIF version

Theorem add1p1 12419
Description: Adding two times 1 to a number. (Contributed by AV, 22-Sep-2018.)
Assertion
Ref Expression
add1p1 (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2))

Proof of Theorem add1p1
StepHypRef Expression
1 id 22 . . 3 (𝑁 ∈ ℂ → 𝑁 ∈ ℂ)
2 1cnd 11130 . . 3 (𝑁 ∈ ℂ → 1 ∈ ℂ)
31, 2, 2addassd 11158 . 2 (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1)))
4 1p1e2 12292 . . . 4 (1 + 1) = 2
54a1i 11 . . 3 (𝑁 ∈ ℂ → (1 + 1) = 2)
65oveq2d 7372 . 2 (𝑁 ∈ ℂ → (𝑁 + (1 + 1)) = (𝑁 + 2))
73, 6eqtrd 2774 1 (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  (class class class)co 7356  cc 11027  1c1 11030   + caddc 11032  2c2 12227
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-1cn 11087  ax-addass 11094
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-iota 6441  df-fv 6493  df-ov 7359  df-2 12235
This theorem is referenced by:  nneo  12604  ccatw2s1len  14579  chfacfscmul0  22841  chfacfscmulfsupp  22842  chfacfscmulgsum  22843  chfacfpmmul0  22845  chfacfpmmulfsupp  22846  chfacfpmmulgsum  22847  upgrwlkdvdelem  29822  poimirlem7  37994  fmtnoprmfac2  48045  fmtnofac1  48048  evenltle  48208  gpg5nbgrvtx03starlem2  48560
  Copyright terms: Public domain W3C validator