Metamath Proof Explorer


Theorem ltmuldiv

Description: 'Less than' relationship between division and multiplication. (Contributed by NM, 12-Oct-1999) (Proof shortened by Mario Carneiro, 27-May-2016)

Ref Expression
Assertion ltmuldiv ABC0<CAC<BA<BC

Proof

Step Hyp Ref Expression
1 simp1 ABC0<CA
2 simp3l ABC0<CC
3 1 2 remulcld ABC0<CAC
4 ltdiv1 ACBC0<CAC<BACC<BC
5 3 4 syld3an1 ABC0<CAC<BACC<BC
6 1 recnd ABC0<CA
7 2 recnd ABC0<CC
8 simp3r ABC0<C0<C
9 8 gt0ne0d ABC0<CC0
10 6 7 9 divcan4d ABC0<CACC=A
11 10 breq1d ABC0<CACC<BCA<BC
12 5 11 bitrd ABC0<CAC<BA<BC