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

Theorem grpsubadd 13694
Description: Relationship between group subtraction and addition. (Contributed by NM, 31-Mar-2014.)
Hypotheses
Ref Expression
grpsubadd.b 𝐵 = (Base‘𝐺)
grpsubadd.p + = (+g𝐺)
grpsubadd.m = (-g𝐺)
Assertion
Ref Expression
grpsubadd ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) = 𝑍 ↔ (𝑍 + 𝑌) = 𝑋))

Proof of Theorem grpsubadd
StepHypRef Expression
1 grpsubadd.b . . . . . . 7 𝐵 = (Base‘𝐺)
2 grpsubadd.p . . . . . . 7 + = (+g𝐺)
3 eqid 2230 . . . . . . 7 (invg𝐺) = (invg𝐺)
4 grpsubadd.m . . . . . . 7 = (-g𝐺)
51, 2, 3, 4grpsubval 13652 . . . . . 6 ((𝑋𝐵𝑌𝐵) → (𝑋 𝑌) = (𝑋 + ((invg𝐺)‘𝑌)))
653adant3 1043 . . . . 5 ((𝑋𝐵𝑌𝐵𝑍𝐵) → (𝑋 𝑌) = (𝑋 + ((invg𝐺)‘𝑌)))
76adantl 277 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 𝑌) = (𝑋 + ((invg𝐺)‘𝑌)))
87eqeq1d 2239 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) = 𝑍 ↔ (𝑋 + ((invg𝐺)‘𝑌)) = 𝑍))
9 simpl 109 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝐺 ∈ Grp)
10 simpr1 1029 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑋𝐵)
111, 3grpinvcl 13654 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((invg𝐺)‘𝑌) ∈ 𝐵)
12113ad2antr2 1189 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((invg𝐺)‘𝑌) ∈ 𝐵)
131, 2grpcl 13614 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋𝐵 ∧ ((invg𝐺)‘𝑌) ∈ 𝐵) → (𝑋 + ((invg𝐺)‘𝑌)) ∈ 𝐵)
149, 10, 12, 13syl3anc 1273 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 + ((invg𝐺)‘𝑌)) ∈ 𝐵)
15 simpr3 1031 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑍𝐵)
16 simpr2 1030 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → 𝑌𝐵)
171, 2grprcan 13643 . . . 4 ((𝐺 ∈ Grp ∧ ((𝑋 + ((invg𝐺)‘𝑌)) ∈ 𝐵𝑍𝐵𝑌𝐵)) → (((𝑋 + ((invg𝐺)‘𝑌)) + 𝑌) = (𝑍 + 𝑌) ↔ (𝑋 + ((invg𝐺)‘𝑌)) = 𝑍))
189, 14, 15, 16, 17syl13anc 1275 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 + ((invg𝐺)‘𝑌)) + 𝑌) = (𝑍 + 𝑌) ↔ (𝑋 + ((invg𝐺)‘𝑌)) = 𝑍))
191, 2grpass 13615 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋𝐵 ∧ ((invg𝐺)‘𝑌) ∈ 𝐵𝑌𝐵)) → ((𝑋 + ((invg𝐺)‘𝑌)) + 𝑌) = (𝑋 + (((invg𝐺)‘𝑌) + 𝑌)))
209, 10, 12, 16, 19syl13anc 1275 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + ((invg𝐺)‘𝑌)) + 𝑌) = (𝑋 + (((invg𝐺)‘𝑌) + 𝑌)))
21 eqid 2230 . . . . . . . 8 (0g𝐺) = (0g𝐺)
221, 2, 21, 3grplinv 13656 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → (((invg𝐺)‘𝑌) + 𝑌) = (0g𝐺))
23223ad2antr2 1189 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((invg𝐺)‘𝑌) + 𝑌) = (0g𝐺))
2423oveq2d 6039 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 + (((invg𝐺)‘𝑌) + 𝑌)) = (𝑋 + (0g𝐺)))
251, 2, 21grprid 13638 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → (𝑋 + (0g𝐺)) = 𝑋)
26253ad2antr1 1188 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋 + (0g𝐺)) = 𝑋)
2720, 24, 263eqtrd 2267 . . . 4 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 + ((invg𝐺)‘𝑌)) + 𝑌) = 𝑋)
2827eqeq1d 2239 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (((𝑋 + ((invg𝐺)‘𝑌)) + 𝑌) = (𝑍 + 𝑌) ↔ 𝑋 = (𝑍 + 𝑌)))
298, 18, 283bitr2d 216 . 2 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) = 𝑍𝑋 = (𝑍 + 𝑌)))
30 eqcom 2232 . 2 (𝑋 = (𝑍 + 𝑌) ↔ (𝑍 + 𝑌) = 𝑋)
3129, 30bitrdi 196 1 ((𝐺 ∈ Grp ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 𝑌) = 𝑍 ↔ (𝑍 + 𝑌) = 𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1004   = wceq 1397  wcel 2201  cfv 5328  (class class class)co 6023  Basecbs 13105  +gcplusg 13183  0gc0g 13362  Grpcgrp 13606  invgcminusg 13607  -gcsg 13608
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1re 8131  ax-addrcl 8134
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-reu 2516  df-rmo 2517  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-inn 9149  df-2 9207  df-ndx 13108  df-slot 13109  df-base 13111  df-plusg 13196  df-0g 13364  df-mgm 13462  df-sgrp 13508  df-mnd 13523  df-grp 13609  df-minusg 13610  df-sbg 13611
This theorem is referenced by:  grpsubsub4  13699  conjghm  13886  conjnmzb  13890  ablsubadd  13922  ablsubsub23  13935
  Copyright terms: Public domain W3C validator