set V = Funcs (X, the carrier of R);
set V1 = fs_Funcs (X,R);
A1:
for z being object st z in [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):] holds
((ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]) . z in fs_Funcs (X,R)
proof
let z be
object ;
( z in [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):] implies ((ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]) . z in fs_Funcs (X,R) )
assume A2:
z in [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]
;
((ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]) . z in fs_Funcs (X,R)
then consider f,
g being
object such that A3:
(
f in fs_Funcs (
X,
R) &
g in fs_Funcs (
X,
R) )
and A4:
z = [f,g]
by ZFMISC_1:def 2;
reconsider g1 =
g,
f1 =
f as
Element of
Funcs (
X, the
carrier of
R)
by A3;
[f,g] in dom ((ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):])
by FUNCT_2:def 1, A2, A4;
then
((ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]) . z = (ADD (X,R)) . (
f1,
g1)
by A4, FUNCT_1:47;
hence
((ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]) . z in fs_Funcs (
X,
R)
by A3, Lm11;
verum
end;
dom ((ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]) = [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):]
by FUNCT_2:def 1;
hence
(ADD (X,R)) | [:(fs_Funcs (X,R)),(fs_Funcs (X,R)):] is BinOp of (fs_Funcs (X,R))
by A1, FUNCT_2:3; verum