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

Theorem nnadd1com 12191
Description: Addition with 1 is commutative for natural numbers. (Contributed by Steven Nguyen, 9-Dec-2022.)
Assertion
Ref Expression
nnadd1com (𝐴 ∈ ℕ → (𝐴 + 1) = (1 + 𝐴))

Proof of Theorem nnadd1com
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 7363 . . 3 (𝑥 = 1 → (𝑥 + 1) = (1 + 1))
2 oveq2 7364 . . 3 (𝑥 = 1 → (1 + 𝑥) = (1 + 1))
31, 2eqeq12d 2755 . 2 (𝑥 = 1 → ((𝑥 + 1) = (1 + 𝑥) ↔ (1 + 1) = (1 + 1)))
4 oveq1 7363 . . 3 (𝑥 = 𝑦 → (𝑥 + 1) = (𝑦 + 1))
5 oveq2 7364 . . 3 (𝑥 = 𝑦 → (1 + 𝑥) = (1 + 𝑦))
64, 5eqeq12d 2755 . 2 (𝑥 = 𝑦 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝑦 + 1) = (1 + 𝑦)))
7 oveq1 7363 . . 3 (𝑥 = (𝑦 + 1) → (𝑥 + 1) = ((𝑦 + 1) + 1))
8 oveq2 7364 . . 3 (𝑥 = (𝑦 + 1) → (1 + 𝑥) = (1 + (𝑦 + 1)))
97, 8eqeq12d 2755 . 2 (𝑥 = (𝑦 + 1) → ((𝑥 + 1) = (1 + 𝑥) ↔ ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
10 oveq1 7363 . . 3 (𝑥 = 𝐴 → (𝑥 + 1) = (𝐴 + 1))
11 oveq2 7364 . . 3 (𝑥 = 𝐴 → (1 + 𝑥) = (1 + 𝐴))
1210, 11eqeq12d 2755 . 2 (𝑥 = 𝐴 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝐴 + 1) = (1 + 𝐴)))
13 eqid 2739 . 2 (1 + 1) = (1 + 1)
14 oveq1 7363 . . . 4 ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = ((1 + 𝑦) + 1))
15 1cnd 11130 . . . . 5 (𝑦 ∈ ℕ → 1 ∈ ℂ)
16 nncn 12173 . . . . 5 (𝑦 ∈ ℕ → 𝑦 ∈ ℂ)
1715, 16, 15addassd 11158 . . . 4 (𝑦 ∈ ℕ → ((1 + 𝑦) + 1) = (1 + (𝑦 + 1)))
1814, 17sylan9eqr 2796 . . 3 ((𝑦 ∈ ℕ ∧ (𝑦 + 1) = (1 + 𝑦)) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1)))
1918ex 413 . 2 (𝑦 ∈ ℕ → ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
203, 6, 9, 12, 13, 19nnind 12183 1 (𝐴 ∈ ℕ → (𝐴 + 1) = (1 + 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  (class class class)co 7356  1c1 11030   + caddc 11032  cn 12165
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-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678  ax-1cn 11087  ax-addcl 11089  ax-addass 11094
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-nn 12166
This theorem is referenced by:  nnaddcom  12192  renegmulnnass  42955
  Copyright terms: Public domain W3C validator