5078
|
1 |
(* Title : Lubs.thy
|
|
2 |
Author : Jacques D. Fleuriot
|
|
3 |
Copyright : 1998 University of Cambridge
|
|
4 |
Description : Upper bounds, lubs definitions
|
|
5 |
suggested by James Margetson
|
|
6 |
*)
|
|
7 |
|
|
8 |
|
|
9 |
Lubs = Set +
|
|
10 |
|
|
11 |
consts
|
|
12 |
|
|
13 |
"*<=" :: ['a set, 'a] => bool (infixl 70)
|
|
14 |
"<=*" :: ['a, 'a set] => bool (infixl 70)
|
|
15 |
|
|
16 |
constdefs
|
|
17 |
leastP :: ['a =>bool,'a] => bool
|
|
18 |
"leastP P x == (P x & x <=* Collect P)"
|
|
19 |
|
|
20 |
isLub :: ['a set, 'a set, 'a] => bool
|
|
21 |
"isLub R S x == leastP (isUb R S) x"
|
|
22 |
|
|
23 |
isUb :: ['a set, 'a set, 'a] => bool
|
|
24 |
"isUb R S x == S *<= x & x: R"
|
|
25 |
|
|
26 |
ubs :: ['a set, 'a set] => 'a set
|
|
27 |
"ubs R S == Collect (isUb R S)"
|
|
28 |
|
|
29 |
defs
|
|
30 |
setle_def
|
|
31 |
"S *<= x == (ALL y: S. y <= x)"
|
|
32 |
|
|
33 |
setge_def
|
|
34 |
"x <=* S == (ALL y: S. x <= y)"
|
|
35 |
|
|
36 |
end
|
|
37 |
|
|
38 |
|