Theorem nnadd1com 12385

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.

Step	Hyp	Ref	Expression
1		oveq1 7447	. . 3 ⊢ (𝑥 = 1 → (𝑥 + 1) = (1 + 1))
2		oveq2 7448	. . 3 ⊢ (𝑥 = 1 → (1 + 𝑥) = (1 + 1))
3	1, 2	eqeq12d 2779	. 2 ⊢ (𝑥 = 1 → ((𝑥 + 1) = (1 + 𝑥) ↔ (1 + 1) = (1 + 1)))
4		oveq1 7447	. . 3 ⊢ (𝑥 = 𝑦 → (𝑥 + 1) = (𝑦 + 1))
5		oveq2 7448	. . 3 ⊢ (𝑥 = 𝑦 → (1 + 𝑥) = (1 + 𝑦))
6	4, 5	eqeq12d 2779	. 2 ⊢ (𝑥 = 𝑦 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝑦 + 1) = (1 + 𝑦)))
7		oveq1 7447	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (𝑥 + 1) = ((𝑦 + 1) + 1))
8		oveq2 7448	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (1 + 𝑥) = (1 + (𝑦 + 1)))
9	7, 8	eqeq12d 2779	. 2 ⊢ (𝑥 = (𝑦 + 1) → ((𝑥 + 1) = (1 + 𝑥) ↔ ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
10		oveq1 7447	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 + 1) = (𝐴 + 1))
11		oveq2 7448	. . 3 ⊢ (𝑥 = 𝐴 → (1 + 𝑥) = (1 + 𝐴))
12	10, 11	eqeq12d 2779	. 2 ⊢ (𝑥 = 𝐴 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝐴 + 1) = (1 + 𝐴)))
13		eqid 2763	. 2 ⊢ (1 + 1) = (1 + 1)
14		oveq1 7447	. . . 4 ⊢ ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = ((1 + 𝑦) + 1))
15		1cnd 11326	. . . . 5 ⊢ (𝑦 ∈ ℕ → 1 ∈ ℂ)
16		nncn 12367	. . . . 5 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℂ)
17	15, 16, 15	addassd 11355	. . . 4 ⊢ (𝑦 ∈ ℕ → ((1 + 𝑦) + 1) = (1 + (𝑦 + 1)))
18	14, 17	sylan9eqr 2820	. . 3 ⊢ ((𝑦 ∈ ℕ ∧ (𝑦 + 1) = (1 + 𝑦)) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1)))
19	18	ex 418	. 2 ⊢ (𝑦 ∈ ℕ → ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
20	3, 6, 9, 12, 13, 19	nnind 12377	1 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) = (1 + 𝐴))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  (class class class)co 7440  1c1 11225   + caddc 11227  ℕcn 12359

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772  ax-1cn 11282  ax-addcl 11284  ax-addass 11289

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-nn 12360

This theorem is used by:  nnaddcom  12386  renegmulnnass  43720