Theorem lediv1dd

Description: Division of both sides of a less than or equal to relation by a positive number. (Contributed by Mario Carneiro, 30-May-2016)

	Ref	Expression
Hypotheses	ltmul1d.1	|- ( ph -> A e. RR )
	ltmul1d.2	|- ( ph -> B e. RR )
	ltmul1d.3	|- ( ph -> C e. RR+ )
	lediv1dd.4	|- ( ph -> A <_ B )
Assertion	lediv1dd	|- ( ph -> ( A / C ) <_ ( B / C ) )

Proof

Step	Hyp	Ref	Expression
1		ltmul1d.1	|- ( ph -> A e. RR )
2		ltmul1d.2	|- ( ph -> B e. RR )
3		ltmul1d.3	|- ( ph -> C e. RR+ )
4		lediv1dd.4	|- ( ph -> A <_ B )
5	1 2 3	lediv1d	|- ( ph -> ( A <_ B <-> ( A / C ) <_ ( B / C ) ) )
6	4 5	mpbid	|- ( ph -> ( A / C ) <_ ( B / C ) )