Theorem addcan 9781

Description: Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 22-Nov-1994.) (Proof shortened by Mario Carneiro, 27-May-2016.)

Assertion

Ref	Expression
addcan	|- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A + B ) = ( A + C ) <-> B = C ) )

Proof of Theorem addcan

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnegex2 9779	. . 3 |- ( A e. CC -> E. x e. CC ( x + A ) = 0 )
2	1	3ad2ant1 1017	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> E. x e. CC ( x + A ) = 0 )
3		oveq2 6304	. . . 4 |- ( ( A + B ) = ( A + C ) -> ( x + ( A + B ) ) = ( x + ( A + C ) ) )
4		simprr 757	. . . . . . 7 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( x + A ) = 0 )
5	4	oveq1d 6311	. . . . . 6 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( ( x + A ) + B ) = ( 0 + B ) )
6		simprl 756	. . . . . . 7 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> x e. CC )
7		simpl1 999	. . . . . . 7 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> A e. CC )
8		simpl2 1000	. . . . . . 7 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> B e. CC )
9	6, 7, 8	addassd 9635	. . . . . 6 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( ( x + A ) + B ) = ( x + ( A + B ) ) )
10		addid2 9780	. . . . . . 7 |- ( B e. CC -> ( 0 + B ) = B )
11	8, 10	syl 16	. . . . . 6 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( 0 + B ) = B )
12	5, 9, 11	3eqtr3d 2506	. . . . 5 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( x + ( A + B ) ) = B )
13	4	oveq1d 6311	. . . . . 6 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( ( x + A ) + C ) = ( 0 + C ) )
14		simpl3 1001	. . . . . . 7 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> C e. CC )
15	6, 7, 14	addassd 9635	. . . . . 6 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( ( x + A ) + C ) = ( x + ( A + C ) ) )
16		addid2 9780	. . . . . . 7 |- ( C e. CC -> ( 0 + C ) = C )
17	14, 16	syl 16	. . . . . 6 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( 0 + C ) = C )
18	13, 15, 17	3eqtr3d 2506	. . . . 5 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( x + ( A + C ) ) = C )
19	12, 18	eqeq12d 2479	. . . 4 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( ( x + ( A + B ) ) = ( x + ( A + C ) ) <-> B = C ) )
20	3, 19	syl5ib 219	. . 3 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( ( A + B ) = ( A + C ) -> B = C ) )
21		oveq2 6304	. . 3 |- ( B = C -> ( A + B ) = ( A + C ) )
22	20, 21	impbid1 203	. 2 |- ( ( ( A e. CC /\ B e. CC /\ C e. CC ) /\ ( x e. CC /\ ( x + A ) = 0 ) ) -> ( ( A + B ) = ( A + C ) <-> B = C ) )
23	2, 22	rexlimddv 2953	1 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A + B ) = ( A + C ) <-> B = C ) )

Syntax hints:   -> wi 4   <-> wb 184   /\ wa 369   /\ w3a 973   = wceq 1395   e. wcel 1819   E.wrex 2808  (class class class)co 6296   CCcc 9507   0cc0 9509   + caddc 9512

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591  ax-resscn 9566  ax-1cn 9567  ax-icn 9568  ax-addcl 9569  ax-addrcl 9570  ax-mulcl 9571  ax-mulrcl 9572  ax-mulcom 9573  ax-addass 9574  ax-mulass 9575  ax-distr 9576  ax-i2m1 9577  ax-1ne0 9578  ax-1rid 9579  ax-rnegex 9580  ax-rrecex 9581  ax-cnre 9582  ax-pre-lttri 9583  ax-pre-lttrn 9584  ax-pre-ltadd 9585

This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-nel 2655  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-br 4457  df-opab 4516  df-mpt 4517  df-id 4804  df-po 4809  df-so 4810  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-ov 6299  df-er 7329  df-en 7536  df-dom 7537  df-sdom 7538  df-pnf 9647  df-mnf 9648  df-ltxr 9650

This theorem is referenced by:  addcom  9783  addcani  9790  addcomd  9799  addcand  9800  subcan  9893