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

Theorem grpsubsub4 13621
Description: Double group subtraction (subsub4 8375 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 13608 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 𝑌) ∈ 𝐵)
543adant3r3 1238 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 𝑌) ∈ 𝐵)
6 simpr3 1029 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑍𝐵)
7 grpsubadd.p . . . . . . 7 + = (+g𝐺)
82, 7, 3grpnpcan 13620 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋 𝑌) ∈ 𝐵𝑍𝐵) → (((𝑋 𝑌) 𝑍) + 𝑍) = (𝑋 𝑌))
91, 5, 6, 8syl3anc 1271 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 𝑌) 𝑍) + 𝑍) = (𝑋 𝑌))
109oveq1d 6015 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((((𝑋 𝑌) 𝑍) + 𝑍) + 𝑌) = ((𝑋 𝑌) + 𝑌))
112, 3grpsubcl 13608 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋 𝑌) ∈ 𝐵𝑍𝐵) → ((𝑋 𝑌) 𝑍) ∈ 𝐵)
121, 5, 6, 11syl3anc 1271 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) 𝑍) ∈ 𝐵)
13 simpr2 1028 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑌𝐵)
142, 7grpass 13537 . . . . 5 ((𝐺 ∈ Grp ∧ (((𝑋 𝑌) 𝑍) ∈ 𝐵𝑍𝐵𝑌𝐵)) → ((((𝑋 𝑌) 𝑍) + 𝑍) + 𝑌) = (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)))
151, 12, 6, 13, 14syl13anc 1273 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((((𝑋 𝑌) 𝑍) + 𝑍) + 𝑌) = (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)))
162, 7, 3grpnpcan 13620 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 𝑌) + 𝑌) = 𝑋)
17163adant3r3 1238 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) + 𝑌) = 𝑋)
1810, 15, 173eqtr3d 2270 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)) = 𝑋)
19 simpr1 1027 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑋𝐵)
202, 7grpcl 13536 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑍𝐵𝑌𝐵) → (𝑍 + 𝑌) ∈ 𝐵)
211, 6, 13, 20syl3anc 1271 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑍 + 𝑌) ∈ 𝐵)
222, 7, 3grpsubadd 13616 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵 ∧ (𝑍 + 𝑌) ∈ 𝐵 ∧ ((𝑋 𝑌) 𝑍) ∈ 𝐵)) → ((𝑋 (𝑍 + 𝑌)) = ((𝑋 𝑌) 𝑍) ↔ (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)) = 𝑋))
231, 19, 21, 12, 22syl13anc 1273 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 (𝑍 + 𝑌)) = ((𝑋 𝑌) 𝑍) ↔ (((𝑋 𝑌) 𝑍) + (𝑍 + 𝑌)) = 𝑋))
2418, 23mpbird 167 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 (𝑍 + 𝑌)) = ((𝑋 𝑌) 𝑍))
2524eqcomd 2235 1 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) 𝑍) = (𝑋 (𝑍 + 𝑌)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1002   = wceq 1395  wcel 2200  cfv 5317  (class class class)co 6000  Basecbs 13027  +gcplusg 13105  Grpcgrp 13528  -gcsg 13530
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1re 8089  ax-addrcl 8092
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-plusg 13118  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-grp 13531  df-minusg 13532  df-sbg 13533
This theorem is referenced by:  grppnpcan2  13622  grpnnncan2  13625
  Copyright terms: Public domain W3C validator