Documentation

Blaster.Optimize.Lemmas.LemmasInt

Lemmas validating the normalization and simplifications on Int #

theorem Blaster.int_not_lt_of_lt {a b : Int} (h : a < b) :
¬b < a
theorem Blaster.int_not_lt_right_of_eq {a b : Int} (h : a = b) :
¬b < a
theorem Blaster.int_not_lt_left_of_eq {a b : Int} (h : a = b) :
¬a < b
theorem Blaster.int_not_eq_of_lt_left {a b : Int} (h : a < b) :
¬a = b
theorem Blaster.int_not_eq_of_lt_right {a b : Int} (h : b < a) :
¬a = b
theorem Blaster.int_not_zero_eq_of_lt_zero {a : Int} (h : a < 0) :
¬0 = a
theorem Blaster.int_not_zero_eq_of_zero_lt {a : Int} (h : 0 < a) :
¬0 = a
theorem Blaster.zero_lt_neg_of_lt_zero {a : Int} (h : a < 0) :
0 < -a
theorem Blaster.lt_zero_of_zero_lt_neg {a : Int} (h : 0 < -a) :
a < 0
theorem Blaster.sub_min_int_of_eq (N1 N2 a b : Int) (h : N1 + a = N2 + b) :
N1 - min N1 N2 + a = N2 - min N1 N2 + b

Return Blaster.int_not_lt_of_lt const expression and cache result.

Equations
Instances For