Lemma to validate the following simplification rules
- N1 - (N2 + n) ===> (N1 "-" N2) - n.
- (n - N1) - N2 ==> n - (N1 "+" N2).
Lemma to validate simplification rule (N1 - n) - N2 ==> (N1 "-" N2) - n.
Lemma to validate simplification rule (N1 + n) - N2 ==> (N1 "-" N2) + n (if N1 ≥ N2).
Return Blaster.nat_not_lt_of_lt const expression and cache result.
Equations
- Blaster.mkNat_not_lt_of_lt = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.nat_not_lt_of_lt)
Instances For
Return Blaster.nat_not_lt_right_of_eq const expression and cache result.
Equations
- Blaster.mkNat_not_lt_right_of_eq = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.nat_not_lt_right_of_eq)
Instances For
Return Blaster.nat_not_lt_left_of_eq const expression and cache result.
Equations
- Blaster.mkNat_not_lt_left_of_eq = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.nat_not_lt_left_of_eq)
Instances For
Return Blaster.nat_not_eq_of_lt_left const expression and cache result.
Equations
- Blaster.mkNat_not_eq_of_lt_left = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.nat_not_eq_of_lt_left)
Instances For
Return Blaster.nat_not_eq_of_lt_right const expression and cache result.
Equations
- Blaster.mkNat_not_eq_of_lt_right = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.nat_not_eq_of_lt_right)
Instances For
Return Blaster.nat_not_zero_eq_of_zero_lt const expression and cache result.
Equations
- Blaster.mkNat_not_zero_eq_of_zero_lt = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.nat_not_zero_eq_of_zero_lt)
Instances For
Return Blaster.nat_zero_lt_of_not_zero_eq const expression and cache result.
Equations
- Blaster.mkNat_zero_lt_of_not_zero_eq = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.nat_zero_lt_of_not_zero_eq)
Instances For
Return Blaster.sub_min_nat_of_eq const expression and cache result.
Equations
- Blaster.mkNat_sub_min_nat_of_eq = Blaster.Optimize.mkExpr (Lean.mkConst `Blaster.sub_min_nat_of_eq)