Theorem addcan2i 8404

Description: Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 14-May-2003.) (Revised by Scott Fenton, 3-Jan-2013.)

Hypotheses

Ref	Expression
addcani.1	|- A e. CC
addcani.2	|- B e. CC
addcani.3	|- C e. CC

Assertion

Ref	Expression
addcan2i	|- ( ( A + C ) = ( B + C ) <-> A = B )

Proof of Theorem addcan2i

Step	Hyp	Ref	Expression
1		addcani.1	. 2 |- A e. CC
2		addcani.2	. 2 |- B e. CC
3		addcani.3	. 2 |- C e. CC
4		addcan2 8402	. 2 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( ( A + C ) = ( B + C ) <-> A = B ) )
5	1, 2, 3, 4	mp3an 1374	1 |- ( ( A + C ) = ( B + C ) <-> A = B )

Syntax hints:   <-> wb 105   = wceq 1398   e. wcel 2202  (class class class)co 6028   CCcc 8073   + caddc 8078

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-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-ext 2213  ax-resscn 8167  ax-1cn 8168  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-distr 8179  ax-i2m1 8180  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031

This theorem is referenced by: (None)