Theorem ledivge1le 10127

Description: If a number is less than or equal to another number, the number divided by a positive number greater than or equal to one is less than or equal to the other number. (Contributed by AV, 29-Jun-2021.)

Assertion

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

Proof of Theorem ledivge1le

Step	Hyp	Ref	Expression
1		divle1le 10126	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR+ ) -> ( ( A / B ) <_ 1 <-> A <_ B ) )
2	1	adantr 276	. . . . . . . 8 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> ( ( A / B ) <_ 1 <-> A <_ B ) )
3		rerpdivcl 10085	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR+ ) -> ( A / B ) e. RR )
4	3	adantr 276	. . . . . . . . . 10 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> ( A / B ) e. RR )
5		1red 8341	. . . . . . . . . 10 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> 1 e. RR )
6		rpre 10061	. . . . . . . . . . 11 |- ( C e. RR+ -> C e. RR )
7	6	adantl 277	. . . . . . . . . 10 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> C e. RR )
8		letr 8408	. . . . . . . . . 10 |- ( ( ( A / B ) e. RR /\ 1 e. RR /\ C e. RR ) -> ( ( ( A / B ) <_ 1 /\ 1 <_ C ) -> ( A / B ) <_ C ) )
9	4, 5, 7, 8	syl3anc 1278	. . . . . . . . 9 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> ( ( ( A / B ) <_ 1 /\ 1 <_ C ) -> ( A / B ) <_ C ) )
10	9	expd 258	. . . . . . . 8 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> ( ( A / B ) <_ 1 -> ( 1 <_ C -> ( A / B ) <_ C ) ) )
11	2, 10	sylbird 170	. . . . . . 7 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> ( A <_ B -> ( 1 <_ C -> ( A / B ) <_ C ) ) )
12	11	com23 78	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR+ ) /\ C e. RR+ ) -> ( 1 <_ C -> ( A <_ B -> ( A / B ) <_ C ) ) )
13	12	expimpd 363	. . . . 5 |- ( ( A e. RR /\ B e. RR+ ) -> ( ( C e. RR+ /\ 1 <_ C ) -> ( A <_ B -> ( A / B ) <_ C ) ) )
14	13	ex 115	. . . 4 |- ( A e. RR -> ( B e. RR+ -> ( ( C e. RR+ /\ 1 <_ C ) -> ( A <_ B -> ( A / B ) <_ C ) ) ) )
15	14	3imp1 1251	. . 3 |- ( ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) /\ A <_ B ) -> ( A / B ) <_ C )
16		simp1 1028	. . . . . 6 |- ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) -> A e. RR )
17	6	adantr 276	. . . . . . . 8 |- ( ( C e. RR+ /\ 1 <_ C ) -> C e. RR )
18		0lt1 8453	. . . . . . . . . 10 |- 0 < 1
19		0red 8327	. . . . . . . . . . 11 |- ( C e. RR+ -> 0 e. RR )
20		1red 8341	. . . . . . . . . . 11 |- ( C e. RR+ -> 1 e. RR )
21		ltletr 8415	. . . . . . . . . . 11 |- ( ( 0 e. RR /\ 1 e. RR /\ C e. RR ) -> ( ( 0 < 1 /\ 1 <_ C ) -> 0 < C ) )
22	19, 20, 6, 21	syl3anc 1278	. . . . . . . . . 10 |- ( C e. RR+ -> ( ( 0 < 1 /\ 1 <_ C ) -> 0 < C ) )
23	18, 22	mpani 434	. . . . . . . . 9 |- ( C e. RR+ -> ( 1 <_ C -> 0 < C ) )
24	23	imp 124	. . . . . . . 8 |- ( ( C e. RR+ /\ 1 <_ C ) -> 0 < C )
25	17, 24	jca 306	. . . . . . 7 |- ( ( C e. RR+ /\ 1 <_ C ) -> ( C e. RR /\ 0 < C ) )
26	25	3ad2ant3 1051	. . . . . 6 |- ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) -> ( C e. RR /\ 0 < C ) )
27		rpregt0 10068	. . . . . . 7 |- ( B e. RR+ -> ( B e. RR /\ 0 < B ) )
28	27	3ad2ant2 1050	. . . . . 6 |- ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) -> ( B e. RR /\ 0 < B ) )
29	16, 26, 28	3jca 1208	. . . . 5 |- ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) -> ( A e. RR /\ ( C e. RR /\ 0 < C ) /\ ( B e. RR /\ 0 < B ) ) )
30	29	adantr 276	. . . 4 |- ( ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) /\ A <_ B ) -> ( A e. RR /\ ( C e. RR /\ 0 < C ) /\ ( B e. RR /\ 0 < B ) ) )
31		lediv23 9223	. . . 4 |- ( ( A e. RR /\ ( C e. RR /\ 0 < C ) /\ ( B e. RR /\ 0 < B ) ) -> ( ( A / C ) <_ B <-> ( A / B ) <_ C ) )
32	30, 31	syl 14	. . 3 |- ( ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) /\ A <_ B ) -> ( ( A / C ) <_ B <-> ( A / B ) <_ C ) )
33	15, 32	mpbird 167	. 2 |- ( ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) /\ A <_ B ) -> ( A / C ) <_ B )
34	33	ex 115	1 |- ( ( A e. RR /\ B e. RR+ /\ ( C e. RR+ /\ 1 <_ C ) ) -> ( A <_ B -> ( A / C ) <_ B ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   RRcr 8178   0cc0 8179   1c1 8180   < clt 8360   <_ cle 8361   / cdiv 9002   RR+crp 10054

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-rp 10055

This theorem is used by:  gausslemma2dlem1a  16177