Theorem nnmcom 8555

Description: Multiplication of natural numbers is commutative. Theorem 4K(5) of [Enderton] p. 81. (Contributed by NM, 21-Sep-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)

Assertion

Ref	Expression
nnmcom	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))

Proof of Theorem nnmcom

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

Step	Hyp	Ref	Expression
1		oveq1 7367	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ·o 𝐵) = (𝐴 ·o 𝐵))
2		oveq2 7368	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝐴))
3	1, 2	eqeq12d 2753	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
4	3	imbi2d 340	. . 3 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)) ↔ (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))))
5		oveq1 7367	. . . . 5 ⊢ (𝑥 = ∅ → (𝑥 ·o 𝐵) = (∅ ·o 𝐵))
6		oveq2 7368	. . . . 5 ⊢ (𝑥 = ∅ → (𝐵 ·o 𝑥) = (𝐵 ·o ∅))
7	5, 6	eqeq12d 2753	. . . 4 ⊢ (𝑥 = ∅ → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (∅ ·o 𝐵) = (𝐵 ·o ∅)))
8		oveq1 7367	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ·o 𝐵) = (𝑦 ·o 𝐵))
9		oveq2 7368	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝑦))
10	8, 9	eqeq12d 2753	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝑦 ·o 𝐵) = (𝐵 ·o 𝑦)))
11		oveq1 7367	. . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝑥 ·o 𝐵) = (suc 𝑦 ·o 𝐵))
12		oveq2 7368	. . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o suc 𝑦))
13	11, 12	eqeq12d 2753	. . . 4 ⊢ (𝑥 = suc 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦)))
14		nnm0r 8539	. . . . 5 ⊢ (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
15		nnm0 8534	. . . . 5 ⊢ (𝐵 ∈ ω → (𝐵 ·o ∅) = ∅)
16	14, 15	eqtr4d 2775	. . . 4 ⊢ (𝐵 ∈ ω → (∅ ·o 𝐵) = (𝐵 ·o ∅))
17		oveq1 7367	. . . . . 6 ⊢ ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → ((𝑦 ·o 𝐵) +o 𝐵) = ((𝐵 ·o 𝑦) +o 𝐵))
18		nnmsucr 8554	. . . . . . 7 ⊢ ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝑦 ·o 𝐵) = ((𝑦 ·o 𝐵) +o 𝐵))
19		nnmsuc 8536	. . . . . . . 8 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
20	19	ancoms 458	. . . . . . 7 ⊢ ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
21	18, 20	eqeq12d 2753	. . . . . 6 ⊢ ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦) ↔ ((𝑦 ·o 𝐵) +o 𝐵) = ((𝐵 ·o 𝑦) +o 𝐵)))
22	17, 21	imbitrrid 246	. . . . 5 ⊢ ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦)))
23	22	ex 412	. . . 4 ⊢ (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦))))
24	7, 10, 13, 16, 23	finds2 7842	. . 3 ⊢ (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)))
25	4, 24	vtoclga 3521	. 2 ⊢ (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
26	25	imp 406	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∅c0 4274  suc csuc 6319  (class class class)co 7360  ωcom 7810   +_o coa 8395   ·_o comu 8396

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 5231  ax-nul 5241  ax-pr 5370  ax-un 7682

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 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-oadd 8402  df-omul 8403

This theorem is referenced by:  nnmwordri  8565  nn2m  8583  omopthlem1  8588  mulcompi  10810