Theorem lesub2 7989

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 7963	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ B <-> ( C + A ) <_ ( C + B ) ) )
2		simp3 946	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> C e. RR )
3		simp1 944	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> A e. RR )
4	2, 3	readdcld 7571	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( C + A ) e. RR )
5		simp2 945	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> B e. RR )
6		lesubadd 7966	. . . 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 1175	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( ( C + A ) - B ) <_ C <-> ( C + A ) <_ ( C + B ) ) )
8	2	recnd 7570	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> C e. CC )
9	3	recnd 7570	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> A e. CC )
10	5	recnd 7570	. . . . 5 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> B e. CC )
11	8, 9, 10	addsubd 7868	. . . 4 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( C + A ) - B ) = ( ( C - B ) + A ) )
12	11	breq1d 3861	. . 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 7913	. . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( C - B ) e. RR )
15		leaddsub 7970	. . 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 1175	. 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 925   e. wcel 1439   class class class wbr 3851  (class class class)co 5666   RRcr 7403   + caddc 7407   <_ cle 7577   - cmin 7707

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-sep 3963  ax-pow 4015  ax-pr 4045  ax-un 4269  ax-setind 4366  ax-cnex 7490  ax-resscn 7491  ax-1cn 7492  ax-icn 7494  ax-addcl 7495  ax-addrcl 7496  ax-mulcl 7497  ax-addcom 7499  ax-addass 7501  ax-distr 7503  ax-i2m1 7504  ax-0id 7507  ax-rnegex 7508  ax-cnre 7510  ax-pre-ltadd 7515

This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-nel 2352  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-br 3852  df-opab 3906  df-id 4129  df-xp 4457  df-rel 4458  df-cnv 4459  df-co 4460  df-dm 4461  df-iota 4993  df-fun 5030  df-fv 5036  df-riota 5622  df-ov 5669  df-oprab 5670  df-mpt2 5671  df-pnf 7578  df-mnf 7579  df-xr 7580  df-ltxr 7581  df-le 7582  df-sub 7709  df-neg 7710

This theorem is referenced by:  le2sub  7993  leneg  7997  lesub0  8011  lesub2d  8084