lean4-htt/tests/lean/run/sym_pattern.lean
Leonardo de Moura e086b9b5c6
fix: zetaDelta at Sym/Pattern.lean (#11849)
This PR fixes missing zetaDelta support at the pattern
matching/unification procedure in the new Sym framework.
2025-12-30 23:47:22 +00:00

68 lines
2.4 KiB
Text

import Lean.Meta.Sym
open Lean Meta Sym Grind
set_option grind.debug true
opaque p : Nat → Prop
opaque q : Nat → Nat → Prop
axiom pax : p x
def ex := ∃ x : Nat, p x ∧ x = .zero
def test1 : SymM Unit := do
let pEx ← mkPatternFromDecl ``Exists.intro
let pAnd ← mkPatternFromDecl ``And.intro
let pEq ← mkPatternFromDecl ``Eq.refl
let e ← shareCommon (← getConstInfo ``ex).value!
let some r₁ ← pEx.match? e | throwError "failed"
logInfo <| mkAppN (mkConst ``Exists.intro r₁.us) r₁.args
let some r₂ ← pAnd.match? (← inferType r₁.args[3]!) | throwError "failed"
logInfo <| mkAppN (mkConst ``And.intro r₂.us) r₂.args
let some r₃ ← pEq.unify? (← inferType r₂.args[3]!) | throwError "failed"
logInfo <| mkAppN (mkConst ``Eq.refl r₃.us) r₃.args
/--
info: @Exists.intro Nat (fun x => And (p x) (@Eq Nat x Nat.zero)) ?m.1 ?m.2
---
info: @And.intro (p ?m.1) (@Eq Nat ?m.1 Nat.zero) ?m.3 ?m.4
---
info: @Eq.refl Nat Nat.zero
-/
#guard_msgs in
set_option pp.explicit true in
#eval SymM.run' test1
def test2 : SymM Unit := do
let ruleEx ← mkBackwardRuleFromDecl ``Exists.intro
let ruleAnd ← mkBackwardRuleFromDecl ``And.intro
let ruleRefl ← mkBackwardRuleFromDecl ``Eq.refl
let rulePax ← mkBackwardRuleFromDecl ``pax
let mvar ← mkFreshExprMVar (← getConstInfo ``ex).value!
let goal ← Sym.mkGoal mvar.mvarId!
let [goal, _] ← ruleEx.apply goal | throwError "Failed"
let [goal₁, goal₂] ← ruleAnd.apply goal | throwError "Failed"
let [] ← rulePax.apply goal₁ | throwError "Failed"
let [] ← ruleRefl.apply goal₂ | throwError "Failed"
logInfo mvar
/--
info: @Exists.intro Nat (fun x => And (p x) (@Eq Nat x Nat.zero)) Nat.zero
(@And.intro (p Nat.zero) (@Eq Nat Nat.zero Nat.zero) (@pax Nat.zero) (@Eq.refl Nat Nat.zero))
-/
#guard_msgs in
set_option pp.explicit true in
#eval SymM.run' test2
opaque a : Nat
opaque bla : Nat → Nat → Nat
opaque foo : Type → Nat → Nat
axiom pFoo (x : Nat) : p (foo Prop (bla x 1))
def test3 : SymM Unit := do
withLetDecl `x (.sort 1) (.sort 0) fun x =>
withLetDecl `y (mkConst ``Nat) (mkNatLit 1) fun y => do
let target := mkApp (mkConst ``p) (mkApp2 (mkConst ``foo) x (mkApp2 (mkConst ``bla) (mkNatAdd (mkNatLit 3) y) y))
let mvar ← mkFreshExprMVar target
let goal ← Sym.mkGoal mvar.mvarId!
let rule ← mkBackwardRuleFromDecl ``pFoo
let [] ← rule.apply goal | throwError "failed"
logInfo mvar
#eval SymM.run' test3