Theorem nnmcan 8557

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

Step	Hyp	Ref	Expression
1		3anrot 1099	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ (𝐵 ∈ ω ∧ 𝐶 ∈ ω ∧ 𝐴 ∈ ω))
2		nnmword 8556	. . . . 5 ⊢ (((𝐵 ∈ ω ∧ 𝐶 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐵 ⊆ 𝐶 ↔ (𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶)))
3	1, 2	sylanb 581	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐵 ⊆ 𝐶 ↔ (𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶)))
4		3anrev 1100	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ↔ (𝐶 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴 ∈ ω))
5		nnmword 8556	. . . . 5 ⊢ (((𝐶 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐶 ⊆ 𝐵 ↔ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)))
6	4, 5	sylanb 581	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → (𝐶 ⊆ 𝐵 ↔ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)))
7	3, 6	anbi12d 632	. . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ↔ ((𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶) ∧ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵))))
8	7	bicomd 223	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → (((𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶) ∧ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)) ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)))
9		eqss 3946	. 2 ⊢ ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ ((𝐴 ·o 𝐵) ⊆ (𝐴 ·o 𝐶) ∧ (𝐴 ·o 𝐶) ⊆ (𝐴 ·o 𝐵)))
10		eqss 3946	. 2 ⊢ (𝐵 = 𝐶 ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵))
11	8, 9, 10	3bitr4g 314	1 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ 𝐵 = 𝐶))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ⊆ wss 3898  ∅c0 4282  (class class class)co 7354  ωcom 7804   ·_o comu 8391

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7676

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-ov 7357  df-oprab 7358  df-mpo 7359  df-om 7805  df-2nd 7930  df-frecs 8219  df-wrecs 8250  df-recs 8299  df-rdg 8337  df-oadd 8397  df-omul 8398

This theorem is referenced by:  mulcanpi  10800