|
1440
|
1 |
(* Title: CLattice.thy
|
|
|
2 |
ID: $Id$
|
|
|
3 |
Author: Markus Wenzel, TU Muenchen
|
|
|
4 |
|
|
|
5 |
Complete lattices are orders with infima and suprema of arbitrary
|
|
|
6 |
subsets.
|
|
|
7 |
|
|
|
8 |
TODO:
|
|
|
9 |
derive some more well-known theorems (e.g. ex_Inf == ex_Sup)
|
|
|
10 |
*)
|
|
|
11 |
|
|
|
12 |
CLattice = Order +
|
|
|
13 |
|
|
|
14 |
axclass
|
|
|
15 |
clattice < order
|
|
|
16 |
ex_Inf "ALL A. EX inf. is_Inf A inf"
|
|
|
17 |
ex_Sup "ALL A. EX sup. is_Sup A sup"
|
|
|
18 |
|
|
|
19 |
consts
|
|
|
20 |
Inf :: "'a::clattice set => 'a"
|
|
|
21 |
Sup :: "'a::clattice set => 'a"
|
|
|
22 |
|
|
|
23 |
defs
|
|
|
24 |
Inf_def "Inf A == @inf. is_Inf A inf"
|
|
|
25 |
Sup_def "Sup A == @sup. is_Sup A sup"
|
|
|
26 |
|
|
|
27 |
end
|