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>
19 lines
337 B
Text
19 lines
337 B
Text
x : Nat
|
|
| id (twice (id x))
|
|
x : Nat
|
|
| id x
|
|
x : Nat
|
|
| x
|
|
x : Nat
|
|
| id (twice x)
|
|
y : Nat
|
|
| (fun x => x + y = 0) = fun x => False
|
|
y : Nat
|
|
| fun x => x + y = 0
|
|
y x : Nat
|
|
| y + x = 0
|
|
y : Nat
|
|
| (fun x => y + x = 0) = fun x => False
|
|
y : Nat
|
|
⊢ (fun x => y + x = 0) = fun x => False
|
|
convInConv.lean:15:8-15:12: warning: declaration uses `sorry`
|