:: CLOSURE2 semantic presentation

notation

let I be set ;
let A, B be ManySortedSet of I;
synonym A in' B for A in B;

end;

notation

let I be set ;
let A, B be ManySortedSet of I;
synonym A c=' B for A c= B;

end;

theorem :: CLOSURE2:1

for M being non empty set
for X, Y being Element of M st X c= Y holds
(id M) . X c= (id M) . Y

proof end;

theorem :: CLOSURE2:2

canceled;

theorem Th3: :: CLOSURE2:3

for I being non empty set
for A being ManySortedSet of I
for B being ManySortedSubset of A holds rng B c= union (rng (bool A))

proof end;

registration

cluster empty -> functional set ;
coherence

proof end;

end;

registration

cluster empty functional set ;
existence

proof end;

end;

registration

let f, g be Function;
cluster {f,g} -> functional ;
coherence

proof end;

end;

definition

let I be set ;
let M be ManySortedSet of I;
defpred S₁[ set ] means $1 is ManySortedSubset of M;
func Bool M -> set means :Def1: :: CLOSURE2:def 1
for x being set holds
( x in it iff x is ManySortedSubset of M );
existence

proof end;

uniqueness

proof end;

end;

:: deftheorem Def1 defines Bool CLOSURE2:def 1 :

registration

let I be set ;
let M be ManySortedSet of I;
cluster Bool M -> non empty functional with_common_domain ;
coherence

proof end;

end;

definition

let I be set ;
let M be ManySortedSet of I;
mode SubsetFamily of M is Subset of (Bool M);

end;

definition

let I be set ;
let M be ManySortedSet of I;
:: original: Bool
redefine func Bool M -> SubsetFamily of M;
coherence

proof end;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster non empty functional with_common_domain Element of bool (Bool M);
existence

proof end;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster empty finite Element of bool (Bool M);
existence

proof end;

end;

definition

let I be set ;
let M be ManySortedSet of I;
let S be non empty SubsetFamily of M;
:: original: Element
redefine mode Element of S -> ManySortedSubset of M;
coherence

proof end;

end;

theorem Th4: :: CLOSURE2:4

for I being set
for M being ManySortedSet of I
for SF, SG being SubsetFamily of M holds SF \/ SG is SubsetFamily of M ;

theorem :: CLOSURE2:5

for I being set
for M being ManySortedSet of I
for SF, SG being SubsetFamily of M holds SF /\ SG is SubsetFamily of M ;

theorem :: CLOSURE2:6

for I, x being set
for M being ManySortedSet of I
for SF being SubsetFamily of M holds SF \ x is SubsetFamily of M

proof end;

theorem :: CLOSURE2:7

for I being set
for M being ManySortedSet of I
for SF, SG being SubsetFamily of M holds SF \+\ SG is SubsetFamily of M ;

theorem Th8: :: CLOSURE2:8

for I being set
for A, M being ManySortedSet of I st A c= M holds
{A} is SubsetFamily of M

proof end;

theorem Th9: :: CLOSURE2:9

for I being set
for A, M, B being ManySortedSet of I st A c= M & B c= M holds
{A,B} is SubsetFamily of M

proof end;

theorem Th10: :: CLOSURE2:10

for I being set
for M being ManySortedSet of I
for E, T being Element of Bool M holds E /\ T in Bool M

proof end;

theorem Th11: :: CLOSURE2:11

for I being set
for M being ManySortedSet of I
for E, T being Element of Bool M holds E \/ T in Bool M

proof end;

theorem :: CLOSURE2:12

for I being set
for A, M being ManySortedSet of I
for E being Element of Bool M holds E \ A in Bool M

proof end;

theorem :: CLOSURE2:13

for I being set
for M being ManySortedSet of I
for E, T being Element of Bool M holds E \+\ T in Bool M

proof end;

definition

let S be functional set ;
canceled;
func |.S.| -> Function means :Def3: :: CLOSURE2:def 3
ex A being non empty functional set st
( A = S & dom it = meet { (dom x) where x is Element of A : verum } & ( for i being set st i in dom it holds
it . i = { (x . i) where x is Element of A : verum } ) ) if S <> {}
otherwise it = {} ;
existence

