:: Basic Notation of Universal Algebra
:: by Jaros{\l}aw Kotowicz, Beata Madras and Ma{\l}gorzata Korolkiewicz
::
:: Received December 29, 1992
:: Copyright (c) 1992-2016 Association of Mizar Users
:: (Stowarzyszenie Uzytkownikow Mizara, Bialystok, Poland).
:: This code can be distributed under the GNU General Public Licence
:: version 3.0 or later, or the Creative Commons Attribution-ShareAlike
:: License version 3.0 or later, subject to the binding interpretation
:: detailed in file COPYING.interpretation.
:: See COPYING.GPL and COPYING.CC-BY-SA for the full text of these
:: licenses, or see http://www.gnu.org/licenses/gpl.html and
:: http://creativecommons.org/licenses/by-sa/3.0/.
environ
vocabularies FINSEQ_1, PARTFUN1, RELAT_1, NAT_1, FUNCT_2, TARSKI, XBOOLE_0,
SUBSET_1, FUNCOP_1, FUNCT_1, STRUCT_0, NUMBERS, INCPROJ, XXREAL_0,
UNIALG_1;
notations TARSKI, XBOOLE_0, SUBSET_1, ORDINAL1, NUMBERS, NAT_1, RELAT_1,
FUNCT_1, CARD_3, FINSEQ_1, FINSEQ_2, FUNCOP_1, STRUCT_0, PARTFUN1,
XXREAL_0, MARGREL1;
constructors PARTFUN1, FUNCOP_1, XXREAL_0, FINSEQ_2, STRUCT_0, CARD_3,
MARGREL1;
registrations ORDINAL1, RELSET_1, PARTFUN1, FUNCOP_1, XXREAL_0, STRUCT_0,
FUNCT_1, FINSEQ_1, MARGREL1;
requirements NUMERALS, BOOLE, SUBSET;
definitions STRUCT_0;
theorems FUNCT_1, PARTFUN1, FINSEQ_1, MARGREL1;
schemes FINSEQ_1;
begin
reserve
n for Nat;
definition
struct (1-sorted) UAStr (# carrier -> set, charact -> PFuncFinSequence of
the carrier #);
end;
registration
cluster non empty strict for UAStr;
existence
proof
set D = the non empty set,c = the PFuncFinSequence of D;
take UAStr (#D,c #);
thus the carrier of UAStr (#D,c #) is non empty;
thus thesis;
end;
end;
registration
let D be non empty set, c be PFuncFinSequence of D;
cluster UAStr (#D,c #) -> non empty;
coherence;
end;
definition
let IT be UAStr;
attr IT is partial means
:Def1:
the charact of IT is homogeneous;
attr IT is quasi_total means
:Def2:
the charact of IT is quasi_total;
attr IT is non-empty means
:Def3:
the charact of IT <> {} & the charact of IT is non-empty;
end;
registration
cluster quasi_total partial non-empty strict non empty for UAStr;
existence
proof
set A = the non empty set;
set a = the Element of A;
reconsider w = <*>A .--> a as Element of PFuncs(A*,A) by MARGREL1:19;
set U1 = UAStr (# A, <*w*> #);
take U1;
A1: the charact of U1 is non-empty & the charact of U1 <> {} by MARGREL1:20;
the charact of U1 is quasi_total & the charact of U1 is homogeneous by
MARGREL1:20;
hence thesis by A1;
end;
end;
registration
let U1 be partial UAStr;
cluster the charact of U1 -> homogeneous;
coherence by Def1;
end;
registration
let U1 be quasi_total UAStr;
cluster the charact of U1 -> quasi_total;
coherence by Def2;
end;
registration
let U1 be non-empty UAStr;
cluster the charact of U1 -> non-empty non empty;
coherence by Def3;
end;
definition
mode Universal_Algebra is quasi_total partial non-empty non empty UAStr;
end;
reserve U1 for partial non-empty non empty UAStr;
theorem Th1:
n in dom the charact of U1 implies (the charact of U1).n is
PartFunc of (the carrier of U1)*,the carrier of U1
proof
set o = the charact of U1;
assume n in dom o;
then
A1: o.n in rng o by FUNCT_1:def 3;
rng o c= PFuncs((the carrier of U1)*, the carrier of U1) by FINSEQ_1:def 4;
hence thesis by A1,PARTFUN1:47;
end;
definition
let U1;
func signature U1 ->FinSequence of NAT means
len it = len the charact of U1
& for n st n in dom it holds for h be homogeneous non empty PartFunc of (the
carrier of U1 )*,the carrier of U1 st h = (the charact of U1).n holds it.n =
arity(h);
existence
proof
defpred P[Nat,set] means for h be homogeneous non empty PartFunc of (the
carrier of U1)*,the carrier of U1 st h = (the charact of U1).$1 holds $2 =
arity(h);
A1: now
let m be Nat;
assume m in Seg len the charact of U1;
then m in dom the charact of U1 by FINSEQ_1:def 3;
then reconsider
H=(the charact of U1).m as homogeneous non empty PartFunc of
(the carrier of U1 )*,the carrier of U1 by Th1;
reconsider n=arity(H) as Element of NAT;
take n;
thus P[m,n];
end;
consider p be FinSequence of NAT such that
A2: dom p = Seg(len the charact of U1) and
A3: for m being Nat st m in Seg(len the charact of U1) holds P[m,p.m]
from FINSEQ_1:sch 5(A1);
take p;
thus len p = len the charact of U1 by A2,FINSEQ_1:def 3;
let n;
assume
A4: n in dom p;
let h be homogeneous non empty PartFunc of (the carrier of U1 )*,the
carrier of U1;
assume h = (the charact of U1).n;
hence thesis by A2,A3,A4;
end;
uniqueness
proof
let x,y be FinSequence of NAT;
assume that
A5: len x = len the charact of U1 and
A6: for n st n in dom x holds for h be homogeneous non empty PartFunc
of (the carrier of U1 )*,the carrier of U1 st h = (the charact of U1).n holds x
.n = arity(h) and
A7: len y = len the charact of U1 and
A8: for n st n in dom y holds for h be homogeneous non empty PartFunc
of (the carrier of U1 )*,the carrier of U1 st h = (the charact of U1).n holds y
.n = arity(h);
now
let m be Nat;
assume 1<=m & m<=len x;
then
A9: m in Seg len x by FINSEQ_1:1;
then m in dom the charact of U1 by A5,FINSEQ_1:def 3;
then reconsider
h=(the charact of U1).m as homogeneous non empty PartFunc of
(the carrier of U1 )*,the carrier of U1 by Th1;
m in dom x by A9,FINSEQ_1:def 3;
then
A10: x.m=arity(h) by A6;
m in dom y by A5,A7,A9,FINSEQ_1:def 3;
hence x.m=y.m by A8,A10;
end;
hence thesis by A5,A7,FINSEQ_1:14;
end;
end;
begin :: Addenda
:: from MSSUBLAT, 2007.05.13, A.T.
registration
let U0 be Universal_Algebra;
cluster the charact of U0 -> Function-yielding;
coherence;
end;