lean4-htt/tests/lean/run/2161.lean
Joachim Breitner 316ff35afd
feat: deriving instances: use accessible names (#10271)
This PR changes the naming of the internal functions in deriving
instances like BEq to use accessible names. This is necessary to
reasonably easily prove things about these functions. For example after
`deriving BEq` for a type `T`, the implementation of `instBEqT` is in
`instBEqT.beq`.
2025-09-06 18:12:20 +00:00

48 lines
1.6 KiB
Text

structure Foo where num : Nat deriving DecidableEq
namespace Foo
instance : OfNat Foo n := ⟨⟨n⟩⟩
/-! # Example 1 -/
@[irreducible] def mul (a b : Foo) : Foo :=
let d := Nat.gcd a.num 1
⟨(a.num.div d) * (b.num.div d)⟩
-- should fail fast; exact heartbeat count at time of writing is 31
set_option maxHeartbeats 310
/--
error: Tactic `decide` failed for proposition
((mul 4 1).mul 1).mul 1 = 4
because its `Decidable` instance
instDecidableEqFoo (((mul 4 1).mul 1).mul 1) 4
did not reduce to `isTrue` or `isFalse`.
After unfolding the instances `instDecidableEqFoo`, `instDecidableEqNat`, `Nat.decEq`, and `instDecidableEqFoo.decEq`, reduction got stuck at the `Decidable` instance
match h : (((mul 4 1).mul 1).mul 1).num.beq 4 with
| true => isTrue ⋯
| false => isFalse ⋯
-/
#guard_msgs in
example : ((Foo.mul 4 1).mul 1).mul 1 = 4 := by decide
/-! # Example 2 -/
@[irreducible] def add (a b : Foo) : Foo := ⟨a.num * b.num⟩
-- should not succeed (and fail fast); exact heartbeat count at time of writing is 21
/--
error: Tactic `decide` failed for proposition
((add 4 1).add 1).add 1 = 4
because its `Decidable` instance
instDecidableEqFoo (((add 4 1).add 1).add 1) 4
did not reduce to `isTrue` or `isFalse`.
After unfolding the instances `instDecidableEqFoo`, `instDecidableEqNat`, `Nat.decEq`, and `instDecidableEqFoo.decEq`, reduction got stuck at the `Decidable` instance
match h : (((add 4 1).add 1).add 1).num.beq 4 with
| true => isTrue ⋯
| false => isFalse ⋯
-/
#guard_msgs in
example : ((Foo.add 4 1).add 1).add 1 = 4 := by decide