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
33
34
|
\DOC MK_DISJ
\TYPE {MK_DISJ : thm -> thm -> thm}
\SYNOPSIS
Disjoin both sides of two equational theorems.
\DESCRIBE
Given two theorems, each with a Boolean equation as conclusion, {MK_DISJ}
returns the equation resulting from disjoining their respective sides:
{
A |- p <=> p' B |- q <=> q'
----------------------------------- MK_DISJ
A u B |- p \/ q <=> p' \/ q'
}
\FAILURE
Fails unless both input theorems are Boolean equations (iff).
\EXAMPLE
{
# let th1 = ARITH_RULE `1 < x <=> 1 <= x - 1`
and th2 = ARITH_RULE `~(1 < x) <=> x = 0 \/ x = 1`;;
val th1 : thm = |- 1 < x <=> 1 <= x - 1
val th2 : thm = |- ~(1 < x) <=> x = 0 \/ x = 1
# MK_DISJ th1 th2;;
val it : thm = |- 1 < x \/ ~(1 < x) <=> 1 <= x - 1 \/ x = 0 \/ x = 1
}
\SEEALSO
AP_TERM, AP_THM, MK_BINOP, MK_COMB, MK_CONJ, MK_EXISTS, MK_FORALL.
\ENDDOC
|
