Each of the functions
AXIOMS, DEFNS, SHELLS, LEMMAS, TOGGLES, DEFTHEORIES
takes no arguments, and returns the members of CHRONOLOGY which have
the appropriate form.
EVENTS-APROPOS (stringlist &optional event-type)
Return a list of all events whose names contain every element of
STRINGLIST as a substring.
e.g. (EVENTS-APROPOS '(FOO BAR)) returns a list of the names of
all events which contain both "FOO" and "BAR" as substrings.
(EVENTS-APROPOS 'FOO) returns a list of the names of all
events which contain "FOO" as a substring.
The search can be restricted to a given type of event with the
EVENT-TYPE argument.
INDUCTION-GOALS (hint term)
Here are two examples which show how to use this function.
(INDUCTION-GOALS '(APPEND X Y) '(EQUAL Y X))
returns
((IMPLIES (AND (LISTP X) (EQUAL Y (CDR X))) (EQUAL Y X))
(IMPLIES (NOT (LISTP X)) (EQUAL Y X)))
(INDUCTION-GOALS '(APPEND X x) '(EQUAL Y X))
returns
**NO CHANGE** -- The first argument of INDUCTION-GOALS must have the
form
(INDUCT (fn v1 ... vn)) where fn is a recursively defined function and
the vi
are distinct variables of a number matching the arity of fn.
MATCHING-RULES (term)
Return a list of all lemmas which match TERM, in the sense that
RELIEVE-HYPS may be called from REWRITE-WITH-LEMMAS on each of these
lemmas (if enabled) when simplifying TERM. Could easily be modified
to obtain the corresponding substitutions, by considering the
subsidiary function MATCH-LEMMA.
DEADWOOD ()
Returns the name of every non-TOGGLE event in the current chronology
that doesn't support any other event. Could be useful when building
a library, as long as one is careful to notice that "top-level"
theorems will appear in such a list.
MORE-DEADWOOD (&optional (namelist (deadwood)))
(See also DEADWOOD above.) Returns the name of every non-TOGGLE
event in the current chronology that doesn't belong to NAMELIST and
also doesn't support any event other than (possibly) events in
NAMELIST.