Theorem lesub2 8376

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 8350	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( C + A ) <_ ( C + B ) ) )
2		simp3 994	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> C e. RR )
3		simp1 992	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> A e. RR )
4	2, 3	readdcld 7949	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( C + A ) e. RR )
5		simp2 993	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> B e. RR )
6		lesubadd 8353	. . . 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 1233	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( ( C + A ) - B ) <_ C <-> ( C + A ) <_ ( C + B ) ) )
8	2	recnd 7948	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> C e. CC )
9	3	recnd 7948	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> A e. CC )
10	5	recnd 7948	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> B e. CC )
11	8, 9, 10	addsubd 8251	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( C + A ) - B ) = ( ( C - B ) + A ) )
12	11	breq1d 3999	. . 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 8300	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( C - B ) e. RR )
15		leaddsub 8357	. . 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 1233	. 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 973   e. wcel 2141   class class class wbr 3989  (class class class)co 5853   RRcr 7773   + caddc 7777   <_ cle 7955   - cmin 8090

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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltadd 7890

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093

This theorem is referenced by:  le2sub  8380  leneg  8384  lesub0  8398  lesub2d  8472