Theorem ablpnpcan 14124

Description: Cancellation law for mixed addition and subtraction. (pnpcan 8565 analog.) (Contributed by NM, 29-May-2015.)

Hypotheses

Ref	Expression
ablsubadd.b	|- B = ( Base ` G )
ablsubadd.p	|- .+ = ( +g ` G )
ablsubadd.m	|- .- = ( -g ` G )
ablsubsub.g	|- ( ph -> G e. Abel )
ablsubsub.x	|- ( ph -> X e. B )
ablsubsub.y	|- ( ph -> Y e. B )
ablsubsub.z	|- ( ph -> Z e. B )
ablpnpcan.g	|- ( ph -> G e. Abel )
ablpnpcan.x	|- ( ph -> X e. B )
ablpnpcan.y	|- ( ph -> Y e. B )
ablpnpcan.z	|- ( ph -> Z e. B )

Assertion

Ref	Expression
ablpnpcan	|- ( ph -> ( ( X .+ Y ) .- ( X .+ Z ) ) = ( Y .- Z ) )

Proof of Theorem ablpnpcan

Step	Hyp	Ref	Expression
1		ablsubsub.g	. . 3 |- ( ph -> G e. Abel )
2		ablsubsub.x	. . 3 |- ( ph -> X e. B )
3		ablsubsub.y	. . 3 |- ( ph -> Y e. B )
4		ablsubsub.z	. . 3 |- ( ph -> Z e. B )
5		ablsubadd.b	. . . 4 |- B = ( Base ` G )
6		ablsubadd.p	. . . 4 |- .+ = ( +g ` G )
7		ablsubadd.m	. . . 4 |- .- = ( -g ` G )
8	5, 6, 7	ablsub4 14117	. . 3 |- ( ( G e. Abel /\ ( X e. B /\ Y e. B ) /\ ( X e. B /\ Z e. B ) ) -> ( ( X .+ Y ) .- ( X .+ Z ) ) = ( ( X .- X ) .+ ( Y .- Z ) ) )
9	1, 2, 3, 2, 4, 8	syl122anc 1287	. 2 |- ( ph -> ( ( X .+ Y ) .- ( X .+ Z ) ) = ( ( X .- X ) .+ ( Y .- Z ) ) )
10		ablgrp 14092	. . . . 5 |- ( G e. Abel -> G e. Grp )
11	1, 10	syl 14	. . . 4 |- ( ph -> G e. Grp )
12		eqid 2238	. . . . 5 |- ( 0g ` G ) = ( 0g ` G )
13	5, 12, 7	grpsubid 13889	. . . 4 |- ( ( G e. Grp /\ X e. B ) -> ( X .- X ) = ( 0g ` G ) )
14	11, 2, 13	syl2anc 415	. . 3 |- ( ph -> ( X .- X ) = ( 0g ` G ) )
15	14	oveq1d 6100	. 2 |- ( ph -> ( ( X .- X ) .+ ( Y .- Z ) ) = ( ( 0g ` G ) .+ ( Y .- Z ) ) )
16	5, 7	grpsubcl 13885	. . . 4 |- ( ( G e. Grp /\ Y e. B /\ Z e. B ) -> ( Y .- Z ) e. B )
17	11, 3, 4, 16	syl3anc 1278	. . 3 |- ( ph -> ( Y .- Z ) e. B )
18	5, 6, 12	grplid 13836	. . 3 |- ( ( G e. Grp /\ ( Y .- Z ) e. B ) -> ( ( 0g ` G ) .+ ( Y .- Z ) ) = ( Y .- Z ) )
19	11, 17, 18	syl2anc 415	. 2 |- ( ph -> ( ( 0g ` G ) .+ ( Y .- Z ) ) = ( Y .- Z ) )
20	9, 15, 19	3eqtrd 2275	1 |- ( ph -> ( ( X .+ Y ) .- ( X .+ Z ) ) = ( Y .- Z ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   0gc0g 13610   Grpcgrp 13805   -gcsg 13807   Abelcabl 14088

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-sbg 13810  df-cmn 14089  df-abl 14090

This theorem is used by: (None)