File: LIST_CONJ.doc

package info (click to toggle)
hol88 2.02.19940316dfsg-5
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 65,816 kB
  • sloc: ml: 199,939; ansic: 9,666; sh: 6,913; makefile: 6,032; lisp: 2,747; yacc: 894; sed: 201; cpp: 87; awk: 5
file content (32 lines) | stat: -rw-r--r-- 754 bytes parent folder | download | duplicates (11) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
 
\DOC LIST_CONJ

\TYPE {LIST_CONJ : (thm list -> thm)}

\SYNOPSIS
Conjoins the conclusions of a list of theorems.

\KEYWORDS
rule, conjunction.

\DESCRIBE
{
         A1 |- t1 ... An |- tn
   ----------------------------------  LIST_CONJ
    A1 u ... u An |- t1 /\ ... /\ tn
}
\FAILURE
{LIST_CONJ} will fail with {`end_itlist`} if applied to an empty list
of theorems.

\COMMENTS
The system shows the type as {proof}.

{LIST_CONJ} does not check for alpha-equivalence of assumptions when forming
their union. If a particular assumption is duplicated within one of the input
theorems assumption lists, then it may be duplicated in the resulting
assumption list.

\SEEALSO
BODY_CONJUNCTS, CONJ, CONJUNCT1, CONJUNCT2, CONJUNCTS, CONJ_PAIR, CONJ_TAC.

\ENDDOC