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

Theorem grpsubsub4 13009
Description: Double group subtraction (subsub4 8209 analog). (Contributed by Mario Carneiro, 2-Dec-2014.)
Hypotheses
Ref Expression
grpsubadd.b 𝐵 = (Base‘𝐺)
grpsubadd.p + = (+g𝐺)
grpsubadd.m = (-g𝐺)
Assertion
Ref Expression
grpsubsub4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) 𝑍) = (𝑋 (𝑍 + 𝑌)))

Proof of Theorem grpsubsub4
StepHypRef Expression
1 simpl 109 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝐺 ∈ Grp)
2 grpsubadd.b . . . . . . . 8 𝐵 = (Base‘𝐺)
3 grpsubadd.m . . . . . . . 8 = (-g𝐺)
42, 3grpsubcl 12996 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) ∈ 𝐵)
543adant3r3 1216 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 𝑌) ∈ 𝐵)
6 simpr3 1007 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑍𝐵)
7 grpsubadd.p . . . . . . 7 + = (+g𝐺)
82, 7, 3grpnpcan 13008 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋 𝑌) ∈ 𝐵𝑍𝐵) → (((𝑋 𝑌) 𝑍) + 𝑍) = (𝑋 𝑌))
91, 5, 6, 8syl3anc 1249 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 𝑌) 𝑍) + 𝑍) = (𝑋 𝑌))
109oveq1d 5906 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((((𝑋 𝑌) 𝑍) + 𝑍) + 𝑌) = ((𝑋 𝑌) + 𝑌))
112, 3grpsubcl 12996 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋 𝑌) ∈ 𝐵𝑍𝐵) → ((𝑋 𝑌) 𝑍) ∈ 𝐵)
121, 5, 6, 11syl3anc 1249 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) 𝑍) ∈ 𝐵)
13 simpr2 1006 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑌𝐵)
142, 7grpass 12926 . . . . 5 ((𝐺 ∈ Grp ∧ (((𝑋 𝑌) 𝑍) ∈ 𝐵𝑍𝐵𝑌𝐵)) → ((((𝑋 𝑌) 𝑍) + 𝑍) + 𝑌) = (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)))
151, 12, 6, 13, 14syl13anc 1251 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((((𝑋 𝑌) 𝑍) + 𝑍) + 𝑌) = (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)))
162, 7, 3grpnpcan 13008 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) + 𝑌) = 𝑋)
17163adant3r3 1216 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) + 𝑌) = 𝑋)
1810, 15, 173eqtr3d 2230 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)) = 𝑋)
19 simpr1 1005 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑋𝐵)
202, 7grpcl 12925 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑍𝐵𝑌𝐵) → (𝑍 + 𝑌) ∈ 𝐵)
211, 6, 13, 20syl3anc 1249 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑍 + 𝑌) ∈ 𝐵)
222, 7, 3grpsubadd 13004 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵 ∧ (𝑍 + 𝑌) ∈ 𝐵 ∧ ((𝑋 𝑌) 𝑍) ∈ 𝐵)) → ((𝑋 (𝑍 + 𝑌)) = ((𝑋 𝑌) 𝑍) ↔ (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)) = 𝑋))
231, 19, 21, 12, 22syl13anc 1251 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 (𝑍 + 𝑌)) = ((𝑋 𝑌) 𝑍) ↔ (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)) = 𝑋))
2418, 23mpbird 167 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 (𝑍 + 𝑌)) = ((𝑋 𝑌) 𝑍))
2524eqcomd 2195 1 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) 𝑍) = (𝑋 (𝑍 + 𝑌)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  wcel 2160  cfv 5231  (class class class)co 5891  Basecbs 12486  +gcplusg 12561  Grpcgrp 12917  -gcsg 12919
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-cnex 7921  ax-resscn 7922  ax-1re 7924  ax-addrcl 7927
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4308  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-ima 4654  df-iota 5193  df-fun 5233  df-fn 5234  df-f 5235  df-f1 5236  df-fo 5237  df-f1o 5238  df-fv 5239  df-riota 5847  df-ov 5894  df-oprab 5895  df-mpo 5896  df-1st 6159  df-2nd 6160  df-inn 8939  df-2 8997  df-ndx 12489  df-slot 12490  df-base 12492  df-plusg 12574  df-0g 12735  df-mgm 12804  df-sgrp 12837  df-mnd 12850  df-grp 12920  df-minusg 12921  df-sbg 12922
This theorem is referenced by:  grppnpcan2  13010  grpnnncan2  13013
  Copyright terms: Public domain W3C validator