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

Theorem nnmass 6230
Description: Multiplication of natural numbers is associative. Theorem 4K(4) of [Enderton] p. 81. (Contributed by NM, 20-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
Assertion
Ref Expression
nnmass ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))

Proof of Theorem nnmass
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 5642 . . . . . 6 (𝑥 = 𝐶 → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶))
2 oveq2 5642 . . . . . . 7 (𝑥 = 𝐶 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 𝐶))
32oveq2d 5650 . . . . . 6 (𝑥 = 𝐶 → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))
41, 3eqeq12d 2102 . . . . 5 (𝑥 = 𝐶 → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶))))
54imbi2d 228 . . . 4 (𝑥 = 𝐶 → (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥))) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))))
6 oveq2 5642 . . . . . 6 (𝑥 = ∅ → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 ∅))
7 oveq2 5642 . . . . . . 7 (𝑥 = ∅ → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 ∅))
87oveq2d 5650 . . . . . 6 (𝑥 = ∅ → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)))
96, 8eqeq12d 2102 . . . . 5 (𝑥 = ∅ → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = (𝐴 ·𝑜 (𝐵 ·𝑜 ∅))))
10 oveq2 5642 . . . . . 6 (𝑥 = 𝑦 → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 𝑦))
11 oveq2 5642 . . . . . . 7 (𝑥 = 𝑦 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 𝑦))
1211oveq2d 5650 . . . . . 6 (𝑥 = 𝑦 → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)))
1310, 12eqeq12d 2102 . . . . 5 (𝑥 = 𝑦 → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦))))
14 oveq2 5642 . . . . . 6 (𝑥 = suc 𝑦 → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦))
15 oveq2 5642 . . . . . . 7 (𝑥 = suc 𝑦 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 suc 𝑦))
1615oveq2d 5650 . . . . . 6 (𝑥 = suc 𝑦 → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)))
1714, 16eqeq12d 2102 . . . . 5 (𝑥 = suc 𝑦 → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))
18 nnmcl 6224 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 𝐵) ∈ ω)
19 nnm0 6218 . . . . . . 7 ((𝐴 ·𝑜 𝐵) ∈ ω → ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = ∅)
2018, 19syl 14 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = ∅)
21 nnm0 6218 . . . . . . . 8 (𝐵 ∈ ω → (𝐵 ·𝑜 ∅) = ∅)
2221oveq2d 5650 . . . . . . 7 (𝐵 ∈ ω → (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)) = (𝐴 ·𝑜 ∅))
23 nnm0 6218 . . . . . . 7 (𝐴 ∈ ω → (𝐴 ·𝑜 ∅) = ∅)
2422, 23sylan9eqr 2142 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)) = ∅)
2520, 24eqtr4d 2123 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)))
26 oveq1 5641 . . . . . . . . 9 (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
27 nnmsuc 6220 . . . . . . . . . . . 12 (((𝐴 ·𝑜 𝐵) ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)))
2818, 27sylan 277 . . . . . . . . . . 11 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)))
29283impa 1138 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)))
30 nnmsuc 6220 . . . . . . . . . . . . 13 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·𝑜 suc 𝑦) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵))
31303adant1 961 . . . . . . . . . . . 12 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·𝑜 suc 𝑦) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵))
3231oveq2d 5650 . . . . . . . . . . 11 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)) = (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)))
33 nnmcl 6224 . . . . . . . . . . . . . . . . 17 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·𝑜 𝑦) ∈ ω)
34 nndi 6229 . . . . . . . . . . . . . . . . 17 ((𝐴 ∈ ω ∧ (𝐵 ·𝑜 𝑦) ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
3533, 34syl3an2 1208 . . . . . . . . . . . . . . . 16 ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω) ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
36353exp 1142 . . . . . . . . . . . . . . 15 (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))))
3736expd 254 . . . . . . . . . . . . . 14 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (𝐵 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵))))))
3837com34 82 . . . . . . . . . . . . 13 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵))))))
3938pm2.43d 49 . . . . . . . . . . . 12 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))))
40393imp 1137 . . . . . . . . . . 11 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
4132, 40eqtrd 2120 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
4229, 41eqeq12d 2102 . . . . . . . . 9 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)) ↔ (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵))))
4326, 42syl5ibr 154 . . . . . . . 8 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))
44433exp 1142 . . . . . . 7 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))))
4544com3r 78 . . . . . 6 (𝑦 ∈ ω → (𝐴 ∈ ω → (𝐵 ∈ ω → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))))
4645impd 251 . . . . 5 (𝑦 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)))))
479, 13, 17, 25, 46finds2 4406 . . . 4 (𝑥 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥))))
485, 47vtoclga 2685 . . 3 (𝐶 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶))))
4948expdcom 1376 . 2 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐶 ∈ ω → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))))
50493imp 1137 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  w3a 924   = wceq 1289  wcel 1438  c0 3284  suc csuc 4183  ωcom 4395  (class class class)co 5634   +𝑜 coa 6160   ·𝑜 comu 6161
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3946  ax-sep 3949  ax-nul 3957  ax-pow 4001  ax-pr 4027  ax-un 4251  ax-setind 4343  ax-iinf 4393
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2839  df-csb 2932  df-dif 2999  df-un 3001  df-in 3003  df-ss 3010  df-nul 3285  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450  df-uni 3649  df-int 3684  df-iun 3727  df-br 3838  df-opab 3892  df-mpt 3893  df-tr 3929  df-id 4111  df-iord 4184  df-on 4186  df-suc 4189  df-iom 4396  df-xp 4434  df-rel 4435  df-cnv 4436  df-co 4437  df-dm 4438  df-rn 4439  df-res 4440  df-ima 4441  df-iota 4967  df-fun 5004  df-fn 5005  df-f 5006  df-f1 5007  df-fo 5008  df-f1o 5009  df-fv 5010  df-ov 5637  df-oprab 5638  df-mpt2 5639  df-1st 5893  df-2nd 5894  df-recs 6052  df-irdg 6117  df-oadd 6167  df-omul 6168
This theorem is referenced by:  mulasspig  6870  enq0tr  6972  addcmpblnq0  6981  mulcmpblnq0  6982  mulcanenq0ec  6983  distrnq0  6997  addassnq0  7000
  Copyright terms: Public domain W3C validator