set f = proj (1,3);
A1: for x being object st x in REAL holds
ex u being object st
( u in REAL 3 & x = (proj (1,3)) . u )

proof

let x be object ; :: thesis: ( x in REAL implies ex u being object st
( u in REAL 3 & x = (proj (1,3)) . u ) )
assume x in REAL ; :: thesis: ex u being object st
( u in REAL 3 & x = (proj (1,3)) . u )
then reconsider x1 = x as Element of REAL ;
set y = the Element of REAL ;
reconsider u = <*x1, the Element of REAL , the Element of REAL *> as Element of REAL 3 by FINSEQ_2:104;
(proj (1,3)) . u = u . 1 by PDIFF_1:def 1;
then (proj (1,3)) . u = x ;
hence ex u being object st
( u in REAL 3 & x = (proj (1,3)) . u ) ; :: thesis: verum

end;

now :: thesis: for x, y, z being Real holds (proj (1,3)) . <*x,y,z*> = x

let x, y, z be Real; :: thesis: (proj (1,3)) . <*x,y,z*> = x
reconsider xx = x, yy = y, zz = z as Element of REAL by XREAL_0:def 1;
<*xx,yy,zz*> is Element of 3 -tuples_on REAL by FINSEQ_2:104;
then (proj (1,3)) . <*x,y,z*> = <*x,y,z*> . 1 by PDIFF_1:def 1;
hence (proj (1,3)) . <*x,y,z*> = x ; :: thesis: verum

end;

hence ( dom (proj (1,3)) = REAL 3 & rng (proj (1,3)) = REAL & ( for x, y, z being Real holds (proj (1,3)) . <*x,y,z*> = x ) ) by A1, FUNCT_2:10, FUNCT_2:def 1; :: thesis: verum