le_S: forall n m : nat, n <= m -> n <= S m
le_n: forall n : nat, n <= n
le_pred: forall n m : nat, n <= m -> pred n <= pred m
le_S_n: forall n m : nat, S n <= S m -> n <= m
false: bool
true: bool
xorb: bool -> bool -> bool
orb: bool -> bool -> bool
negb: bool -> bool
implb: bool -> bool -> bool
andb: bool -> bool -> bool
pred_Sn: forall n : nat, n = pred (S n)
plus_n_Sm: forall n m : nat, S (n + m) = n + S m
plus_n_O: forall n : nat, n = n + 0
plus_Sn_m: forall n m : nat, S n + m = S (n + m)
plus_O_n: forall n : nat, 0 + n = n
mult_n_Sm: forall n m : nat, n * m + n = n * S m
mult_n_O: forall n : nat, 0 = n * 0
min_r: forall n m : nat, m <= n -> min n m = m
min_l: forall n m : nat, n <= m -> min n m = n
max_r: forall n m : nat, n <= m -> max n m = m
max_l: forall n m : nat, m <= n -> max n m = n
f_equal_pred: forall x y : nat, x = y -> pred x = pred y
f_equal2_plus:
  forall x1 y1 x2 y2 : nat, x1 = y1 -> x2 = y2 -> x1 + x2 = y1 + y2
f_equal2_mult:
  forall x1 y1 x2 y2 : nat, x1 = y1 -> x2 = y2 -> x1 * x2 = y1 * y2
eq_add_S: forall n m : nat, S n = S m -> n = m
eq_S: forall x y : nat, x = y -> S x = S y