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

Theorem nnmcan 8674
Description: Cancellation law for multiplication of natural numbers. (Contributed by NM, 26-Oct-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
Assertion
Ref Expression
nnmcan (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ 𝐵 = 𝐶))

Proof of Theorem nnmcan
StepHypRef Expression
1 3anrot 1117 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ (𝐵 ∈ ω ∧ 𝐶 ∈ ω ∧ 𝐴 ∈ ω))
2 nnmword 8673 . . . . 5 (((𝐵 ∈ ω ∧ 𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐵 ⊆ 𝐶 ↔ (𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶)))
31, 2sylanb 593 . . . 4 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐵 ⊆ 𝐶 ↔ (𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶)))
4 3anrev 1118 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ (𝐶 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴 ∈ ω))
5 nnmword 8673 . . . . 5 (((𝐶 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐶 ⊆ 𝐵 ↔ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)))
64, 5sylanb 593 . . . 4 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐶 ⊆ 𝐵 ↔ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)))
73, 6anbi12d 644 . . 3 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ↔ ((𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶) ∧ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵))))
87bicomd 226 . 2 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → (((𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶) ∧ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)) ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)))
9 eqss 3928 . 2 ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ ((𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶) ∧ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)))
10 eqss 3928 . 2 (𝐵 = 𝐶 ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵))
118, 9, 103bitr4g 317 1 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ 𝐵 = 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∅c0 4281  (class class class)co 7446  ωcom 7904   ·o comu 8505
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-oadd 8511  df-omul 8512
This theorem is used by:  mulcanpi  11015
  Copyright terms: Public domain W3C validator