proof end;

uniqueness

proof end;

consistency ;

end;

:: deftheorem CLOSURE2:def 2 :

:: deftheorem Def3 defines |. CLOSURE2:def 3 :

theorem Th14: :: CLOSURE2:14

for I being set
for M being ManySortedSet of I
for SF being non empty SubsetFamily of M holds dom |.SF.| = I

proof end;

registration

let S be empty functional set ;
cluster |.S.| -> empty functional ;
coherence by Def3;

end;

definition

let I be set ;
let M be ManySortedSet of I;
let S be SubsetFamily of M;
func |:S:| -> ManySortedSet of I equals :Def4: :: CLOSURE2:def 4
|.S.| if S <> {}
otherwise [0] I;
coherence

proof end;

consistency ;

end;

:: deftheorem Def4 defines |: CLOSURE2:def 4 :

registration

let I be set ;
let M be ManySortedSet of I;
let S be empty SubsetFamily of M;
cluster |:S:| -> V4 ;
coherence

proof end;

end;

theorem Th15: :: CLOSURE2:15

for I being set
for M being ManySortedSet of I
for SF being SubsetFamily of M st not SF is empty holds
for i being set st i in I holds
|:SF:| . i = { (x . i) where x is Element of Bool M : x in SF }

proof end;

registration

let I be set ;
let M be ManySortedSet of I;
let SF be non empty SubsetFamily of M;
cluster |:SF:| -> V3 ;
coherence

proof end;

end;

theorem Th16: :: CLOSURE2:16

for f being Function holds dom |.{f}.| = dom f

proof end;

theorem :: CLOSURE2:17

for f, f1 being Function holds dom |.{f,f1}.| = (dom f) /\ (dom f1)

proof end;

theorem Th18: :: CLOSURE2:18

for i being set
for f being Function st i in dom f holds
|.{f}.| . i = {(f . i)}

proof end;

theorem :: CLOSURE2:19

for i, I being set
for M being ManySortedSet of I
for f being Function
for SF being SubsetFamily of M st i in I & SF = {f} holds
|:SF:| . i = {(f . i)}

proof end;

theorem Th20: :: CLOSURE2:20

for i being set
for f, f1 being Function st i in dom |.{f,f1}.| holds
|.{f,f1}.| . i = {(f . i),(f1 . i)}

proof end;

theorem Th21: :: CLOSURE2:21

for i, I being set
for M being ManySortedSet of I
for f, f1 being Function
for SF being SubsetFamily of M st i in I & SF = {f,f1} holds
|:SF:| . i = {(f . i),(f1 . i)}

proof end;

definition

let I be set ;
let M be ManySortedSet of I;
let SF be SubsetFamily of M;
:: original: |:
redefine func |:SF:| -> MSSubsetFamily of M;
coherence

proof end;

end;

theorem Th22: :: CLOSURE2:22

for I being set
for M, A being ManySortedSet of I
for SF being SubsetFamily of M st A in SF holds
A in' |:SF:|

proof end;

theorem Th23: :: CLOSURE2:23

for I being set
for M, A, B being ManySortedSet of I
for SF being SubsetFamily of M st SF = {A,B} holds
union |:SF:| = A \/ B

proof end;

theorem Th24: :: CLOSURE2:24

for I being set
for M being ManySortedSet of I
for SF being SubsetFamily of M
for E, T being Element of Bool M st SF = {E,T} holds
meet |:SF:| = E /\ T

proof end;

theorem Th25: :: CLOSURE2:25

