let A be Ordinal; :: thesis: for f being Sequence st succ A c= dom f holds
(f | (succ A)) /^ A = <%(f . A)%>

let f be Sequence; :: thesis: ( succ A c= dom f implies (f | (succ A)) /^ A = <%(f . A)%> )
assume A1: succ A c= dom f ; :: thesis: (f | (succ A)) /^ A = <%(f . A)%>
set fsA = f | (succ A);
dom (f | (succ A)) = succ A by A1, RELAT_1:62;
then A2: dom ((f | (succ A)) /^ A) = (succ A) -^ A by Def1
.= (A +^ 1) -^ A by ORDINAL2:31
.= 1 by ORDINAL3:52 ;
A +^ 0 = A by ORDINAL2:27;
then ((f | (succ A)) /^ A) . 0 = (f | (succ A)) . A by Th8
.= f . A by ORDINAL1:6, FUNCT_1:49 ;
hence (f | (succ A)) /^ A = <%(f . A)%> by A2, AFINSQ_1:def 4; :: thesis: verum