ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nnmcom GIF version

Theorem nnmcom 6337
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.
StepHypRef Expression
1 oveq1 5733 . . . . 5 (𝑥 = 𝐴 → (𝑥 ·o 𝐵) = (𝐴 ·o 𝐵))
2 oveq2 5734 . . . . 5 (𝑥 = 𝐴 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝐴))
31, 2eqeq12d 2127 . . . 4 (𝑥 = 𝐴 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
43imbi2d 229 . . 3 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)) ↔ (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))))
5 oveq1 5733 . . . . 5 (𝑥 = ∅ → (𝑥 ·o 𝐵) = (∅ ·o 𝐵))
6 oveq2 5734 . . . . 5 (𝑥 = ∅ → (𝐵 ·o 𝑥) = (𝐵 ·o ∅))
75, 6eqeq12d 2127 . . . 4 (𝑥 = ∅ → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (∅ ·o 𝐵) = (𝐵 ·o ∅)))
8 oveq1 5733 . . . . 5 (𝑥 = 𝑦 → (𝑥 ·o 𝐵) = (𝑦 ·o 𝐵))
9 oveq2 5734 . . . . 5 (𝑥 = 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝑦))
108, 9eqeq12d 2127 . . . 4 (𝑥 = 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝑦 ·o 𝐵) = (𝐵 ·o 𝑦)))
11 oveq1 5733 . . . . 5 (𝑥 = suc 𝑦 → (𝑥 ·o 𝐵) = (suc 𝑦 ·o 𝐵))
12 oveq2 5734 . . . . 5 (𝑥 = suc 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o suc 𝑦))
1311, 12eqeq12d 2127 . . . 4 (𝑥 = suc 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦)))
14 nnm0r 6327 . . . . 5 (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
15 nnm0 6323 . . . . 5 (𝐵 ∈ ω → (𝐵 ·o ∅) = ∅)
1614, 15eqtr4d 2148 . . . 4 (𝐵 ∈ ω → (∅ ·o 𝐵) = (𝐵 ·o ∅))
17 oveq1 5733 . . . . . 6 ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → ((𝑦 ·o 𝐵) +o 𝐵) = ((𝐵 ·o 𝑦) +o 𝐵))
18 nnmsucr 6336 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝑦 ·o 𝐵) = ((𝑦 ·o 𝐵) +o 𝐵))
19 nnmsuc 6325 . . . . . . . 8 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
2019ancoms 266 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
2118, 20eqeq12d 2127 . . . . . 6 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦) ↔ ((𝑦 ·o 𝐵) +o 𝐵) = ((𝐵 ·o 𝑦) +o 𝐵)))
2217, 21syl5ibr 155 . . . . 5 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦)))
2322ex 114 . . . 4 (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦))))
247, 10, 13, 16, 23finds2 4473 . . 3 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)))
254, 24vtoclga 2721 . 2 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
2625imp 123 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1312  wcel 1461  c0 3327  suc csuc 4245  ωcom 4462  (class class class)co 5726   +o coa 6262   ·o comu 6263
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-13 1472  ax-14 1473  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-coll 4001  ax-sep 4004  ax-nul 4012  ax-pow 4056  ax-pr 4089  ax-un 4313  ax-setind 4410  ax-iinf 4460
This theorem depends on definitions:  df-bi 116  df-3an 945  df-tru 1315  df-fal 1318  df-nf 1418  df-sb 1717  df-eu 1976  df-mo 1977  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ne 2281  df-ral 2393  df-rex 2394  df-reu 2395  df-rab 2397  df-v 2657  df-sbc 2877  df-csb 2970  df-dif 3037  df-un 3039  df-in 3041  df-ss 3048  df-nul 3328  df-pw 3476  df-sn 3497  df-pr 3498  df-op 3500  df-uni 3701  df-int 3736  df-iun 3779  df-br 3894  df-opab 3948  df-mpt 3949  df-tr 3985  df-id 4173  df-iord 4246  df-on 4248  df-suc 4251  df-iom 4463  df-xp 4503  df-rel 4504  df-cnv 4505  df-co 4506  df-dm 4507  df-rn 4508  df-res 4509  df-ima 4510  df-iota 5044  df-fun 5081  df-fn 5082  df-f 5083  df-f1 5084  df-fo 5085  df-f1o 5086  df-fv 5087  df-ov 5729  df-oprab 5730  df-mpo 5731  df-1st 5990  df-2nd 5991  df-recs 6154  df-irdg 6219  df-oadd 6269  df-omul 6270
This theorem is referenced by:  nndir  6338  nn2m  6374  mulcompig  7081  enq0sym  7182  enq0ref  7183  enq0tr  7184  addcmpblnq0  7193  mulcmpblnq0  7194  mulcanenq0ec  7195  nnanq0  7208  distrnq0  7209  mulcomnq0  7210  addassnq0  7212  nq02m  7215
  Copyright terms: Public domain W3C validator