The Coq mailing list

["Thomas Nelson" <thomasharrisonnelson AT gmail.com>]

Ok, the comments I recieved helped, but I've become stuck again.  I
was working through some simple proofs about the min function on
integers:

Coq < Require Import ZArith.

Coq < Definition min (x y : Z) := if Z_lt_dec x y then x else y.

Theorem min1 : forall x y, Zle (min x y) x.

This solves the proof easily for me:
unfold min in |- *.
intros.
case (Z_lt_dec x y).
 auto with *.
auto with *.

However, if I try the same thing with real numbers, the second auto
with * fails.

Definition min (x y : R) := if Rlt_dec x y then x else y.
Theorem min1 : forall x y, Rle (min x y) x.
unfold min in |- *.
intros.
case (Rlt_dec x y).
 auto with *.
auto with *.

This brings me to here:
1 subgoal

  x : R
  y : R
  ============================
   not (Rlt x y) -> Rle y x

using "apply or_to_imply" I can get to:

   or (not (not (Rlt x y))) (Rle y x)

Which is very close to

Rle_or_lt: forall r1 r2 : R, or (Rle r1 r2) (Rlt r2 r1)

but I cant get rid of the not not, since
P -> ~~P isn't an equality in the standard library, and I can't figure
out how to prove it so I can use rewrite.

I hope this makes sense, If anyone could point out where I'm going
wrong that would be great.