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

Theorem nnmcom 6385
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 5781 . . . . 5 (𝑥 = 𝐴 → (𝑥 ·o 𝐵) = (𝐴 ·o 𝐵))
2 oveq2 5782 . . . . 5 (𝑥 = 𝐴 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝐴))
31, 2eqeq12d 2154 . . . 4 (𝑥 = 𝐴 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
43imbi2d 229 . . 3 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)) ↔ (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))))
5 oveq1 5781 . . . . 5 (𝑥 = ∅ → (𝑥 ·o 𝐵) = (∅ ·o 𝐵))
6 oveq2 5782 . . . . 5 (𝑥 = ∅ → (𝐵 ·o 𝑥) = (𝐵 ·o ∅))
75, 6eqeq12d 2154 . . . 4 (𝑥 = ∅ → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (∅ ·o 𝐵) = (𝐵 ·o ∅)))
8 oveq1 5781 . . . . 5 (𝑥 = 𝑦 → (𝑥 ·o 𝐵) = (𝑦 ·o 𝐵))
9 oveq2 5782 . . . . 5 (𝑥 = 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝑦))
108, 9eqeq12d 2154 . . . 4 (𝑥 = 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝑦 ·o 𝐵) = (𝐵 ·o 𝑦)))
11 oveq1 5781 . . . . 5 (𝑥 = suc 𝑦 → (𝑥 ·o 𝐵) = (suc 𝑦 ·o 𝐵))
12 oveq2 5782 . . . . 5 (𝑥 = suc 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o suc 𝑦))
1311, 12eqeq12d 2154 . . . 4 (𝑥 = suc 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦)))
14 nnm0r 6375 . . . . 5 (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
15 nnm0 6371 . . . . 5 (𝐵 ∈ ω → (𝐵 ·o ∅) = ∅)
1614, 15eqtr4d 2175 . . . 4 (𝐵 ∈ ω → (∅ ·o 𝐵) = (𝐵 ·o ∅))
17 oveq1 5781 . . . . . 6 ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → ((𝑦 ·o 𝐵) +o 𝐵) = ((𝐵 ·o 𝑦) +o 𝐵))
18 nnmsucr 6384 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝑦 ·o 𝐵) = ((𝑦 ·o 𝐵) +o 𝐵))
19 nnmsuc 6373 . . . . . . . 8 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
2019ancoms 266 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
2118, 20eqeq12d 2154 . . . . . 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 4515 . . 3 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)))
254, 24vtoclga 2752 . 2 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
2625imp 123 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1331  wcel 1480  c0 3363  suc csuc 4287  ωcom 4504  (class class class)co 5774   +o coa 6310   ·o comu 6311
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-irdg 6267  df-oadd 6317  df-omul 6318
This theorem is referenced by:  nndir  6386  nn2m  6422  mulcompig  7139  enq0sym  7240  enq0ref  7241  enq0tr  7242  addcmpblnq0  7251  mulcmpblnq0  7252  mulcanenq0ec  7253  nnanq0  7266  distrnq0  7267  mulcomnq0  7268  addassnq0  7270  nq02m  7273
  Copyright terms: Public domain W3C validator