author | wenzelm |
Wed, 14 Nov 2001 18:46:30 +0100 | |
changeset 12183 | c10cea75dd56 |
parent 12175 | 5cf58a1799a7 |
child 12552 | d2d2ab3f1f37 |
permissions | -rw-r--r-- |
12175 | 1 |
(* Title: ZF/ROOT.ML |
6
8ce8c4d13d4d
Installation of new simplifier for ZF. Deleted all congruence rules not
lcp
parents:
5
diff
changeset
|
2 |
ID: $Id$ |
1461 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
0 | 4 |
Copyright 1993 University of Cambridge |
5 |
||
12175 | 6 |
Zermelo-Fraenkel Set Theory on top of classical First-Order Logic. |
7 |
This theory is the work of Martin Coen, Philippe Noel and Lawrence |
|
8 |
Paulson. |
|
0 | 9 |
*) |
10 |
||
11 |
val banner = "ZF Set Theory (in FOL)"; |
|
12 |
writeln banner; |
|
13 |
||
12175 | 14 |
reset eta_contract; |
2469 | 15 |
|
0 | 16 |
print_depth 1; |
17 |
||
12175 | 18 |
(*syntax for old-style theory sections*) |
19 |
use "thy_syntax"; |
|
516 | 20 |
|
9548 | 21 |
use "~~/src/Provers/Arith/cancel_numerals.ML"; |
9570
e16e168984e1
installation of cancellation simprocs for the integers
paulson
parents:
9548
diff
changeset
|
22 |
use "~~/src/Provers/Arith/combine_numerals.ML"; |
9548 | 23 |
|
9176
8f975d9c1046
simplified slightly by using dependencies better in theories
paulson
parents:
8812
diff
changeset
|
24 |
with_path "Integ" use_thy "Main"; |
8127
68c6159440f1
new lemmas for Ntree recursor example; more simprules; more lemmas borrowed
paulson
parents:
6349
diff
changeset
|
25 |
simpset_ref() := simpset() setmksimps (map mk_eq o Ord_atomize o gen_all); |
68c6159440f1
new lemmas for Ntree recursor example; more simprules; more lemmas borrowed
paulson
parents:
6349
diff
changeset
|
26 |
|
0 | 27 |
print_depth 8; |
28 |
||
5511 | 29 |
Goal "True"; (*leave subgoal package empty*) |