diff options
| author | Josh Chen | 2020-08-03 13:34:53 +0200 |
|---|---|---|
| committer | Josh Chen | 2020-08-03 13:34:53 +0200 |
| commit | 710f314a9ccb84cdd9df9bc8bf52482b8d1f5a56 (patch) | |
| tree | abbc3d847e17b9659b11eb8e4e2eda3430ba007a /hott/Identity.thy | |
| parent | 70fd3f72ef8f9cc01a071250d94e8c25ecb04c1d (diff) | |
(FEAT) SIDE_CONDS tactical has additional argument specifying how many initial subgoals to skip applying the side condition solver to.
(FEAT) `intro`, `intros` methods for "logical introduction rules" (as opposed to typechecking `intr` attribute), only works on conclusions with rigid type.
(FEAT) CREPEAT_N bounded repetition tactical, used in `intros n` method.
Diffstat (limited to 'hott/Identity.thy')
| -rw-r--r-- | hott/Identity.thy | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/hott/Identity.thy b/hott/Identity.thy index b9ebafb..b06604f 100644 --- a/hott/Identity.thy +++ b/hott/Identity.thy @@ -54,7 +54,7 @@ section \<open>Path induction\<close> method_setup eq = \<open>Args.term >> (fn tm => K (CONTEXT_METHOD ( - CHEADGOAL o SIDE_CONDS ( + CHEADGOAL o SIDE_CONDS 0 ( CONTEXT_SUBGOAL (fn (goal, i) => fn cst as (ctxt, st) => let val facts = Proof_Context.facts_of ctxt |