File: CONTR_TAC.doc

package info (click to toggle)
hol-light 20131026-1
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 26,264 kB
  • ctags: 4,620
  • sloc: ml: 400,325; cpp: 438; java: 279; lisp: 261; makefile: 256; sh: 190; yacc: 108; perl: 78; ansic: 57; sed: 39
file content (31 lines) | stat: -rw-r--r-- 604 bytes parent folder | download | duplicates (7)
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
\DOC CONTR_TAC

\TYPE {CONTR_TAC : thm_tactic}

\SYNOPSIS
Solves any goal from contradictory theorem.

\KEYWORDS
tactic, contradiction.

\DESCRIBE
When applied to a contradictory theorem {A' |- F}, and a goal {A ?- t},
the tactic {CONTR_TAC} completely solves the goal. This is an invalid
tactic unless {A'} is a subset of {A}.
{
    A ?- t
   ========  CONTR_TAC (A' |- F)

}

\USES
One quite common pattern is to use a contradictory hypothesis via
{FIRST_ASSUM CONTR_TAC}.

\FAILURE
Fails unless the theorem is contradictory, i.e. has {F} as its conclusion.

\SEEALSO
CCONTR, CONTR, NOT_ELIM.

\ENDDOC