517899da7b
This PR implements tactics called `extract_lets` and `lift_lets` that manipulate `let`/`let_fun` expressions. The `extract_lets` tactic creates new local declarations extracted from any `let` and `let_fun` expressions in the main goal. For top-level lets in the target, it is like the `intros` tactic, but in general it can extract lets from deeper subexpressions as well. The `lift_lets` tactic moves `let` and `let_fun` expressions as far out of an expression as possible, but it does not extract any new local declarations. The option `extract_lets +lift` combines these behaviors. This is a re-implementation of `extract_lets` and `lift_lets` from mathlib. The new `extract_lets` is like doing `lift_lets; extract_lets`, but it does not lift unextractable lets like `lift_lets`. The `lift_lets; extract_lets` behavior is now handled by `extract_lets +lift`. The new `lift_lets` tactic is a frontend to `extract_lets +lift` machinery, which rather than creating new local definitions instead represents the accumulated local declarations as top-level lets. There are also conv tactics for both of these. The `extract_lets` has a limitation due to the conv architecture; it can extract lets for a given conv goal, but the local declarations don't survive outside conv. They get zeta reduced immediately upon leaving conv.
53 lines
1.7 KiB
Text
53 lines
1.7 KiB
Text
/-
|
|
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
Authors: Leonardo de Moura, Sebastian Ullrich
|
|
-/
|
|
prelude
|
|
import Lean.Elab.Term
|
|
import Lean.Elab.Tactic.Basic
|
|
import Lean.Elab.Tactic.ElabTerm
|
|
import Lean.Elab.Tactic.Induction
|
|
import Lean.Elab.Tactic.Generalize
|
|
import Lean.Elab.Tactic.Injection
|
|
import Lean.Elab.Tactic.Match
|
|
import Lean.Elab.Tactic.Rewrite
|
|
import Lean.Elab.Tactic.Location
|
|
import Lean.Elab.Tactic.SimpTrace
|
|
import Lean.Elab.Tactic.Simp
|
|
import Lean.Elab.Tactic.Simproc
|
|
import Lean.Elab.Tactic.BuiltinTactic
|
|
import Lean.Elab.Tactic.Split
|
|
import Lean.Elab.Tactic.Conv
|
|
import Lean.Elab.Tactic.Delta
|
|
import Lean.Elab.Tactic.Meta
|
|
import Lean.Elab.Tactic.Unfold
|
|
import Lean.Elab.Tactic.Calc
|
|
import Lean.Elab.Tactic.Congr
|
|
import Lean.Elab.Tactic.Guard
|
|
import Lean.Elab.Tactic.RCases
|
|
import Lean.Elab.Tactic.Repeat
|
|
import Lean.Elab.Tactic.Ext
|
|
import Lean.Elab.Tactic.Change
|
|
import Lean.Elab.Tactic.FalseOrByContra
|
|
import Lean.Elab.Tactic.Omega
|
|
import Lean.Elab.Tactic.Simpa
|
|
import Lean.Elab.Tactic.NormCast
|
|
import Lean.Elab.Tactic.Symm
|
|
import Lean.Elab.Tactic.SolveByElim
|
|
import Lean.Elab.Tactic.LibrarySearch
|
|
import Lean.Elab.Tactic.ShowTerm
|
|
import Lean.Elab.Tactic.Rfl
|
|
import Lean.Elab.Tactic.Rewrites
|
|
import Lean.Elab.Tactic.DiscrTreeKey
|
|
import Lean.Elab.Tactic.BVDecide
|
|
import Lean.Elab.Tactic.BoolToPropSimps
|
|
import Lean.Elab.Tactic.Classical
|
|
import Lean.Elab.Tactic.Grind
|
|
import Lean.Elab.Tactic.Monotonicity
|
|
import Lean.Elab.Tactic.Try
|
|
import Lean.Elab.Tactic.AsAuxLemma
|
|
import Lean.Elab.Tactic.TreeTacAttr
|
|
import Lean.Elab.Tactic.ExposeNames
|
|
import Lean.Elab.Tactic.SimpArith
|
|
import Lean.Elab.Tactic.Lets
|