Leonardo de Moura 2c2a3a65b2 feat: support theorems for cutsat Div-Solve rule (#7077) ... This PR proves the helper theorems for justifying the "Div-Solve" rule in the cutsat procedure.		2025-02-14 04:55:58 +00:00
..
Bitwise	feat: BitVec.toFin/ToInt BitVec.ushiftRight (#6238)	2024-12-04 01:49:58 +00:00
Basic.lean	feat: lemmas about Std.Range (#6396)	2024-12-16 03:16:46 +00:00
Bitwise.lean	chore: upstream Std.BitVec.* (#3400)	2024-02-19 12:43:34 -08:00
Cooper.lean	feat: Cooper resolution (#6862)	2025-01-30 18:47:14 +00:00
Cutsat.lean	feat: support theorems for cutsat Div-Solve rule (#7077)	2025-02-14 04:55:58 +00:00
DivMod.lean	doc: Fix (and expand) docstrings for bmod/bdiv (#6713)	2025-01-20 13:03:34 +00:00
DivModLemmas.lean	chore: small clean-up in DivModLemmas (#6877)	2025-01-31 16:17:16 +00:00
Gcd.lean	chore: upstream Std.Data.Int (#3635)	2024-03-11 21:40:48 +00:00
Lemmas.lean	chore: upstream an Int lemma (#7060)	2025-02-13 03:19:02 +00:00
LemmasAux.lean	feat: add SMT-LIB overflow on addition for bitvectors BitVec.(uadd_overflow, sadd_overflow, uadd_overflow_eq, sadd_overflow_eq) and support theorems (#6628)	2025-02-05 09:36:56 +00:00
Linear.lean	feat: linear integer inequality normalization using gcd of coefficients (#7030)	2025-02-11 03:45:25 +00:00
Order.lean	feat: update omega/solve_by_elim to use new tactic syntax, use new tactic syntax (#5932)	2024-11-03 16:23:37 +00:00
Pow.lean	chore: restore broken proofs	2024-12-03 17:59:23 +11:00