Metamath Proof Explorer

Theorem ltmin

Description: Two ways of saying a number is less than the minimum of two others. (Contributed by NM, 1-Sep-2006)

Ref Expression
Assertion ltmin 
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < if ( B <_ C , B , C ) <-> ( A < B /\ A < C ) ) )

Proof

Step Hyp Ref Expression
1 rexr 
 |-  ( A e. RR -> A e. RR* )
2 rexr 
 |-  ( B e. RR -> B e. RR* )
3 rexr 
 |-  ( C e. RR -> C e. RR* )
4 xrltmin 
 |-  ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( A < if ( B <_ C , B , C ) <-> ( A < B /\ A < C ) ) )
5 1 2 3 4 syl3an 
 |-  ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < if ( B <_ C , B , C ) <-> ( A < B /\ A < C ) ) )