Theorem lesub2 8212

Description: Subtraction of both sides of 'less than or equal to'. (Contributed by NM, 29-Sep-2005.) (Revised by Mario Carneiro, 27-May-2016.)

Assertion

Ref	Expression
lesub2	|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( C - B ) <_ ( C - A ) ) )

Proof of Theorem lesub2

Step	Hyp	Ref	Expression
1		leadd2 8186	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( C + A ) <_ ( C + B ) ) )
2		simp3 983	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> C e. RR )
3		simp1 981	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> A e. RR )
4	2, 3	readdcld 7788	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( C + A ) e. RR )
5		simp2 982	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> B e. RR )
6		lesubadd 8189	. . . 4 |- ( ( ( C + A ) e. RR /\ B e. RR /\ C e. RR ) -> ( ( ( C + A ) - B ) <_ C <-> ( C + A ) <_ ( C + B ) ) )
7	4, 5, 2, 6	syl3anc 1216	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( ( C + A ) - B ) <_ C <-> ( C + A ) <_ ( C + B ) ) )
8	2	recnd 7787	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> C e. CC )
9	3	recnd 7787	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> A e. CC )
10	5	recnd 7787	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> B e. CC )
11	8, 9, 10	addsubd 8087	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( C + A ) - B ) = ( ( C - B ) + A ) )
12	11	breq1d 3934	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( ( C + A ) - B ) <_ C <-> ( ( C - B ) + A ) <_ C ) )
13	1, 7, 12	3bitr2d 215	. 2 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( ( C - B ) + A ) <_ C ) )
14	2, 5	resubcld 8136	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( C - B ) e. RR )
15		leaddsub 8193	. . 3 |- ( ( ( C - B ) e. RR /\ A e. RR /\ C e. RR ) -> ( ( ( C - B ) + A ) <_ C <-> ( C - B ) <_ ( C - A ) ) )
16	14, 3, 2, 15	syl3anc 1216	. 2 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( ( C - B ) + A ) <_ C <-> ( C - B ) <_ ( C - A ) ) )
17	13, 16	bitrd 187	1 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( C - B ) <_ ( C - A ) ) )

Syntax hints:   -> wi 4   <-> wb 104   /\ w3a 962   e. wcel 1480   class class class wbr 3924  (class class class)co 5767   RRcr 7612   + caddc 7616   <_ cle 7794   - cmin 7926

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-addcom 7713  ax-addass 7715  ax-distr 7717  ax-i2m1 7718  ax-0id 7721  ax-rnegex 7722  ax-cnre 7724  ax-pre-ltadd 7729

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-iota 5083  df-fun 5120  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929

This theorem is referenced by:  le2sub  8216  leneg  8220  lesub0  8234  lesub2d  8308