Find Lemmas used by simp/auto/clarify
How can I find which lemmas are used by the simp, auto methods, etc? In one concrete case, I have a goal like: lemma "x ∉ dom S ⟹ Something" apply auto and after applying auto I get: ¬ Something ⟹ ∃y. S x = Some y. I would like to find out why the whole goal is reversed like this, so that I can delete the respective rules from the rewriting. I already tried using [[simp_trace_new mode=full]] apply auto and using [[simp_trace]] apply auto, but did not find information about what exactly caused auto to do this transformation.
Using mono attribute in inductive_set
Where is nat base 10 converted to num base 2?
What can one assume, what is worth assuming in Isar?
Introducing type abbreviations in Isabelle
Isabelle won't generate code for my recursive function without a termination proof
Proving a simple lemma about trees in Isabelle
Why can I prove ⟦ ( ∃ x. P ) ∧ ( ∃ x. Q ) ⟧ ⟹ ∃ x. (P ∧ Q)?
What is a Quotient type pattern in Isabelle?
Avoid matching (λx.x)
Program extraction using native integers/words (not bignums) from Isabelle theory
“String of nat” in Isabelle?
From a 'value' to a 'lemma'
Isabelle/Simpl: Calling a Procedure Twice
let-statement with SOME operator
Does Lueng's RegExp library work with Isabelle/ML? Is there another regex lib devs use for Isabelle/ML?
I need binary and hex syntax translations for type num