MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nnmcom Structured version   Visualization version   GIF version

Theorem nnmcom 7860
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 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 𝐵) = (𝐵 ·𝑜 𝐴))

Proof of Theorem nnmcom
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 6800 . . . . 5 (𝑥 = 𝐴 → (𝑥 ·𝑜 𝐵) = (𝐴 ·𝑜 𝐵))
2 oveq2 6801 . . . . 5 (𝑥 = 𝐴 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 𝐴))
31, 2eqeq12d 2786 . . . 4 (𝑥 = 𝐴 → ((𝑥 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑥) ↔ (𝐴 ·𝑜 𝐵) = (𝐵 ·𝑜 𝐴)))
43imbi2d 329 . . 3 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑥)) ↔ (𝐵 ∈ ω → (𝐴 ·𝑜 𝐵) = (𝐵 ·𝑜 𝐴))))
5 oveq1 6800 . . . . 5 (𝑥 = ∅ → (𝑥 ·𝑜 𝐵) = (∅ ·𝑜 𝐵))
6 oveq2 6801 . . . . 5 (𝑥 = ∅ → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 ∅))
75, 6eqeq12d 2786 . . . 4 (𝑥 = ∅ → ((𝑥 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑥) ↔ (∅ ·𝑜 𝐵) = (𝐵 ·𝑜 ∅)))
8 oveq1 6800 . . . . 5 (𝑥 = 𝑦 → (𝑥 ·𝑜 𝐵) = (𝑦 ·𝑜 𝐵))
9 oveq2 6801 . . . . 5 (𝑥 = 𝑦 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 𝑦))
108, 9eqeq12d 2786 . . . 4 (𝑥 = 𝑦 → ((𝑥 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑥) ↔ (𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑦)))
11 oveq1 6800 . . . . 5 (𝑥 = suc 𝑦 → (𝑥 ·𝑜 𝐵) = (suc 𝑦 ·𝑜 𝐵))
12 oveq2 6801 . . . . 5 (𝑥 = suc 𝑦 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 suc 𝑦))
1311, 12eqeq12d 2786 . . . 4 (𝑥 = suc 𝑦 → ((𝑥 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑥) ↔ (suc 𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 suc 𝑦)))
14 nnm0r 7844 . . . . 5 (𝐵 ∈ ω → (∅ ·𝑜 𝐵) = ∅)
15 nnm0 7839 . . . . 5 (𝐵 ∈ ω → (𝐵 ·𝑜 ∅) = ∅)
1614, 15eqtr4d 2808 . . . 4 (𝐵 ∈ ω → (∅ ·𝑜 𝐵) = (𝐵 ·𝑜 ∅))
17 oveq1 6800 . . . . . 6 ((𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑦) → ((𝑦 ·𝑜 𝐵) +𝑜 𝐵) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵))
18 nnmsucr 7859 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝑦 ·𝑜 𝐵) = ((𝑦 ·𝑜 𝐵) +𝑜 𝐵))
19 nnmsuc 7841 . . . . . . . 8 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·𝑜 suc 𝑦) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵))
2019ancoms 455 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ·𝑜 suc 𝑦) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵))
2118, 20eqeq12d 2786 . . . . . 6 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((suc 𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 suc 𝑦) ↔ ((𝑦 ·𝑜 𝐵) +𝑜 𝐵) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)))
2217, 21syl5ibr 236 . . . . 5 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑦) → (suc 𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 suc 𝑦)))
2322ex 397 . . . 4 (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑦) → (suc 𝑦 ·𝑜 𝐵) = (𝐵 ·𝑜 suc 𝑦))))
247, 10, 13, 16, 23finds2 7241 . . 3 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥 ·𝑜 𝐵) = (𝐵 ·𝑜 𝑥)))
254, 24vtoclga 3423 . 2 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴 ·𝑜 𝐵) = (𝐵 ·𝑜 𝐴)))
2625imp 393 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 𝐵) = (𝐵 ·𝑜 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382   = wceq 1631  wcel 2145  c0 4063  suc csuc 5868  (class class class)co 6793  ωcom 7212   +𝑜 coa 7710   ·𝑜 comu 7711
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3or 1072  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4226  df-pw 4299  df-sn 4317  df-pr 4319  df-tp 4321  df-op 4323  df-uni 4575  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-tr 4887  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-ov 6796  df-oprab 6797  df-mpt2 6798  df-om 7213  df-1st 7315  df-2nd 7316  df-wrecs 7559  df-recs 7621  df-rdg 7659  df-oadd 7717  df-omul 7718
This theorem is referenced by:  nnmwordri  7870  nn2m  7884  omopthlem1  7889  mulcompi  9920
  Copyright terms: Public domain W3C validator