Theorem nnadd1com 42637

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 7375	. . 3 ⊢ (𝑥 = 1 → (𝑥 + 1) = (1 + 1))
2		oveq2 7376	. . 3 ⊢ (𝑥 = 1 → (1 + 𝑥) = (1 + 1))
3	1, 2	eqeq12d 2753	. 2 ⊢ (𝑥 = 1 → ((𝑥 + 1) = (1 + 𝑥) ↔ (1 + 1) = (1 + 1)))
4		oveq1 7375	. . 3 ⊢ (𝑥 = 𝑦 → (𝑥 + 1) = (𝑦 + 1))
5		oveq2 7376	. . 3 ⊢ (𝑥 = 𝑦 → (1 + 𝑥) = (1 + 𝑦))
6	4, 5	eqeq12d 2753	. 2 ⊢ (𝑥 = 𝑦 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝑦 + 1) = (1 + 𝑦)))
7		oveq1 7375	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (𝑥 + 1) = ((𝑦 + 1) + 1))
8		oveq2 7376	. . 3 ⊢ (𝑥 = (𝑦 + 1) → (1 + 𝑥) = (1 + (𝑦 + 1)))
9	7, 8	eqeq12d 2753	. 2 ⊢ (𝑥 = (𝑦 + 1) → ((𝑥 + 1) = (1 + 𝑥) ↔ ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
10		oveq1 7375	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 + 1) = (𝐴 + 1))
11		oveq2 7376	. . 3 ⊢ (𝑥 = 𝐴 → (1 + 𝑥) = (1 + 𝐴))
12	10, 11	eqeq12d 2753	. 2 ⊢ (𝑥 = 𝐴 → ((𝑥 + 1) = (1 + 𝑥) ↔ (𝐴 + 1) = (1 + 𝐴)))
13		eqid 2737	. 2 ⊢ (1 + 1) = (1 + 1)
14		oveq1 7375	. . . 4 ⊢ ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = ((1 + 𝑦) + 1))
15		1cnd 11139	. . . . 5 ⊢ (𝑦 ∈ ℕ → 1 ∈ ℂ)
16		nncn 12165	. . . . 5 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℂ)
17	15, 16, 15	addassd 11166	. . . 4 ⊢ (𝑦 ∈ ℕ → ((1 + 𝑦) + 1) = (1 + (𝑦 + 1)))
18	14, 17	sylan9eqr 2794	. . 3 ⊢ ((𝑦 ∈ ℕ ∧ (𝑦 + 1) = (1 + 𝑦)) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1)))
19	18	ex 412	. 2 ⊢ (𝑦 ∈ ℕ → ((𝑦 + 1) = (1 + 𝑦) → ((𝑦 + 1) + 1) = (1 + (𝑦 + 1))))
20	3, 6, 9, 12, 13, 19	nnind 12175	1 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) = (1 + 𝐴))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  (class class class)co 7368  1c1 11039   + caddc 11041  ℕcn 12157

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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690  ax-1cn 11096  ax-addcl 11098  ax-addass 11103

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-om 7819  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-nn 12158

This theorem is referenced by:  nnaddcom  42638  renegmulnnass  42835