fact stringlengths 5 7.21k | type stringclasses 9
values | library stringclasses 2
values | imports listlengths 0 3 | filename stringclasses 204
values | symbolic_name stringlengths 1 41 | docstring stringclasses 245
values |
|---|---|---|---|---|---|---|
TT₃ where namespace Test scoped add_aesop_rules safe TT₃ | structure | AesopTest | [
"import Aesop"
] | AesopTest/AddRulesCommand.lean | TT₃ | /-- error: tactic 'aesop' failed, made no progress -/ |
Test.example : TT₃ := by aesop -- Tactics | def | AesopTest | [
"import Aesop"
] | AesopTest/AddRulesCommand.lean | Test.example | /-- error: tactic 'aesop' failed, made no progress -/ |
TT₄ where /-- error: tactic 'aesop' failed, made no progress -/ #guard_msgs in | structure | AesopTest | [
"import Aesop"
] | AesopTest/AddRulesCommand.lean | TT₄ | /-- error: tactic 'aesop' failed, made no progress -/ |
T : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/AddRulesCommand.lean | T | /-- error: tactic 'aesop' failed, made no progress -/ |
U : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/AddRulesCommand.lean | U | /-- error: tactic 'aesop' failed, made no progress -/ |
f : T → U | axiom | AesopTest | [
"import Aesop"
] | AesopTest/AddRulesCommand.lean | f | /-- error: tactic 'aesop' failed, made no progress -/ |
t : T /-- error: tactic 'aesop' failed, made no progress -/ #guard_msgs in | axiom | AesopTest | [
"import Aesop"
] | AesopTest/AddRulesCommand.lean | t | /-- error: tactic 'aesop' failed, made no progress -/ |
Even : Nat → Prop | zero : Even 0 | plus_two {n} : Even n → Even (n + 2) | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Aesop.lean | Even | null |
Odd : Nat → Prop | one : Odd 1 | plus_two {n} : Odd n → Odd (n + 2) | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Aesop.lean | Odd | null |
EvenOrOdd : Nat → Prop | even {n} : Even n → EvenOrOdd n | odd {n} : Odd n → EvenOrOdd n attribute [aesop unsafe] EvenOrOdd.even EvenOrOdd.odd attribute [aesop safe] Even.zero Even.plus_two attribute [aesop 100%] Odd.one Odd.plus_two @[aesop norm unfold] | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Aesop.lean | EvenOrOdd | null |
EvenOrOdd' (n : Nat) : Prop := EvenOrOdd n | def | AesopTest | [
"import Aesop"
] | AesopTest/Aesop.lean | EvenOrOdd' | null |
Wrap (α) where unwrap : α /-- error: tactic 'aesop' failed, maximum number of rule applications (20) reached. Set the 'maxRuleApplications' option to increase the limit. -/ #guard_msgs in | structure | AesopTest | [
"import Aesop"
] | AesopTest/Aesop.lean | Wrap | null |
All (P : α → Prop) : List α → Prop where | none : All P [] | more {x xs} : P x → All P xs → All P (x :: xs) @[aesop unsafe] | inductive | AesopTest | [
"import Aesop"
] | AesopTest/AllWeaken.lean | All | null |
weaken {α} (P Q : α → Prop) (wk : ∀ x, P x → Q x) (xs : List α) (h : All P xs) : All Q xs /-- error: tactic 'aesop' failed, maximum number of rule applications (50) reached. Set the 'maxRuleApplications' option to increase the limit. -/ #guard_msgs in | axiom | AesopTest | [
"import Aesop"
] | AesopTest/AllWeaken.lean | weaken | null |
T := Unit → Nat /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/ApplyHypsTransparency.lean | T | null |
U := Empty /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/ApplyHypsTransparency.lean | U | /--
error: tactic 'aesop' failed, failed to prove the goal after exhaustive search.
-/ |
T := True /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/ApplyTransparency.lean | T | null |
U := T /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/ApplyTransparency.lean | U | /--
error: tactic 'aesop' failed, failed to prove the goal after exhaustive search.
-/ |
T := Empty /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/AssumptionTransparency.lean | T | null |
U := False /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/AssumptionTransparency.lean | U | /--
error: tactic 'aesop' failed, failed to prove the goal after exhaustive search.
-/ |
foo (m n : Nat) : n + m = m + n ∧ m + n = n + m := by fail_if_success aesop (config := { terminal := true }) aesop (add safe (by omega)) local instance [Add α] [Add β] : Add (α × β) := ⟨λ (a, b) (a', b') => (a + a', b + b')⟩ | theorem | AesopTest | [
"import Aesop"
] | AesopTest/AuxDecl.lean | foo | null |
bar (fst snd fst_1 snd_1 fst_2 snd_2 w w_1 w_2 w_3 : BitVec 128) (left : w_1.uaddOverflow w_3 = true) (left_1 : w.uaddOverflow w_2 = true) (right : (w_1 + w_3).uaddOverflow 1#128 = true) : (fst_2, snd_2) = (fst, snd) + (fst_1, snd_1) := by aesop (add safe (by bv_decide)) | theorem | AesopTest | [
"import Aesop"
] | AesopTest/AuxDecl.lean | bar | null |
baz (a b : BitVec 1) : (a = 0 ∨ a = 1) ∧ (b = 0 ∨ b = 1) := by aesop (add safe 1000 (by bv_decide)) | theorem | AesopTest | [
"import Aesop"
] | AesopTest/AuxDecl.lean | baz | null |
Variable := String | abbrev | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | Variable | null |
State := Variable → Nat | def | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | State | null |
Stmt : Type where | skip : Stmt | assign : Variable → (State → Nat) → Stmt | seq : Stmt → Stmt → Stmt | ifThenElse : (State → Prop) → Stmt → Stmt → Stmt | whileDo : (State → Prop) → Stmt → Stmt infix:60 ";; " => Stmt.seq export Stmt (skip assign seq ifThenElse whileDo) set_option quotPrecheck false in notation s:70 "["... | inductive | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | Stmt | null |
BigStep : Stmt → State → State → Prop where | protected skip (s : State) : BigStep skip s s | protected assign (x : Variable) (a : State → Nat) (s : State) : BigStep (assign x a) s (s[x ↦ a s]) | protected seq {S T : Stmt} {s t u : State} (hS : BigStep S s t) (hT : BigStep T t u) : BigStep (S;; T) s u | protected if_tr... | inductive | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | BigStep | null |
cases_if_of_true {B S T s t} (hcond : B s) : (ifThenElse B S T, s) ==> t → (S, s) ==> t := by intro h; cases h <;> aesop @[aesop safe destruct] | theorem | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | cases_if_of_true | null |
cases_if_of_false {B S T s t} (hcond : ¬ B s) : (ifThenElse B S T, s) ==> t → (T, s) ==> t := by intro h; cases h <;> aesop @[aesop 30%] | theorem | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | cases_if_of_false | null |
and_excluded {P Q R : Prop} (hQ : P → Q) (hR : ¬ P → R) : (P ∧ Q ∨ ¬ P ∧ R) := by by_cases h : P <;> aesop | theorem | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | and_excluded | null |
if_iff {B S T s t} : (ifThenElse B S T, s) ==> t ↔ (B s ∧ (S, s) ==> t) ∨ (¬ B s ∧ (T, s) ==> t) := by aesop | theorem | AesopTest | [
"import Aesop"
] | AesopTest/BigStep.lean | if_iff | null |
FancyAnd (α β : Prop) : Prop | dummy (p : Empty) | and (a : α) (b : β) attribute [aesop safe -51 cases] Empty | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Cases.lean | FancyAnd | null |
All (P : α → Prop) : List α → Prop | nil : All P [] | cons : P x → All P xs → All P (x :: xs) @[aesop 99% constructors] | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Cases.lean | All | null |
MyTrue : Prop -- Without the patterns on the `cases` rule for `All`, this test would loop -- since the `constructors` rule would never be applied. | structure | AesopTest | [
"import Aesop"
] | AesopTest/Cases.lean | MyTrue | null |
FancyAnd (α β : Prop) : Prop | dummy (p : Empty) | and (a : α) (b : β) /-- info: Try this: [apply] apply And.intro · cases h with | dummy p => have fwd : False := Aesop.BuiltinRules.empty_false p simp_all only | and a b => simp_all only · cases h with | dummy p => have fwd : False := Aesop.BuiltinRules.empty_false p si... | inductive | AesopTest | [
"import Aesop"
] | AesopTest/CasesScript.lean | FancyAnd | null |
All (P : α → Prop) : List α → Prop | nil : All P [] | cons : P x → All P xs → All P (x :: xs) @[aesop 99% constructors] | inductive | AesopTest | [
"import Aesop"
] | AesopTest/CasesScript.lean | All | null |
MyTrue : Prop /-- info: Try this: [apply] rcases h with ⟨⟩ | @⟨x_1, xs_1, a, a_1⟩ apply MyTrue.mk -/ #guard_msgs in | structure | AesopTest | [
"import Aesop"
] | AesopTest/CasesScript.lean | MyTrue | null |
T := False variable {α : Type} /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/CasesTransparency.lean | T | null |
U := T | def | AesopTest | [
"import Aesop"
] | AesopTest/CasesTransparency.lean | U | /--
error: tactic 'aesop' failed, failed to prove the goal after exhaustive search.
-/ |
U := T | abbrev | AesopTest | [
"import Aesop"
] | AesopTest/CasesTypeSynonym.lean | U | null |
V := T | def | AesopTest | [
"import Aesop"
] | AesopTest/CasesTypeSynonym.lean | V | null |
W := V | abbrev | AesopTest | [
"import Aesop"
] | AesopTest/CasesTypeSynonym.lean | W | null |
X := V | def | AesopTest | [
"import Aesop"
] | AesopTest/CasesTypeSynonym.lean | X | null |
A (α : Type) : Prop | inductive | AesopTest | [
"import Aesop"
] | AesopTest/CasesTypeSynonym.lean | A | null |
B β := A β | abbrev | AesopTest | [
"import Aesop"
] | AesopTest/CasesTypeSynonym.lean | B | null |
State := String → Int | abbrev | AesopTest | [
"import Aesop"
] | AesopTest/Com.lean | State | null |
Com where | Skip : Com | Seq : Com → Com → Com declare_syntax_cat com syntax "SKIP" : com syntax com ";" com : com syntax "(" com ")" : com syntax term : com syntax "[Com|" com "]" : term macro_rules | `([Com| SKIP]) => `(Com.Skip) | `([Com| $x ; $y]) => `(Com.Seq [Com| $x] [Com| $y]) | `([Com| ( $x:com )]) => `([Com| ... | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Com.lean | Com | null |
BigStep : Com → State → State → Prop where | Skip : BigStep Com.Skip s s | Seq (h1 : BigStep c₁ s t) (h2 : BigStep c₂ t u) : BigStep [Com| c₁;c₂] s u | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Com.lean | BigStep | null |
seq_assoc : BigStep [Com| (c1;c2);c3] s s' ↔ BigStep [Com| c1;c2;c3] s s' := by aesop | theorem | AesopTest | [
"import Aesop"
] | AesopTest/Com.lean | seq_assoc | null |
A where /-- error: tactic 'aesop' failed, made no progress -/ #guard_msgs in | structure | AesopTest | [
"import Aesop"
] | AesopTest/CompositeLocalRuleTerm.lean | A | null |
MyProd (A B : Type _) where toProd : A × B | structure | AesopTest | [
"import Aesop"
] | AesopTest/ConstructorEquations.lean | MyProd | null |
Even : Nat → Type | zero : Even 0 | plusTwo : Even n → Even (n + 2) | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Constructors.lean | Even | null |
T n := Even n /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/Constructors.lean | T | null |
Foo := True /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/CustomTactic.lean | Foo | null |
myTactic : TacticM Unit := do evalTactic $ ← `(tactic| rw [Foo]) | def | AesopTest | [
"import Aesop"
] | AesopTest/CustomTactic.lean | myTactic | /--
error: tactic 'aesop' failed, failed to prove the goal after exhaustive search.
-/ |
T := True /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import AesopTest.DefaultRuleSetsInit"
] | AesopTest/DefaultRuleSets.lean | T | null |
U := True /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import AesopTest.DefaultRuleSetsInit"
] | AesopTest/DefaultRuleSets.lean | U | /--
error: tactic 'aesop' failed, failed to prove the goal after exhaustive search.
-/ |
Ex (α : Sort u) (β : α → Prop) : Prop | intro (fst : α) (snd : β fst) @[aesop safe constructors] | inductive | AesopTest | [
"import Aesop"
] | AesopTest/DestructProducts.lean | Ex | null |
Sig (α : Sort u) (β : α → Sort v) : Sort _ where fst : α snd : β fst | structure | AesopTest | [
"import Aesop"
] | AesopTest/DestructProducts.lean | Sig | null |
Sig (α : Sort u) (β : α → Sort v) : Sort _ where fst : α snd : β fst | structure | AesopTest | [
"import Aesop"
] | AesopTest/DestructProductsTransparency.lean | Sig | null |
T α β := α ∧ β /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/DestructProductsTransparency.lean | T | null |
U := T /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/DestructProductsTransparency.lean | U | /--
error: tactic 'aesop' failed, failed to prove the goal after exhaustive search.
-/ |
MyList (α : Type _) | nil | cons (hd : α) (tl : MyList α) namespace MyList | inductive | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | MyList | null |
append : (_ _ : MyList α) → MyList α | nil, ys => ys | cons x xs, ys => cons x (MyList.append xs ys) | def | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | append | null |
nil_append : nil ++ xs = xs := rfl @[simp] | theorem | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | nil_append | null |
cons_append : cons x xs ++ ys = cons x (xs ++ ys) := rfl @[aesop safe [constructors, cases]] | theorem | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | cons_append | null |
NonEmpty : MyList α → Prop | cons : NonEmpty (cons x xs) @[aesop 50%] | inductive | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | NonEmpty | null |
nonEmpty_append₁ {xs : MyList α} ys : NonEmpty xs → NonEmpty (xs ++ ys) := by aesop /-- info: Try this: [apply] intro a obtain @⟨x, xs_1⟩ := a simp_all only [cons_append] apply MyList.NonEmpty.cons -/ #guard_msgs in | theorem | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | nonEmpty_append₁ | null |
nonEmpty_append₁' {xs : MyList α} ys : NonEmpty xs → NonEmpty (xs ++ ys) := by aesop? | theorem | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | nonEmpty_append₁' | /--
info: Try this:
[apply] intro a
obtain @⟨x, xs_1⟩ := a
simp_all only [cons_append]
apply MyList.NonEmpty.cons
-/ |
nil_not_nonEmpty (xs : MyList α) : xs = nil → ¬ NonEmpty xs := by aesop (add unsafe 10% cases MyList) @[simp] | theorem | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | nil_not_nonEmpty | /--
info: Try this:
[apply] intro a
obtain @⟨x, xs_1⟩ := a
simp_all only [cons_append]
apply MyList.NonEmpty.cons
-/ |
append_nil {xs : MyList α} : xs ++ nil = xs := by induction xs <;> aesop | theorem | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | append_nil | /--
info: Try this:
[apply] intro a
obtain @⟨x, xs_1⟩ := a
simp_all only [cons_append]
apply MyList.NonEmpty.cons
-/ |
append_assoc {xs ys zs : MyList α} : (xs ++ ys) ++ zs = xs ++ (ys ++ zs) := by induction xs <;> aesop | theorem | AesopTest | [
"import Aesop"
] | AesopTest/DocLists.lean | append_assoc | null |
Ring : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/DroppedMVars.lean | Ring | null |
RingHom (R S : Ring) : Type @[aesop 99%] | axiom | AesopTest | [
"import Aesop"
] | AesopTest/DroppedMVars.lean | RingHom | null |
RingId (R : Ring) : RingHom R R @[aesop 99%] | axiom | AesopTest | [
"import Aesop"
] | AesopTest/DroppedMVars.lean | RingId | null |
ZZ : Ring | axiom | AesopTest | [
"import Aesop"
] | AesopTest/DroppedMVars.lean | ZZ | null |
T := True /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/EnableUnfold.lean | T | null |
assertEqualTactics (t₁ t₂ : TacticM Unit) : TacticM Unit := do let commonMCtx ← getMCtx let preState ← show MetaM _ from saveState let preGoals ← getGoals let (state₁, goals₁) ← runTacticMCapturingPostState t₁ preState preGoals let (state₂, goals₂) ← runTacticMCapturingPostState t₂ preState preGoals let eq ← tacticStat... | def | AesopTest | [
"import Aesop.Util.Basic",
"import Aesop.Util.EqualUpToIds",
"import Aesop.Tree.RunMetaM"
] | AesopTest/EqualUpToIds.lean | assertEqualTactics | null |
Even : Nat → Prop | zero : Even 0 | plus_two : Even n → Even (n + 2) | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Erase.lean | Even | null |
foo : Nat := 37 /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ #guard_msgs in | def | AesopTest | [
"import Aesop"
] | AesopTest/EraseUnfold.lean | foo | null |
MyProd (α β : Type _) where fst : α snd : β variable {α β γ δ ι: Type} /-- info: Try this: [apply] ext : 1 · sorry · sorry --- warning: declaration uses 'sorry' -/ #guard_msgs in | structure | AesopTest | [
"import Aesop"
] | AesopTest/ExtScript.lean | MyProd | null |
T : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/ExtScript.lean | T | /--
info: Try this:
[apply] ext : 1
· ext x : 1
sorry
· ext x x_1 : 2
sorry
---
warning: declaration uses 'sorry'
-/ |
U : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/ExtScript.lean | U | null |
u : U | axiom | AesopTest | [
"import Aesop"
] | AesopTest/ExtScript.lean | u | null |
v : U @[ext (iff := false)] | axiom | AesopTest | [
"import Aesop"
] | AesopTest/ExtScript.lean | v | null |
T_ext : ∀ x y : T, u = v → (∀ u v : U, u = v) → x = y /-- info: Try this: [apply] ext u v : 1 · sorry · sorry --- warning: declaration uses 'sorry' -/ #guard_msgs in | axiom | AesopTest | [
"import Aesop"
] | AesopTest/ExtScript.lean | T_ext | null |
List (α : Type) where | nil : List α | cons (head : α) (tail : List α) : List α notation (priority := high) "[" "]" => List.nil infixr:67 (priority := high) " :: " => List.cons | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Filter.lean | List | null |
filter (p : α → Prop) [DecidablePred p] (as : List α) : List α := match as with | [] => [] | a::as => if p a then a :: filter p as else filter p as variable {p : α → Prop} [DecidablePred p] {as bs : List α} @[simp] | def | AesopTest | [
"import Aesop"
] | AesopTest/Filter.lean | filter | null |
filter_cons_true (h : p a) : filter p (a :: as) = a :: filter p as := by simp [filter, h] @[simp] | theorem | AesopTest | [
"import Aesop"
] | AesopTest/Filter.lean | filter_cons_true | null |
filter_cons_false (h : ¬ p a) : filter p (a :: as) = filter p as := by simp [filter, h] @[aesop 50% [constructors, cases]] | theorem | AesopTest | [
"import Aesop"
] | AesopTest/Filter.lean | filter_cons_false | null |
Mem (a : α) : List α → Prop where | head {as} : Mem a (a::as) | tail {as} : Mem a as → Mem a (a'::as) infix:50 " ∈ " => Mem | inductive | AesopTest | [
"import Aesop"
] | AesopTest/Filter.lean | Mem | null |
mem_filter : a ∈ filter p as ↔ a ∈ as ∧ p a := by apply Iff.intro case mp => intro h induction as with | nil => cases h | cons a' as ih => by_cases ha' : p a' <;> aesop case mpr => intro h induction as with | nil => cases h.1 | cons a' as ih => cases h.1 with | head => rw [filter_cons_true h.2] constructor | tail ha =>... | theorem | AesopTest | [
"import Aesop"
] | AesopTest/Filter.lean | mem_filter | null |
A : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | A | /--
info: Try this:
[apply] have fwd : β := h₁ h₄
have fwd_1 : γ := h₂ h₄
---
error: unsolved goals
α β γ δ : Prop
h₁ : α → β
h₂ : α → γ
h₃ : β → γ → δ
h₄ : α
fwd : β
fwd_1 : γ
⊢ δ
-/ |
B : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | B | /--
info: Try this:
[apply] have fwd : β := h₁ h₄
have fwd_1 : γ := h₂ h₄
---
error: unsolved goals
α β γ δ : Prop
h₁ : α → β
h₂ : α → γ
h₃ : β → γ → δ
h₄ : α
fwd : β
fwd_1 : γ
⊢ δ
-/ |
C : Type @[local aesop safe forward] | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | C | /--
info: Try this:
[apply] have fwd : β := h₁ h₄
have fwd_1 : γ := h₂ h₄
---
error: unsolved goals
α β γ δ : Prop
h₁ : α → β
h₂ : α → γ
h₃ : β → γ → δ
h₄ : α
fwd : β
fwd_1 : γ
⊢ δ
-/ |
ab : A → B @[local aesop norm forward] | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | ab | null |
bc : B → C /-- info: Try this: [apply] have fwd : P := rule P (Q ∧ R) h -/ #guard_msgs in | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | bc | null |
α : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | α | /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ |
β : Type | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | β | /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ |
γ₁ : Prop | axiom | AesopTest | [
"import Aesop"
] | AesopTest/Forward.lean | γ₁ | /-- error: tactic 'aesop' failed, failed to prove the goal after exhaustive search. -/ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.