for I being set
for M being ManySortedSet of I
for SF being SubsetFamily of M
for Z being ManySortedSubset of M st ( for Z1 being ManySortedSet of I st Z1 in SF holds
Z c=' Z1 ) holds
Z c=' meet |:SF:|

proof end;

theorem :: CLOSURE2:26

for I being set
for M being ManySortedSet of I holds |:(Bool M):| = bool M

proof end;

definition

let I be set ;
let M be ManySortedSet of I;
let IT be SubsetFamily of M;
attr IT is additive means :: CLOSURE2:def 5
for A, B being ManySortedSet of I st A in IT & B in IT holds
A \/ B in IT;
attr IT is absolutely-additive means :Def6: :: CLOSURE2:def 6
for F being SubsetFamily of M st F c= IT holds
union |:F:| in IT;
attr IT is multiplicative means :: CLOSURE2:def 7
for A, B being ManySortedSet of I st A in IT & B in IT holds
A /\ B in IT;
attr IT is absolutely-multiplicative means :Def8: :: CLOSURE2:def 8
for F being SubsetFamily of M st F c= IT holds
meet |:F:| in IT;
attr IT is properly-upper-bound means :Def9: :: CLOSURE2:def 9
M in IT;
attr IT is properly-lower-bound means :Def10: :: CLOSURE2:def 10
[0] I in IT;

end;

:: deftheorem defines additive CLOSURE2:def 5 :

:: deftheorem Def6 defines absolutely-additive CLOSURE2:def 6 :

:: deftheorem defines multiplicative CLOSURE2:def 7 :

:: deftheorem Def8 defines absolutely-multiplicative CLOSURE2:def 8 :

:: deftheorem Def9 defines properly-upper-bound CLOSURE2:def 9 :

:: deftheorem Def10 defines properly-lower-bound CLOSURE2:def 10 :

Lm1: for I being set
for M being ManySortedSet of I holds
( Bool M is additive & Bool M is absolutely-additive & Bool M is multiplicative & Bool M is absolutely-multiplicative & Bool M is properly-upper-bound & Bool M is properly-lower-bound )

proof end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster non empty functional with_common_domain additive absolutely-additive multiplicative absolutely-multiplicative properly-upper-bound properly-lower-bound Element of bool (Bool M);
existence

proof end;

end;

definition

let I be set ;
let M be ManySortedSet of I;
:: original: Bool
redefine func Bool M -> additive absolutely-additive multiplicative absolutely-multiplicative properly-upper-bound properly-lower-bound SubsetFamily of M;
coherence by Lm1;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster absolutely-additive -> additive Element of bool (Bool M);
coherence

proof end;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster absolutely-multiplicative -> multiplicative Element of bool (Bool M);
coherence

proof end;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster absolutely-multiplicative -> properly-upper-bound Element of bool (Bool M);
coherence

proof end;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster properly-upper-bound -> non empty Element of bool (Bool M);
coherence by Def9;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster absolutely-additive -> properly-lower-bound Element of bool (Bool M);
coherence

proof end;

end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster properly-lower-bound -> non empty Element of bool (Bool M);
coherence by Def10;

end;

definition

let I be set ;
let M be ManySortedSet of I;
mode SetOp of M is Function of Bool M, Bool M;

end;

definition

let I be set ;
let M be ManySortedSet of I;
let f be SetOp of M;
let x be Element of Bool M;
:: original: .
redefine func f . x -> Element of Bool M;
coherence

proof end;

end;

definition

let I be set ;
let M be ManySortedSet of I;
let IT be SetOp of M;
canceled;
attr IT is reflexive means :Def12: :: CLOSURE2:def 12
for x being Element of Bool M holds x c=' IT . x;
attr IT is monotonic means :Def13: :: CLOSURE2:def 13
for x, y being Element of Bool M st x c=' y holds
IT . x c=' IT . y;
attr IT is idempotent means :Def14: :: CLOSURE2:def 14
for x being Element of Bool M holds IT . x = IT . (IT . x);
attr IT is topological means :Def15: :: CLOSURE2:def 15
for x, y being Element of Bool M holds IT . (x \/ y) = (IT . x) \/ (IT . y);

end;

:: deftheorem CLOSURE2:def 11 :

:: deftheorem Def12 defines reflexive CLOSURE2:def 12 :

:: deftheorem Def13 defines monotonic CLOSURE2:def 13 :

:: deftheorem Def14 defines idempotent CLOSURE2:def 14 :

:: deftheorem Def15 defines topological CLOSURE2:def 15 :

registration

let I be set ;
let M be ManySortedSet of I;
cluster reflexive monotonic idempotent topological M4( Bool M, Bool M);
existence

proof end;

end;

theorem :: CLOSURE2:27

for I being set
for A being ManySortedSet of I holds id (Bool A) is reflexive SetOp of A

proof end;

theorem :: CLOSURE2:28

for I being set
for A being ManySortedSet of I holds id (Bool A) is monotonic SetOp of A

proof end;

theorem :: CLOSURE2:29

for I being set
for A being ManySortedSet of I holds id (Bool A) is idempotent SetOp of A

proof end;

theorem :: CLOSURE2:30

for I being set
for A being ManySortedSet of I holds id (Bool A) is topological SetOp of A

proof end;

theorem :: CLOSURE2:31

for I being set
for M being ManySortedSet of I
for E being Element of Bool M
for g being SetOp of M st E = M & g is reflexive holds
E = g . E

proof end;

theorem :: CLOSURE2:32

for I being set
for M being ManySortedSet of I
for g being SetOp of M st g is reflexive & ( for X being Element of Bool M holds g . X c= X ) holds
g is idempotent

proof end;

theorem :: CLOSURE2:33

for I being set
for M being ManySortedSet of I
for E, T being Element of Bool M
for g being SetOp of M
for A being Element of Bool M st A = E /\ T & g is monotonic holds
g . A c= (g . E) /\ (g . T)

proof end;

registration

let I be set ;
let M be ManySortedSet of I;
cluster topological -> monotonic M4( Bool M, Bool M);
coherence

proof end;

end;

theorem :: CLOSURE2:34

for I being set
for M being ManySortedSet of I
for E, T being Element of Bool M
for g being SetOp of M
for A being Element of Bool M st A = E \ T & g is topological holds
(g . E) \ (g . T) c= g . A

proof end;

definition

let I be set ;
let M be ManySortedSet of I;
let h, g be SetOp of M;
:: original: *
redefine func g * h -> SetOp of M;
coherence

proof end;

end;

theorem :: CLOSURE2:35

for I being set
for M being ManySortedSet of I
for g, h being SetOp of M st g is reflexive & h is reflexive holds
g * h is reflexive

proof end;

theorem :: CLOSURE2:36

for I being set
for M being ManySortedSet of I
for g, h being SetOp of M st g is monotonic & h is monotonic holds
g * h is monotonic

proof end;

theorem :: CLOSURE2:37

for I being set
for M being ManySortedSet of I
for g, h being SetOp of M st g is idempotent & h is idempotent & g * h = h * g holds
g * h is idempotent

proof end;

theorem :: CLOSURE2:38

for I being set
for M being ManySortedSet of I
for g, h being SetOp of M st g is topological & h is topological holds
g * h is topological

proof end;

definition

let S be 1-sorted ;
attr c₂ is strict;
struct ClosureStr of S -> many-sorted of S;
aggr ClosureStr(# Sorts, Family #) -> ClosureStr of S;
sel Family c₂ -> SubsetFamily of the Sorts of c₂;

end;

definition

let S be 1-sorted ;
let IT be ClosureStr of S;
attr IT is additive means :Def16: :: CLOSURE2:def 16
the Family of IT is additive;
attr IT is absolutely-additive means :Def17: :: CLOSURE2:def 17
the Family of IT is absolutely-additive;
attr IT is multiplicative means :Def18: :: CLOSURE2:def 18
the Family of IT is multiplicative;
attr IT is absolutely-multiplicative means :Def19: :: CLOSURE2:def 19
the Family of IT is absolutely-multiplicative;
attr IT is properly-upper-bound means :Def20: :: CLOSURE2:def 20
the Family of IT is properly-upper-bound;
attr IT is properly-lower-bound means :Def21: :: CLOSURE2:def 21
the Family of IT is properly-lower-bound;

end;

:: deftheorem Def16 defines additive CLOSURE2:def 16 :

:: deftheorem Def17 defines absolutely-additive CLOSURE2:def 17 :

:: deftheorem Def18 defines multiplicative CLOSURE2:def 18 :

:: deftheorem Def19 defines absolutely-multiplicative CLOSURE2:def 19 :

:: deftheorem Def20 defines properly-upper-bound CLOSURE2:def 20 :

:: deftheorem Def21 defines properly-lower-bound CLOSURE2:def 21 :

definition

let S be 1-sorted ;
let MS be many-sorted of S;
func Full MS -> ClosureStr of S equals :: CLOSURE2:def 22
ClosureStr(# the Sorts of MS,(Bool the Sorts of MS) #);
correctness ;

end;

:: deftheorem defines Full CLOSURE2:def 22 :

registration

let S be 1-sorted ;
let MS be many-sorted of S;
cluster Full MS -> strict additive absolutely-additive multiplicative absolutely-multiplicative properly-upper-bound properly-lower-bound ;
coherence

proof end;

end;

registration

let S be 1-sorted ;
let MS be non-empty many-sorted of S;
cluster Full MS -> non-empty strict additive absolutely-additive multiplicative absolutely-multiplicative properly-upper-bound properly-lower-bound ;
coherence by MSUALG_1:def 8;

end;

registration

let S be 1-sorted ;
cluster non-empty strict additive absolutely-additive multiplicative absolutely-multiplicative properly-upper-bound properly-lower-bound ClosureStr of S;
existence

proof end;

end;

registration

let S be 1-sorted ;
let CS be additive ClosureStr of S;
cluster the Family of CS -> additive ;
coherence by Def16;

end;

registration

let S be 1-sorted ;
let CS be absolutely-additive ClosureStr of S;
cluster the Family of CS -> non empty additive absolutely-additive properly-lower-bound ;
coherence by Def17;

end;

registration

let S be 1-sorted ;
let CS be multiplicative ClosureStr of S;
cluster the Family of CS -> multiplicative ;
coherence by Def18;

end;

registration

let S be 1-sorted ;
let CS be absolutely-multiplicative ClosureStr of S;
cluster the Family of CS -> non empty multiplicative absolutely-multiplicative properly-upper-bound ;
coherence by Def19;

end;

registration

let S be 1-sorted ;
let CS be properly-upper-bound ClosureStr of S;
cluster the Family of CS -> non empty properly-upper-bound ;
coherence by Def20;

end;

registration

let S be 1-sorted ;
let CS be properly-lower-bound ClosureStr of S;
cluster the Family of CS -> non empty properly-lower-bound ;
coherence by Def21;

end;

registration

let S be 1-sorted ;
let M be V3 ManySortedSet of the carrier of S;
let F be SubsetFamily of M;
cluster ClosureStr(# M,F #) -> non-empty ;
coherence

proof end;

end;

registration

let S be 1-sorted ;
let MS be many-sorted of S;
let F be additive SubsetFamily of the Sorts of MS;
cluster ClosureStr(# the Sorts of MS,F #) -> additive ;
coherence by Def16;

end;

registration

let S be 1-sorted ;
let MS be many-sorted of S;
let F be absolutely-additive SubsetFamily of the Sorts of MS;
cluster ClosureStr(# the Sorts of MS,F #) -> additive absolutely-additive ;
coherence by Def17;

end;

registration

let S be 1-sorted ;
let MS be many-sorted of S;
let F be multiplicative SubsetFamily of the Sorts of MS;
cluster ClosureStr(# the Sorts of MS,F #) -> multiplicative ;
coherence by Def18;

end;

registration

let S be 1-sorted ;
let MS be many-sorted of S;
let F be absolutely-multiplicative SubsetFamily of the Sorts of MS;
cluster ClosureStr(# the Sorts of MS,F #) -> multiplicative absolutely-multiplicative ;
coherence by Def19;

end;

registration

let S be 1-sorted ;
let MS be many-sorted of S;
let F be properly-upper-bound SubsetFamily of the Sorts of MS;
cluster ClosureStr(# the Sorts of MS,F #) -> properly-upper-bound ;
coherence by Def20;

end;

registration

let S be 1-sorted ;
let MS be many-sorted of S;
let F be properly-lower-bound SubsetFamily of the Sorts of MS;
cluster ClosureStr(# the Sorts of MS,F #) -> properly-lower-bound ;
coherence by Def21;

end;

registration

let S be 1-sorted ;
cluster absolutely-additive -> additive ClosureStr of S;
coherence

proof end;

end;

registration

let S be 1-sorted ;
cluster absolutely-multiplicative -> multiplicative ClosureStr of S;
coherence

proof end;

end;

registration

let S be 1-sorted ;
cluster absolutely-multiplicative -> properly-upper-bound ClosureStr of S;
coherence

proof end;

end;

registration

let S be 1-sorted ;
cluster absolutely-additive -> properly-lower-bound ClosureStr of S;
coherence

proof end;

end;

definition

let S be 1-sorted ;
mode ClosureSystem of S is absolutely-multiplicative ClosureStr of S;

end;

definition

let I be set ;
let M be ManySortedSet of I;
mode ClosureOperator of M is reflexive monotonic idempotent SetOp of M;

end;

theorem Th39: :: CLOSURE2:39

for S being 1-sorted
for A being ManySortedSet of the carrier of S
for f being reflexive monotonic SetOp of A
for D being SubsetFamily of A st D = { x where x is Element of Bool A : f . x = x } holds
ClosureStr(# A,D #) is ClosureSystem of S

proof end;

definition

let S be 1-sorted ;
let A be ManySortedSet of the carrier of S;
let g be ClosureOperator of A;
func ClOp->ClSys g -> strict ClosureSystem of S means :Def23: :: CLOSURE2:def 23
( the Sorts of it = A & the Family of it = { x where x is Element of Bool A : g . x = x } );
existence

proof end;

uniqueness ;

end;

:: deftheorem Def23 defines ClOp->ClSys CLOSURE2:def 23 :

definition

let S be 1-sorted ;
let A be ClosureSystem of S;
let C be ManySortedSubset of the Sorts of A;
func Cl C -> Element of Bool the Sorts of A means :Def24: :: CLOSURE2:def 24
ex F being SubsetFamily of the Sorts of A st
( it = meet |:F:| & F = { X where X is Element of Bool the Sorts of A : ( C c=' X & X in the Family of A ) } );
existence

proof end;

uniqueness ;

end;

:: deftheorem Def24 defines Cl CLOSURE2:def 24 :

theorem Th40: :: CLOSURE2:40

for S being 1-sorted
for D being ClosureSystem of S
for a being Element of Bool the Sorts of D
for f being SetOp of the Sorts of D st a in the Family of D & ( for x being Element of Bool the Sorts of D holds f . x = Cl x ) holds
f . a = a

proof end;

theorem :: CLOSURE2:41

for S being 1-sorted
for D being ClosureSystem of S
for a being Element of Bool the Sorts of D
for f being SetOp of the Sorts of D st f . a = a & ( for x being Element of Bool the Sorts of D holds f . x = Cl x ) holds
a in the Family of D

proof end;

theorem Th42: :: CLOSURE2:42

for S being 1-sorted
for D being ClosureSystem of S
for f being SetOp of the Sorts of D st ( for x being Element of Bool the Sorts of D holds f . x = Cl x ) holds
( f is reflexive & f is monotonic & f is idempotent )

proof end;

definition

let S be 1-sorted ;
let D be ClosureSystem of S;
func ClSys->ClOp D -> ClosureOperator of the Sorts of D means :Def25: :: CLOSURE2:def 25
for x being Element of Bool the Sorts of D holds it . x = Cl x;
existence

proof end;

uniqueness

proof end;

end;

:: deftheorem Def25 defines ClSys->ClOp CLOSURE2:def 25 :

theorem :: CLOSURE2:43

for S being 1-sorted
for A being ManySortedSet of the carrier of S
for f being ClosureOperator of A holds ClSys->ClOp (ClOp->ClSys f) = f

proof end;

deffunc H₁( set ) -> set = $1;

theorem :: CLOSURE2:44

for S being 1-sorted
for D being ClosureSystem of S holds ClOp->ClSys (ClSys->ClOp D) = ClosureStr(# the Sorts of D,the Family of D #)

proof end;