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

Theorem ablnnncan 13973
Description: Cancellation law for group subtraction. (nnncan 8456 analog.) (Contributed by NM, 29-Feb-2008.) (Revised by AV, 27-Aug-2021.)
Hypotheses
Ref Expression
ablnncan.b 𝐵 = (Base‘𝐺)
ablnncan.m = (-g𝐺)
ablnncan.g (𝜑𝐺 ∈ Abel)
ablnncan.x (𝜑𝑋𝐵)
ablnncan.y (𝜑𝑌𝐵)
ablsub32.z (𝜑𝑍𝐵)
Assertion
Ref Expression
ablnnncan (𝜑 → ((𝑋 (𝑌 𝑍)) 𝑍) = (𝑋 𝑌))

Proof of Theorem ablnnncan
StepHypRef Expression
1 ablnncan.b . . 3 𝐵 = (Base‘𝐺)
2 eqid 2231 . . 3 (+g𝐺) = (+g𝐺)
3 ablnncan.m . . 3 = (-g𝐺)
4 ablnncan.g . . 3 (𝜑𝐺 ∈ Abel)
5 ablnncan.x . . 3 (𝜑𝑋𝐵)
6 ablgrp 13939 . . . . 5 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
74, 6syl 14 . . . 4 (𝜑𝐺 ∈ Grp)
8 ablnncan.y . . . 4 (𝜑𝑌𝐵)
9 ablsub32.z . . . 4 (𝜑𝑍𝐵)
101, 3grpsubcl 13726 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵𝑍𝐵) → (𝑌 𝑍) ∈ 𝐵)
117, 8, 9, 10syl3anc 1274 . . 3 (𝜑 → (𝑌 𝑍) ∈ 𝐵)
121, 2, 3, 4, 5, 11, 9ablsubsub4 13969 . 2 (𝜑 → ((𝑋 (𝑌 𝑍)) 𝑍) = (𝑋 ((𝑌 𝑍)(+g𝐺)𝑍)))
131, 2ablcom 13953 . . . . 5 ((𝐺 ∈ Abel ∧ (𝑌 𝑍) ∈ 𝐵𝑍𝐵) → ((𝑌 𝑍)(+g𝐺)𝑍) = (𝑍(+g𝐺)(𝑌 𝑍)))
144, 11, 9, 13syl3anc 1274 . . . 4 (𝜑 → ((𝑌 𝑍)(+g𝐺)𝑍) = (𝑍(+g𝐺)(𝑌 𝑍)))
151, 2, 3ablpncan3 13967 . . . . 5 ((𝐺 ∈ Abel ∧ (𝑍𝐵𝑌𝐵)) → (𝑍(+g𝐺)(𝑌 𝑍)) = 𝑌)
164, 9, 8, 15syl12anc 1272 . . . 4 (𝜑 → (𝑍(+g𝐺)(𝑌 𝑍)) = 𝑌)
1714, 16eqtrd 2264 . . 3 (𝜑 → ((𝑌 𝑍)(+g𝐺)𝑍) = 𝑌)
1817oveq2d 6044 . 2 (𝜑 → (𝑋 ((𝑌 𝑍)(+g𝐺)𝑍)) = (𝑋 𝑌))
1912, 18eqtrd 2264 1 (𝜑 → ((𝑋 (𝑌 𝑍)) 𝑍) = (𝑋 𝑌))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2202  cfv 5333  (class class class)co 6028  Basecbs 13145  +gcplusg 13223  Grpcgrp 13646  -gcsg 13648  Abelcabl 13935
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-inn 9186  df-2 9244  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-0g 13404  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-minusg 13650  df-sbg 13651  df-cmn 13936  df-abl 13937
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator