e82cd9b62c
This PR refines how the `apply` tactic (and related tactics like `rewrite`) name and tag the remaining subgoals. Assigned metavariables are now filtered out *before* computing subgoal tags. As a consequence, when only one unassigned subgoal remains, it inherits the tag of the input goal instead of being given a fresh suffixed tag. User-visible effect: proof states that previously displayed tags like `case h`, `case a`, or `case upper.h` for a single remaining goal now display the input goal's tag directly (e.g. no tag at all, or `case upper`). This removes noise from `funext`, `rfl`-style, and `induction`-alternative goals when the applied lemma introduces only one non-assigned metavariable. Multi-goal applications are unaffected — their subgoals continue to receive distinguishing suffixes. This may affect users whose proofs rely on the previous tag names (for example, `case h => ...` after `funext`). Such scripts need to be updated to use the input goal's tag instead. --------- Co-authored-by: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
31 lines
529 B
Text
31 lines
529 B
Text
@[simp] def foo (a : Nat) : Nat :=
|
|
2 * a
|
|
|
|
/--
|
|
trace: x : Nat
|
|
⊢ 2 * x = x + x
|
|
-/
|
|
#guard_msgs in
|
|
example : foo = fun a => a + a :=
|
|
by
|
|
fail_if_success simp -- should not unfold `foo` into a lambda
|
|
funext x
|
|
simp -- unfolds `foo`
|
|
trace_state
|
|
simp +arith
|
|
|
|
@[simp] def boo : Nat → Nat
|
|
| a => 2 * a
|
|
|
|
/--
|
|
trace: x : Nat
|
|
⊢ 2 * x = x + x
|
|
-/
|
|
#guard_msgs in
|
|
example : boo = fun a => a + a :=
|
|
by
|
|
fail_if_success simp -- should not unfold `boo` into a lambda
|
|
funext x
|
|
simp -- unfolds `boo`
|
|
trace_state
|
|
simp +arith
|