Theorem nnaass 6758

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 6093	. . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o 𝐶))
2		oveq2 6093	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐵 +o 𝑥) = (𝐵 +o 𝐶))
3	2	oveq2d 6101	. . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o 𝐶)))
4	1, 3	eqeq12d 2253	. . . . 5 ⊢ (𝑥 = 𝐶 → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶))))
5	4	imbi2d 230	. . . 4 ⊢ (𝑥 = 𝐶 → (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥))) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶)))))
6		oveq2 6093	. . . . . 6 ⊢ (𝑥 = ∅ → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o ∅))
7		oveq2 6093	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐵 +o 𝑥) = (𝐵 +o ∅))
8	7	oveq2d 6101	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o ∅)))
9	6, 8	eqeq12d 2253	. . . . 5 ⊢ (𝑥 = ∅ → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o (𝐵 +o ∅))))
10		oveq2 6093	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o 𝑦))
11		oveq2 6093	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o 𝑦))
12	11	oveq2d 6101	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o 𝑦)))
13	10, 12	eqeq12d 2253	. . . . 5 ⊢ (𝑥 = 𝑦 → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦))))
14		oveq2 6093	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → ((𝐴 +o 𝐵) +o 𝑥) = ((𝐴 +o 𝐵) +o suc 𝑦))
15		oveq2 6093	. . . . . . 7 ⊢ (𝑥 = suc 𝑦 → (𝐵 +o 𝑥) = (𝐵 +o suc 𝑦))
16	15	oveq2d 6101	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (𝐴 +o (𝐵 +o 𝑥)) = (𝐴 +o (𝐵 +o suc 𝑦)))
17	14, 16	eqeq12d 2253	. . . . 5 ⊢ (𝑥 = suc 𝑦 → (((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥)) ↔ ((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦))))
18		nnacl 6753	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω)
19		nna0 6747	. . . . . . 7 ⊢ ((𝐴 +o 𝐵) ∈ ω → ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o 𝐵))
20	18, 19	syl 14	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o 𝐵))
21		nna0 6747	. . . . . . . 8 ⊢ (𝐵 ∈ ω → (𝐵 +o ∅) = 𝐵)
22	21	oveq2d 6101	. . . . . . 7 ⊢ (𝐵 ∈ ω → (𝐴 +o (𝐵 +o ∅)) = (𝐴 +o 𝐵))
23	22	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o (𝐵 +o ∅)) = (𝐴 +o 𝐵))
24	20, 23	eqtr4d 2274	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o ∅) = (𝐴 +o (𝐵 +o ∅)))
25		suceq 4547	. . . . . . 7 ⊢ (((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦)) → suc ((𝐴 +o 𝐵) +o 𝑦) = suc (𝐴 +o (𝐵 +o 𝑦)))
26		nnasuc 6749	. . . . . . . . 9 ⊢ (((𝐴 +o 𝐵) ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 +o 𝐵) +o suc 𝑦) = suc ((𝐴 +o 𝐵) +o 𝑦))
27	18, 26	sylan 283	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → ((𝐴 +o 𝐵) +o suc 𝑦) = suc ((𝐴 +o 𝐵) +o 𝑦))
28		nnasuc 6749	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
29	28	oveq2d 6101	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o (𝐵 +o suc 𝑦)) = (𝐴 +o suc (𝐵 +o 𝑦)))
30	29	adantl 277	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω)) → (𝐴 +o (𝐵 +o suc 𝑦)) = (𝐴 +o suc (𝐵 +o 𝑦)))
31		nnacl 6753	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o 𝑦) ∈ ω)
32		nnasuc 6749	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ω ∧ (𝐵 +o 𝑦) ∈ ω) → (𝐴 +o suc (𝐵 +o 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
33	31, 32	sylan2 286	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω)) → (𝐴 +o suc (𝐵 +o 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
34	30, 33	eqtrd 2271	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω)) → (𝐴 +o (𝐵 +o suc 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
35	34	anassrs 404	. . . . . . . 8 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → (𝐴 +o (𝐵 +o suc 𝑦)) = suc (𝐴 +o (𝐵 +o 𝑦)))
36	27, 35	eqeq12d 2253	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → (((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦)) ↔ suc ((𝐴 +o 𝐵) +o 𝑦) = suc (𝐴 +o (𝐵 +o 𝑦))))
37	25, 36	imbitrrid 156	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → (((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦)) → ((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦))))
38	37	expcom 116	. . . . 5 ⊢ (𝑦 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (((𝐴 +o 𝐵) +o 𝑦) = (𝐴 +o (𝐵 +o 𝑦)) → ((𝐴 +o 𝐵) +o suc 𝑦) = (𝐴 +o (𝐵 +o suc 𝑦)))))
39	9, 13, 17, 24, 38	finds2 4748	. . . 4 ⊢ (𝑥 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝑥) = (𝐴 +o (𝐵 +o 𝑥))))
40	5, 39	vtoclga 2889	. . 3 ⊢ (𝐶 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶))))
41	40	com12 30	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐶 ∈ ω → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶))))
42	41	3impia 1231	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) +o 𝐶) = (𝐴 +o (𝐵 +o 𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∅c0 3520  suc csuc 4510  ωcom 4737  (class class class)co 6085   +_o coa 6684

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-oadd 6691

This theorem is used by:  nndi  6759  nnmsucr  6761  addasspig  7697  addassnq0  7829  prarloclemlo  7861