Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  mulcanpi Structured version   Visualization version   GIF version

Theorem mulcanpi 10311
 Description: Multiplication cancellation law for positive integers. (Contributed by NM, 4-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
mulcanpi ((𝐴N𝐵N) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) ↔ 𝐵 = 𝐶))

Proof of Theorem mulcanpi
StepHypRef Expression
1 mulclpi 10304 . . . . . . . . . 10 ((𝐴N𝐵N) → (𝐴 ·N 𝐵) ∈ N)
2 eleq1 2901 . . . . . . . . . 10 ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) → ((𝐴 ·N 𝐵) ∈ N ↔ (𝐴 ·N 𝐶) ∈ N))
31, 2syl5ib 247 . . . . . . . . 9 ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) → ((𝐴N𝐵N) → (𝐴 ·N 𝐶) ∈ N))
43imp 410 . . . . . . . 8 (((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) ∧ (𝐴N𝐵N)) → (𝐴 ·N 𝐶) ∈ N)
5 dmmulpi 10302 . . . . . . . . 9 dom ·N = (N × N)
6 0npi 10293 . . . . . . . . 9 ¬ ∅ ∈ N
75, 6ndmovrcl 7319 . . . . . . . 8 ((𝐴 ·N 𝐶) ∈ N → (𝐴N𝐶N))
8 simpr 488 . . . . . . . 8 ((𝐴N𝐶N) → 𝐶N)
94, 7, 83syl 18 . . . . . . 7 (((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) ∧ (𝐴N𝐵N)) → 𝐶N)
10 mulpiord 10296 . . . . . . . . . 10 ((𝐴N𝐵N) → (𝐴 ·N 𝐵) = (𝐴 ·o 𝐵))
1110adantr 484 . . . . . . . . 9 (((𝐴N𝐵N) ∧ 𝐶N) → (𝐴 ·N 𝐵) = (𝐴 ·o 𝐵))
12 mulpiord 10296 . . . . . . . . . 10 ((𝐴N𝐶N) → (𝐴 ·N 𝐶) = (𝐴 ·o 𝐶))
1312adantlr 714 . . . . . . . . 9 (((𝐴N𝐵N) ∧ 𝐶N) → (𝐴 ·N 𝐶) = (𝐴 ·o 𝐶))
1411, 13eqeq12d 2838 . . . . . . . 8 (((𝐴N𝐵N) ∧ 𝐶N) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) ↔ (𝐴 ·o 𝐵) = (𝐴 ·o 𝐶)))
15 pinn 10289 . . . . . . . . . . . . 13 (𝐴N𝐴 ∈ ω)
16 pinn 10289 . . . . . . . . . . . . 13 (𝐵N𝐵 ∈ ω)
17 pinn 10289 . . . . . . . . . . . . 13 (𝐶N𝐶 ∈ ω)
18 elni2 10288 . . . . . . . . . . . . . . . 16 (𝐴N ↔ (𝐴 ∈ ω ∧ ∅ ∈ 𝐴))
1918simprbi 500 . . . . . . . . . . . . . . 15 (𝐴N → ∅ ∈ 𝐴)
20 nnmcan 8247 . . . . . . . . . . . . . . . 16 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ 𝐵 = 𝐶))
2120biimpd 232 . . . . . . . . . . . . . . 15 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶))
2219, 21sylan2 595 . . . . . . . . . . . . . 14 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ 𝐴N) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶))
2322ex 416 . . . . . . . . . . . . 13 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴N → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶)))
2415, 16, 17, 23syl3an 1157 . . . . . . . . . . . 12 ((𝐴N𝐵N𝐶N) → (𝐴N → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶)))
25243exp 1116 . . . . . . . . . . 11 (𝐴N → (𝐵N → (𝐶N → (𝐴N → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶)))))
2625com4r 94 . . . . . . . . . 10 (𝐴N → (𝐴N → (𝐵N → (𝐶N → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶)))))
2726pm2.43i 52 . . . . . . . . 9 (𝐴N → (𝐵N → (𝐶N → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶))))
2827imp31 421 . . . . . . . 8 (((𝐴N𝐵N) ∧ 𝐶N) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶))
2914, 28sylbid 243 . . . . . . 7 (((𝐴N𝐵N) ∧ 𝐶N) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) → 𝐵 = 𝐶))
309, 29sylan2 595 . . . . . 6 (((𝐴N𝐵N) ∧ ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) ∧ (𝐴N𝐵N))) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) → 𝐵 = 𝐶))
3130exp32 424 . . . . 5 ((𝐴N𝐵N) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) → ((𝐴N𝐵N) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) → 𝐵 = 𝐶))))
3231imp4b 425 . . . 4 (((𝐴N𝐵N) ∧ (𝐴 ·N 𝐵) = (𝐴 ·N 𝐶)) → (((𝐴N𝐵N) ∧ (𝐴 ·N 𝐵) = (𝐴 ·N 𝐶)) → 𝐵 = 𝐶))
3332pm2.43i 52 . . 3 (((𝐴N𝐵N) ∧ (𝐴 ·N 𝐵) = (𝐴 ·N 𝐶)) → 𝐵 = 𝐶)
3433ex 416 . 2 ((𝐴N𝐵N) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) → 𝐵 = 𝐶))
35 oveq2 7148 . 2 (𝐵 = 𝐶 → (𝐴 ·N 𝐵) = (𝐴 ·N 𝐶))
3634, 35impbid1 228 1 ((𝐴N𝐵N) → ((𝐴 ·N 𝐵) = (𝐴 ·N 𝐶) ↔ 𝐵 = 𝐶))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2114  ∅c0 4265  (class class class)co 7140  ωcom 7565   ·o comu 8087  Ncnpi 10255   ·N cmi 10257 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-ral 3135  df-rex 3136  df-reu 3137  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-tp 4544  df-op 4546  df-uni 4814  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5437  df-eprel 5442  df-po 5451  df-so 5452  df-fr 5491  df-we 5493  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-pred 6126  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-f1 6339  df-fo 6340  df-f1o 6341  df-fv 6342  df-ov 7143  df-oprab 7144  df-mpo 7145  df-om 7566  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-oadd 8093  df-omul 8094  df-ni 10283  df-mi 10285 This theorem is referenced by:  enqer  10332  nqereu  10340  adderpqlem  10365  mulerpqlem  10366
 Copyright terms: Public domain W3C validator