Joachim Breitner c797525d2a fix: WellFounded preprocessing: use dsimp (#7409) ... This PR allows the use of `dsimp` during preprocessing of well-founded definitions. This fixes regressions when using `if-then-else` without giving a name to the condition, but where the condition is needed for the termination proof, in cases where that subexpression is reachable only by dsimp, but not by simp (e.g. inside a dependent let) Also fixes some preprocessing lemmas to not be bad simp lemmas (with lambdas on the LHS, due to dot notation and unfortunate argument order) This fixes #7408.		2025-03-09 22:19:16 +00:00
..
ArgsPacker
Constructions	feat: align lemmas about List.getLast(!?) with Array/Vector.back(!?) (#7205)	2025-02-24 11:48:43 +00:00
Match	feat: add async support to more extensions and constructions (#7363)	2025-03-06 14:27:45 +00:00
Tactic	fix: WellFounded preprocessing: use dsimp (#7409)	2025-03-09 22:19:16 +00:00
AbstractMVars.lean
AbstractNestedProofs.lean	fix: abstractNestedProofs should see into the head of an application (#7353)	2025-03-06 20:08:38 +00:00
ACLt.lean
AppBuilder.lean	feat: infrastructure for inequalities constraints in cutsat (#7152)	2025-02-19 23:09:12 +00:00
ArgsPacker.lean	feat: identify more fixed parameters (#7166)	2025-03-04 22:26:20 +00:00
Basic.lean	feat: use realizeConst for all equation, unfold, induction, and partial fixpoint theorems (#7261)	2025-03-06 15:38:04 +00:00
BinderNameHint.lean	feat: binderNameHint in congr (#7053)	2025-02-13 09:38:42 +00:00
Canonicalizer.lean
Check.lean	chore: add missing diff-exposing in type/value mismatch errors (#6484)	2024-12-31 17:47:12 +00:00
CheckTactic.lean
Closure.lean
Coe.lean
CoeAttr.lean
CollectFVars.lean
CollectMVars.lean
CompletionName.lean
CongrTheorems.lean	feat: use realizeConst for all equation, unfold, induction, and partial fixpoint theorems (#7261)	2025-03-06 15:38:04 +00:00
Constructions.lean
CtorRecognizer.lean
DecLevel.lean
Diagnostics.lean	fix: add workaround for MessageData limitations (#6669)	2025-01-16 16:58:20 +00:00
DiscrTree.lean	feat: allow line-wrapping when printing DiscrTree.Keys (#7200)	2025-02-24 07:52:47 +00:00
DiscrTreeTypes.lean
Eqns.lean	feat: use realizeConst for all equation and unfold theorems (#7348)	2025-03-05 14:56:50 +00:00
Eval.lean	feat: asynchronous code generation (#6770)	2025-02-03 17:17:18 +00:00
ExprDefEq.lean	feat: zetaUnused option (implementation) (#6755)	2025-01-26 11:14:12 +00:00
ExprLens.lean
ExprTraverse.lean
ForEachExpr.lean
FunInfo.lean	feat: refactor of find functions on List/Array/Vector (#6833)	2025-01-30 01:14:21 +00:00
GeneralizeTelescope.lean
GeneralizeVars.lean
GetUnfoldableConst.lean	refactor: getUnfoldableConst*? (#5997)	2025-01-18 23:30:40 +00:00
GlobalInstances.lean
IndPredBelow.lean	feat: refactor of find functions on List/Array/Vector (#6833)	2025-01-30 01:14:21 +00:00
Inductive.lean
InferType.lean
Injective.lean
Instances.lean
IntInstTesters.lean	feat: divisibility constraint normalizer (#7092)	2025-02-15 04:20:40 +00:00
Iterator.lean
KAbstract.lean
KExprMap.lean
LazyDiscrTree.lean	feat: cleanup of get and back functions on List/Array (#7059)	2025-02-17 01:43:45 +00:00
LevelDefEq.lean
LitValues.lean	doc: Char docstring proofreading (#7198)	2025-03-08 22:17:01 +00:00
Match.lean
MatchUtil.lean
NatInstTesters.lean
Offset.lean
PPGoal.lean
PProdN.lean	feat: partial_fixpoint: partial functions with equations (#6355)	2025-01-21 09:54:30 +00:00
RecursorInfo.lean	feat: refactor of find functions on List/Array/Vector (#6833)	2025-01-30 01:14:21 +00:00
Reduce.lean
ReduceEval.lean
SizeOf.lean
Sorry.lean
Structure.lean	chore: reimplement mk_projections in Lean (#7295)	2025-03-03 01:10:27 +00:00
SynthInstance.lean	feat: cleanup of get and back functions on List/Array (#7059)	2025-02-17 01:43:45 +00:00
Tactic.lean	feat: cutsat preparations (#7097)	2025-02-16 02:52:14 +00:00
Transform.lean
TransparencyMode.lean
UnificationHint.lean
WHNF.lean	feat: cleanup of get and back functions on List/Array (#7059)	2025-02-17 01:43:45 +00:00