key
stringlengths
12
67
value
stringlengths
29
186
absolute value upper bounds input
Theorem Zle_abs : forall p : Z, (p <= Z_of_nat (Z.abs_nat p))%Z.
functionally equal functions produce equivalent maps
Lemma map_ext : forall (A B : Type)(f g:A->B), (forall a, f a = g a) -> forall l, map f l = map g l.
boolean negation self invert
Lemma negb_involutive : forall b:bool, negb (negb b) = b.
reciprocal self invert
Lemma Rinv_inv r : / / r = r.