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

Theorem nnmass 6089
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 5540 . . . . . 6 (𝑥 = 𝐶 → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶))
2 oveq2 5540 . . . . . . 7 (𝑥 = 𝐶 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 𝐶))
32oveq2d 5548 . . . . . 6 (𝑥 = 𝐶 → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))
41, 3eqeq12d 2095 . . . . 5 (𝑥 = 𝐶 → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶))))
54imbi2d 228 . . . 4 (𝑥 = 𝐶 → (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥))) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))))
6 oveq2 5540 . . . . . 6 (𝑥 = ∅ → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 ∅))
7 oveq2 5540 . . . . . . 7 (𝑥 = ∅ → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 ∅))
87oveq2d 5548 . . . . . 6 (𝑥 = ∅ → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)))
96, 8eqeq12d 2095 . . . . 5 (𝑥 = ∅ → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = (𝐴 ·𝑜 (𝐵 ·𝑜 ∅))))
10 oveq2 5540 . . . . . 6 (𝑥 = 𝑦 → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 𝑦))
11 oveq2 5540 . . . . . . 7 (𝑥 = 𝑦 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 𝑦))
1211oveq2d 5548 . . . . . 6 (𝑥 = 𝑦 → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)))
1310, 12eqeq12d 2095 . . . . 5 (𝑥 = 𝑦 → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦))))
14 oveq2 5540 . . . . . 6 (𝑥 = suc 𝑦 → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦))
15 oveq2 5540 . . . . . . 7 (𝑥 = suc 𝑦 → (𝐵 ·𝑜 𝑥) = (𝐵 ·𝑜 suc 𝑦))
1615oveq2d 5548 . . . . . 6 (𝑥 = suc 𝑦 → (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)))
1714, 16eqeq12d 2095 . . . . 5 (𝑥 = suc 𝑦 → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥)) ↔ ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))
18 nnmcl 6083 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 𝐵) ∈ ω)
19 nnm0 6077 . . . . . . 7 ((𝐴 ·𝑜 𝐵) ∈ ω → ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = ∅)
2018, 19syl 14 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = ∅)
21 nnm0 6077 . . . . . . . 8 (𝐵 ∈ ω → (𝐵 ·𝑜 ∅) = ∅)
2221oveq2d 5548 . . . . . . 7 (𝐵 ∈ ω → (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)) = (𝐴 ·𝑜 ∅))
23 nnm0 6077 . . . . . . 7 (𝐴 ∈ ω → (𝐴 ·𝑜 ∅) = ∅)
2422, 23sylan9eqr 2135 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)) = ∅)
2520, 24eqtr4d 2116 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 ∅) = (𝐴 ·𝑜 (𝐵 ·𝑜 ∅)))
26 oveq1 5539 . . . . . . . . 9 (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
27 nnmsuc 6079 . . . . . . . . . . . 12 (((𝐴 ·𝑜 𝐵) ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)))
2818, 27sylan 277 . . . . . . . . . . 11 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑦 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)))
29283impa 1133 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)))
30 nnmsuc 6079 . . . . . . . . . . . . 13 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·𝑜 suc 𝑦) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵))
31303adant1 956 . . . . . . . . . . . 12 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·𝑜 suc 𝑦) = ((𝐵 ·𝑜 𝑦) +𝑜 𝐵))
3231oveq2d 5548 . . . . . . . . . . 11 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)) = (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)))
33 nnmcl 6083 . . . . . . . . . . . . . . . . 17 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ·𝑜 𝑦) ∈ ω)
34 nndi 6088 . . . . . . . . . . . . . . . . 17 ((𝐴 ∈ ω ∧ (𝐵 ·𝑜 𝑦) ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
3533, 34syl3an2 1203 . . . . . . . . . . . . . . . 16 ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ 𝑦 ∈ ω) ∧ 𝐵 ∈ ω) → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
36353exp 1137 . . . . . . . . . . . . . . 15 (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))))
3736expd 254 . . . . . . . . . . . . . 14 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (𝐵 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵))))))
3837com34 82 . . . . . . . . . . . . 13 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵))))))
3938pm2.43d 49 . . . . . . . . . . . 12 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))))
40393imp 1132 . . . . . . . . . . 11 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·𝑜 ((𝐵 ·𝑜 𝑦) +𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
4132, 40eqtrd 2113 . . . . . . . . . 10 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵)))
4229, 41eqeq12d 2095 . . . . . . . . 9 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)) ↔ (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) +𝑜 (𝐴 ·𝑜 𝐵)) = ((𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) +𝑜 (𝐴 ·𝑜 𝐵))))
4326, 42syl5ibr 154 . . . . . . . 8 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))
44433exp 1137 . . . . . . 7 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝑦 ∈ ω → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))))
4544com3r 78 . . . . . 6 (𝑦 ∈ ω → (𝐴 ∈ ω → (𝐵 ∈ ω → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦))))))
4645impd 251 . . . . 5 (𝑦 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (((𝐴 ·𝑜 𝐵) ·𝑜 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑦)) → ((𝐴 ·𝑜 𝐵) ·𝑜 suc 𝑦) = (𝐴 ·𝑜 (𝐵 ·𝑜 suc 𝑦)))))
479, 13, 17, 25, 46finds2 4342 . . . 4 (𝑥 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝑥) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝑥))))
485, 47vtoclga 2664 . . 3 (𝐶 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶))))
4948expdcom 1371 . 2 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐶 ∈ ω → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))))
50493imp 1132 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 ·𝑜 𝐵) ·𝑜 𝐶) = (𝐴 ·𝑜 (𝐵 ·𝑜 𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  w3a 919   = wceq 1284  wcel 1433  c0 3251  suc csuc 4120  ωcom 4331  (class class class)co 5532   +𝑜 coa 6021   ·𝑜 comu 6022
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 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-id 4048  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-oadd 6028  df-omul 6029
This theorem is referenced by:  mulasspig  6522  enq0tr  6624  addcmpblnq0  6633  mulcmpblnq0  6634  mulcanenq0ec  6635  distrnq0  6649  addassnq0  6652
  Copyright terms: Public domain W3C validator