Theorem nnaass 8613

Description: Addition of natural numbers is associative. Theorem 4K(1) of [Enderton] p. 81. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)

Assertion

Ref	Expression
nnaass	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶)))

Proof of Theorem nnaass

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7424	. . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o 𝐶))
2		oveq2 7424	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐵 +o 𝑥) = (𝐵 +o 𝐶))
3	2	oveq2d 7432	. . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o 𝐶)))
4	1, 3	eqeq12d 2778	. . . . 5 ⊢ (𝑥 = 𝐶 → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶))))
5	4	imbi2d 343	. . . 4 ⊢ (𝑥 = 𝐶 → (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥))) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶)))))
6		oveq2 7424	. . . . . 6 ⊢ (𝑥 = ∅ → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o ∅))
7		oveq2 7424	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐵 +o 𝑥) = (𝐵 +o ∅))
8	7	oveq2d 7432	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o ∅)))
9	6, 8	eqeq12d 2778	. . . . 5 ⊢ (𝑥 = ∅ → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o (𝐵 +o ∅))))
10		oveq2 7424	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o 𝑦))
11		oveq2 7424	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o 𝑦))
12	11	oveq2d 7432	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o 𝑦)))
13	10, 12	eqeq12d 2778	. . . . 5 ⊢ (𝑥 = 𝑦 → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦))))
14		oveq2 7424	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o suc 𝑦))
15		oveq2 7424	. . . . . . 7 ⊢ (𝑥 = suc 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o suc 𝑦))
16	15	oveq2d 7432	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o suc 𝑦)))
17	14, 16	eqeq12d 2778	. . . . 5 ⊢ (𝑥 = suc 𝑦 → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦))))
18		nnacl 8602	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω)
19		nna0 8595	. . . . . . 7 ⊢ ((𝐴 +o 𝐵) ∈ ω → ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o 𝐵))
20	18, 19	syl 18	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o 𝐵))
21		nna0 8595	. . . . . . . 8 ⊢ (𝐵 ∈ ω → (𝐵 +o ∅) = 𝐵)
22	21	oveq2d 7432	. . . . . . 7 ⊢ (𝐵 ∈ ω → (𝐴 +o (𝐵 +o ∅)) = (𝐴 +o 𝐵))
23	22	adantl 487	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o (𝐵 +o ∅)) = (𝐴 +o 𝐵))
24	20, 23	eqtr4d 2800	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o (𝐵 +o ∅)))
25		suceq 6430	. . . . . . 7 ⊢ (((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦)) → suc ((𝐴 +o 𝐵) +o 𝑦) = suc (𝐴 +o (𝐵 +o 𝑦)))
26		nnasuc 8597	. . . . . . . . 9 ⊢ (((𝐴 +o 𝐵) ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o 𝐵) +o suc 𝑦) = suc ((𝐴 +o 𝐵) +o 𝑦))
27	18, 26	sylan 592	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → ((𝐴 +o 𝐵) +o suc 𝑦) = suc ((𝐴 +o 𝐵) +o 𝑦))
28		nnasuc 8597	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
29	28	oveq2d 7432	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o (𝐵 +o suc 𝑦)) = (𝐴 +o suc (𝐵 +o 𝑦)))
30	29	adantl 487	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω)) → (𝐴 +o (𝐵 +o suc 𝑦)) = (𝐴 +o suc (𝐵 +o 𝑦)))
31		nnacl 8602	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o 𝑦) ∈ ω)
32		nnasuc 8597	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ω ∧ (𝐵 +o 𝑦) ∈ ω) → (𝐴 +o suc (𝐵 +o 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
33	31, 32	sylan2 605	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω)) → (𝐴 +o suc (𝐵 +o 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
34	30, 33	eqtrd 2797	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω)) → (𝐴 +o (𝐵 +o suc 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
35	34	anassrs 473	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → (𝐴 +o (𝐵 +o suc 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
36	27, 35	eqeq12d 2778	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → (((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦)) ↔ suc ((𝐴 +o 𝐵) +o 𝑦) = suc (𝐴 +o (𝐵 +o 𝑦))))
37	25, 36	imbitrrid 249	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → (((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦)) → ((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦))))
38	37	expcom 419	. . . . 5 ⊢ (𝑦 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦)) → ((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦)))))
39	9, 13, 17, 24, 38	finds2 7898	. . . 4 ⊢ (𝑥 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥))))
40	5, 39	vtoclga 3539	. . 3 ⊢ (𝐶 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶))))
41	40	com12 33	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ∈ ω → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶))))
42	41	3impia 1135	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∅c0 4282  suc csuc 6363  (class class class)co 7416  ωcom 7865   +_o coa 8455

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-oadd 8462

This theorem is used by:  nndi  8614  nnmsucr  8616  omopthlem1  8650  omopthlem2  8651  addasspi  10907  naddcnfass  44197