equal
deleted
inserted
replaced
141 prems_of : thm -> term list |
141 prems_of : thm -> term list |
142 cprems_of : thm -> cterm list |
142 cprems_of : thm -> cterm list |
143 nprems_of : thm -> int |
143 nprems_of : thm -> int |
144 tpairs_of : thm -> (term*term) list |
144 tpairs_of : thm -> (term*term) list |
145 theory_of_thm : thm -> theory |
145 theory_of_thm : thm -> theory |
146 dest_state : thm * int -> (term*term) list * term list * term * term |
|
147 \end{ttbox} |
146 \end{ttbox} |
148 \begin{ttdescription} |
147 \begin{ttdescription} |
149 \item[\ttindexbold{cprop_of} $thm$] returns the statement of $thm$ as |
148 \item[\ttindexbold{cprop_of} $thm$] returns the statement of $thm$ as |
150 a certified term. |
149 a certified term. |
151 |
150 |
166 of $thm$. |
165 of $thm$. |
167 |
166 |
168 \item[\ttindexbold{theory_of_thm} $thm$] returns the theory associated |
167 \item[\ttindexbold{theory_of_thm} $thm$] returns the theory associated |
169 with $thm$. Note that this does a lookup in Isabelle's global |
168 with $thm$. Note that this does a lookup in Isabelle's global |
170 database of loaded theories. |
169 database of loaded theories. |
171 |
|
172 \item[\ttindexbold{dest_state} $(thm,i)$] |
|
173 decomposes $thm$ as a tuple containing a list of flex-flex constraints, a |
|
174 list of the subgoals~1 to~$i-1$, subgoal~$i$, and the rest of the theorem |
|
175 (this will be an implication if there are more than $i$ subgoals). |
|
176 |
170 |
177 \end{ttdescription} |
171 \end{ttdescription} |
178 |
172 |
179 |
173 |
180 \subsection{*Sort hypotheses} \label{sec:sort-hyps} |
174 \subsection{*Sort hypotheses} \label{sec:sort-hyps} |