:: STRUCT_0 semantic presentation

definition
attr a1 is strict;
struct 1-sorted -> ;
aggr 1-sorted(# carrier #) -> 1-sorted ;
sel carrier c1 -> set ;
end;

definition
attr a1 is strict;
struct ZeroStr -> 1-sorted ;
aggr ZeroStr(# carrier, Zero #) -> ZeroStr ;
sel Zero c1 -> Element of the carrier of a1;
end;

definition
let c1 be 1-sorted ;
attr a1 is empty means :Def1: :: STRUCT_0:def 1
the carrier of a1 is empty;
end;

:: deftheorem Def1 defines empty STRUCT_0:def 1 :
for b1 being 1-sorted holds
( b1 is empty iff the carrier of b1 is empty );

registration
cluster non empty 1-sorted ;
existence
not for b1 being 1-sorted holds b1 is empty
proof end;
end;

registration
cluster non empty ZeroStr ;
existence
not for b1 being ZeroStr holds b1 is empty
proof end;
end;

registration
let c1 be non empty 1-sorted ;
cluster the carrier of a1 -> non empty ;
coherence
not the carrier of c1 is empty
by Def1;
end;

definition
let c1 be 1-sorted ;
mode Element is Element of the carrier of a1;
mode Subset is Subset of the carrier of a1;
mode Subset-Family is Subset-Family of the carrier of a1;
end;

registration
let c1 be non empty 1-sorted ;
cluster non empty Element of K10(the carrier of a1);
existence
not for b1 being Subset of c1 holds b1 is empty
proof end;
end;

definition
let c1 be non empty 1-sorted ;
let c2 be non empty Subset of c1;
redefine mode Element as Element of c2 -> Element of a1;
coherence
for b1 being Element of c2 holds b1 is Element of c1
proof end;
end;

definition
let c1 be 1-sorted ;
let c2 be set ;
mode Function is Function of the carrier of a1,a2;
mode Function is Function of a2,the carrier of a1;
end;

definition
let c1, c2 be 1-sorted ;
mode Function is Function of the carrier of a1,the carrier of a2;
end;

definition
let c1 be 1-sorted ;
mode FinSequence is FinSequence of the carrier of a1;
end;

definition
let c1 be 1-sorted ;
mode ManySortedSet is ManySortedSet of the carrier of a1;
end;