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

Theorem grpnnncan2 13852
Description: Cancellation law for group subtraction. (nnncan2 8526 analog.) (Contributed by NM, 15-Feb-2008.) (Revised by Mario Carneiro, 2-Dec-2014.)
Hypotheses
Ref Expression
grpnnncan2.b 𝐵 = (Base‘𝐺)
grpnnncan2.m = (-g𝐺)
Assertion
Ref Expression
grpnnncan2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑍) (𝑌 𝑍)) = (𝑋 𝑌))

Proof of Theorem grpnnncan2
StepHypRef Expression
1 simpl 109 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝐺 ∈ Grp)
2 simpr1 1030 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑋𝐵)
3 simpr3 1032 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑍𝐵)
4 grpnnncan2.b . . . . 5 𝐵 = (Base‘𝐺)
5 grpnnncan2.m . . . . 5 = (-g𝐺)
64, 5grpsubcl 13835 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵𝑍𝐵) → (𝑌 𝑍) ∈ 𝐵)
763adant3r1 1239 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑌 𝑍) ∈ 𝐵)
8 eqid 2234 . . . 4 (+g𝐺) = (+g𝐺)
94, 8, 5grpsubsub4 13848 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑍𝐵 ∧ (𝑌 𝑍) ∈ 𝐵)) → ((𝑋 𝑍) (𝑌 𝑍)) = (𝑋 ((𝑌 𝑍)(+g𝐺)𝑍)))
101, 2, 3, 7, 9syl13anc 1276 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑍) (𝑌 𝑍)) = (𝑋 ((𝑌 𝑍)(+g𝐺)𝑍)))
114, 8, 5grpnpcan 13847 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵𝑍𝐵) → ((𝑌 𝑍)(+g𝐺)𝑍) = 𝑌)
12113adant3r1 1239 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑌 𝑍)(+g𝐺)𝑍) = 𝑌)
1312oveq2d 6074 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 ((𝑌 𝑍)(+g𝐺)𝑍)) = (𝑋 𝑌))
1410, 13eqtrd 2267 1 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑍) (𝑌 𝑍)) = (𝑋 𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1005   = wceq 1398  wcel 2205  cfv 5357  (class class class)co 6058  Basecbs 13296  +gcplusg 13374  Grpcgrp 13755  -gcsg 13757
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759  df-sbg 13760
This theorem is referenced by:  2idlcpblrng  14797
  Copyright terms: Public domain W3C validator