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

Theorem nnmcom 6652
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 6020 . . . . 5 (𝑥 = 𝐴 → (𝑥 ·o 𝐵) = (𝐴 ·o 𝐵))
2 oveq2 6021 . . . . 5 (𝑥 = 𝐴 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝐴))
31, 2eqeq12d 2244 . . . 4 (𝑥 = 𝐴 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
43imbi2d 230 . . 3 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)) ↔ (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))))
5 oveq1 6020 . . . . 5 (𝑥 = ∅ → (𝑥 ·o 𝐵) = (∅ ·o 𝐵))
6 oveq2 6021 . . . . 5 (𝑥 = ∅ → (𝐵 ·o 𝑥) = (𝐵 ·o ∅))
75, 6eqeq12d 2244 . . . 4 (𝑥 = ∅ → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (∅ ·o 𝐵) = (𝐵 ·o ∅)))
8 oveq1 6020 . . . . 5 (𝑥 = 𝑦 → (𝑥 ·o 𝐵) = (𝑦 ·o 𝐵))
9 oveq2 6021 . . . . 5 (𝑥 = 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o 𝑦))
108, 9eqeq12d 2244 . . . 4 (𝑥 = 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (𝑦 ·o 𝐵) = (𝐵 ·o 𝑦)))
11 oveq1 6020 . . . . 5 (𝑥 = suc 𝑦 → (𝑥 ·o 𝐵) = (suc 𝑦 ·o 𝐵))
12 oveq2 6021 . . . . 5 (𝑥 = suc 𝑦 → (𝐵 ·o 𝑥) = (𝐵 ·o suc 𝑦))
1311, 12eqeq12d 2244 . . . 4 (𝑥 = suc 𝑦 → ((𝑥 ·o 𝐵) = (𝐵 ·o 𝑥) ↔ (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦)))
14 nnm0r 6642 . . . . 5 (𝐵 ∈ ω → (∅ ·o 𝐵) = ∅)
15 nnm0 6638 . . . . 5 (𝐵 ∈ ω → (𝐵 ·o ∅) = ∅)
1614, 15eqtr4d 2265 . . . 4 (𝐵 ∈ ω → (∅ ·o 𝐵) = (𝐵 ·o ∅))
17 oveq1 6020 . . . . . 6 ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → ((𝑦 ·o 𝐵) +o 𝐵) = ((𝐵 ·o 𝑦) +o 𝐵))
18 nnmsucr 6651 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝑦 ·o 𝐵) = ((𝑦 ·o 𝐵) +o 𝐵))
19 nnmsuc 6640 . . . . . . . 8 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
2019ancoms 268 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ·o suc 𝑦) = ((𝐵 ·o 𝑦) +o 𝐵))
2118, 20eqeq12d 2244 . . . . . 6 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦) ↔ ((𝑦 ·o 𝐵) +o 𝐵) = ((𝐵 ·o 𝑦) +o 𝐵)))
2217, 21imbitrrid 156 . . . . 5 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦)))
2322ex 115 . . . 4 (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦 ·o 𝐵) = (𝐵 ·o 𝑦) → (suc 𝑦 ·o 𝐵) = (𝐵 ·o suc 𝑦))))
247, 10, 13, 16, 23finds2 4697 . . 3 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥 ·o 𝐵) = (𝐵 ·o 𝑥)))
254, 24vtoclga 2868 . 2 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴)))
2625imp 124 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·o 𝐵) = (𝐵 ·o 𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  c0 3492  suc csuc 4460  ωcom 4686  (class class class)co 6013   +o coa 6574   ·o comu 6575
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-oadd 6581  df-omul 6582
This theorem is referenced by:  nndir  6653  nn2m  6690  mulcompig  7541  enq0sym  7642  enq0ref  7643  enq0tr  7644  addcmpblnq0  7653  mulcmpblnq0  7654  mulcanenq0ec  7655  nnanq0  7668  distrnq0  7669  mulcomnq0  7670  addassnq0  7672  nq02m  7675
  Copyright terms: Public domain W3C validator