File: sample.ml

package info (click to toggle)
hol-light 20170109-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 36,568 kB
  • ctags: 8,549
  • sloc: ml: 540,018; cpp: 439; lisp: 286; java: 279; makefile: 262; sh: 229; yacc: 108; perl: 78; ansic: 57; sed: 39
file content (19 lines) | stat: -rw-r--r-- 451 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
 
horizon := 1;;

thm `;
let R be num->num->bool;
assume !x. R x x [1];
assume !x y z. R x y /\ R y z ==> R x z [2];
thus (!m n. m <= n ==> R m n) <=> (!n. R n (SUC n))
proof
 now [3] // back direction first
  assume !n. R n (SUC n);
  let m n be num;
  !d. R m (m + d) ==> R m (m + SUC d) [4] by 2,ADD_CLAUSES;
  R m (m + 0) by 1,ADD_CLAUSES;
  !d. R m (m + d) by 4,INDUCT_TAC;
  thus m <= n ==> R m n by LE_EXISTS;
 end;
 !n. n <= SUC n;
qed by 3`;;