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

Theorem nnadd1com 12236
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 7403 . . 3 (𝑥 = 1 → (𝑥 + 1) = (1 + 1))
2 oveq2 7404 . . 3 (𝑥 = 1 → (1 + 𝑥) = (1 + 1))
31, 2eqeq12d 2778 . 2 (𝑥 = 1 → ((𝑥 + 1) = (1 + 𝑥) ↔ (1 + 1) = (1 + 1)))
4 oveq1 7403 . . 3 (𝑥 = 𝑦 → (𝑥 + 1) = (𝑦 + 1))
5 oveq2 7404 . . 3 (𝑥 = 𝑦 → (1 + 𝑥) = (1 + 𝑦))
64, 5eqeq12d 2778 . 2 (𝑥 = 𝑦 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝑦 + 1) = (1 + 𝑦)))
7 oveq1 7403 . . 3 (𝑥 = (𝑦 + 1) → (𝑥 + 1) = ((𝑦 + 1) + 1))
8 oveq2 7404 . . 3 (𝑥 = (𝑦 + 1) → (1 + 𝑥) = (1 + (𝑦 + 1)))
97, 8eqeq12d 2778 . 2 (𝑥 = (𝑦 + 1) → ((𝑥 + 1) = (1 + 𝑥) ↔ ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
10 oveq1 7403 . . 3 (𝑥 = 𝐴 → (𝑥 + 1) = (𝐴 + 1))
11 oveq2 7404 . . 3 (𝑥 = 𝐴 → (1 + 𝑥) = (1 + 𝐴))
1210, 11eqeq12d 2778 . 2 (𝑥 = 𝐴 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝐴 + 1) = (1 + 𝐴)))
13 eqid 2762 . 2 (1 + 1) = (1 + 1)
14 oveq1 7403 . . . 4 ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = ((1 + 𝑦) + 1))
15 1cnd 11175 . . . . 5 (𝑦 ∈ ℕ → 1 ∈ ℂ)
16 nncn 12218 . . . . 5 (𝑦 ∈ ℕ → 𝑦 ∈ ℂ)
1715, 16, 15addassd 11204 . . . 4 (𝑦 ∈ ℕ → ((1 + 𝑦) + 1) = (1 + (𝑦 + 1)))
1814, 17sylan9eqr 2819 . . 3 ((𝑦 ∈ ℕ ∧ (𝑦 + 1) = (1 + 𝑦)) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1)))
1918ex 416 . 2 (𝑦 ∈ ℕ → ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
203, 6, 9, 12, 13, 19nnind 12228 1 (𝐴 ∈ ℕ → (𝐴 + 1) = (1 + 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1560  wcel 2142  (class class class)co 7396  1c1 11074   + caddc 11076  cn 12210
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390  ax-un 7718  ax-1cn 11131  ax-addcl 11133  ax-addass 11138
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-nn 12211
This theorem is referenced by:  nnaddcom  12237  renegmulnnass  43087
  Copyright terms: Public domain W3C validator