lean4-htt/tests/lean/run/2389.lean
Joachim Breitner 0e49576fe4
feat: guard_msgs to treat trace messages separate (#8267)
This PR makes `#guard_msgs` to treat `trace` messages separate from
`info`, `warning` and `error`. It also introduce the ability to say
`#guard_msgs (pass info`, like `(drop info)` so far, and also adds
`(check info)` as the explicit form of `(info)`, for completeness.

Fixes #8266
2025-05-09 05:44:34 +00:00

38 lines
1.5 KiB
Text
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/-!
# Verify that nested predicates don't trigger the generation of `below` lemmas
Since the case of nested predicates is not currently handled by `mkBelow` (in `src/Lean/Meta/IndPredBelow.lean`),
trying to generate `OnlyZeros.below` triggers an error upon defining the inductive type.
-/
inductive Forall (P : α → Prop) : List α → Prop
| nil : Forall P []
| cons : {x : α} → P x → Forall P l → Forall P (x::l)
inductive Tree : Type where
| leaf : Nat → Tree
| node : List Tree → Tree
set_option trace.Meta.IndPredBelow true in
/-- trace: [Meta.IndPredBelow] Nested or not recursive -/
#guard_msgs in
/-- Despite not having `.below` and `.brecOn`,
the type is still usable thanks to well-founded recursion. -/
inductive OnlyZeros : Tree → Prop where
| leaf : OnlyZeros (.leaf 0)
| node (l : List Tree): Forall OnlyZeros l → OnlyZeros (.node l)
/-- Equivalent definition of `OnlyZeros`, defined by a function instead of an inductive type. -/
def onlyZeros : Tree → Prop
| .leaf n => n = 0
| .node [] => True
| .node (x::s) => onlyZeros x ∧ onlyZeros (.node s)
/-- Pattern-matching on `OnlyZeros` works despite `below` and `brecOn` not being generated
if we make `onlyZeros` semireducible-/
def toFixPoint : OnlyZeros t → onlyZeros t
| .leaf => by simp [onlyZeros]
| .node [] _ => by simp [onlyZeros]
| .node (x::s) (.cons h p) => by
rw [onlyZeros] -- necessary because `onlyZeros` isn't structurally recursive
exact And.intro (toFixPoint h) (toFixPoint (.node s p))