defpred S1[ Nat, set , set ] means ( $2 is PartFunc of (product S),(Partdiff_SP (S,T,I,$1)) implies ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,$1)) st
( $2 = g & $3 = g `partial| (Z,(I . ($1 + 1))) ) );
A1: for n being Nat st 1 <= n & n < len I holds
for x being set ex y being set st S1[n,x,y]
proof
let n be Nat; :: thesis: ( 1 <= n & n < len I implies for x being set ex y being set st S1[n,x,y] )
assume ( 1 <= n & n < len I ) ; :: thesis: for x being set ex y being set st S1[n,x,y]
let x be set ; :: thesis: ex y being set st S1[n,x,y]
( x is PartFunc of (product S),(Partdiff_SP (S,T,I,n)) implies ex y being set ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,n)) st
( x = g & y = g `partial| (Z,(I . (n + 1))) ) )
proof
assume x is PartFunc of (product S),(Partdiff_SP (S,T,I,n)) ; :: thesis: ex y being set ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,n)) st
( x = g & y = g `partial| (Z,(I . (n + 1))) )

then reconsider g = x as PartFunc of (product S),(Partdiff_SP (S,T,I,n)) ;
take y = g `partial| (Z,(I . (n + 1))); :: thesis: ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,n)) st
( x = g & y = g `partial| (Z,(I . (n + 1))) )

thus ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,n)) st
( x = g & y = g `partial| (Z,(I . (n + 1))) ) ; :: thesis: verum
end;
hence ex y being set st S1[n,x,y] ; :: thesis: verum
end;
consider p being FinSequence such that
A2: ( len p = len I & ( p . 1 = f `partial| (Z,(I . 1)) or len I = 0 ) & ( for n being Nat st 1 <= n & n < len I holds
S1[n,p . n,p . (n + 1)] ) ) from RECDEF_1:sch 3(A1);
defpred S2[ Nat] means ( 1 <= $1 & $1 <= len I implies p . $1 is PartFunc of (product S),(Partdiff_SP (S,T,I,$1)) );
A4: S2[ 0 ] ;
A5: for i being Nat st S2[i] holds
S2[i + 1]
proof
let i be Nat; :: thesis: ( S2[i] implies S2[i + 1] )
assume A6: S2[i] ; :: thesis: S2[i + 1]
assume A7: ( 1 <= i + 1 & i + 1 <= len I ) ; :: thesis: p . (i + 1) is PartFunc of (product S),(Partdiff_SP (S,T,I,(i + 1)))
per cases ( i = 0 or i <> 0 ) ;
suppose A8: i = 0 ; :: thesis: p . (i + 1) is PartFunc of (product S),(Partdiff_SP (S,T,I,(i + 1)))
Partdiff_SP (S,T,I,(i + 1)) = (Partdiff_SP (S,T,I)) . (i + 1) by A7, Def4
.= R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . 1),(dom S)))),T) by A8, Def3 ;
hence p . (i + 1) is PartFunc of (product S),(Partdiff_SP (S,T,I,(i + 1))) by A2, A8; :: thesis: verum
end;
suppose A9: i <> 0 ; :: thesis: p . (i + 1) is PartFunc of (product S),(Partdiff_SP (S,T,I,(i + 1)))
then A10: 1 <= i by NAT_1:14;
i < i + 1 by NAT_1:19;
then A11: i < len I by A7, XXREAL_0:2;
then consider g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) such that
A12: ( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) ) by A2, A6, A9, NAT_1:14;
A13: (Partdiff_SP (S,T,I)) . i = Partdiff_SP (S,T,I,i) by A10, A11, Def4;
Partdiff_SP (S,T,I,(i + 1)) = (Partdiff_SP (S,T,I)) . (i + 1) by A7, Def4
.= R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . (i + 1)),(dom S)))),(modetrans ((Partdiff_SP (S,T,I)) . i))) by A9, A11, Def3, NAT_1:14
.= R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . (i + 1)),(dom S)))),(Partdiff_SP (S,T,I,i))) by A13, NDIFF_6:def 1 ;
hence p . (i + 1) is PartFunc of (product S),(Partdiff_SP (S,T,I,(i + 1))) by A12; :: thesis: verum
end;
end;
end;
A14: for i being Nat holds S2[i] from NAT_1:sch 2(A4, A5);
A15: for i being Nat st 1 <= i & i < len I holds
ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) )
proof
let i be Nat; :: thesis: ( 1 <= i & i < len I implies ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) ) )

assume A16: ( 1 <= i & i < len I ) ; :: thesis: ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) )

then p . i is PartFunc of (product S),(Partdiff_SP (S,T,I,i)) by A14;
hence ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) ) by A2, A16; :: thesis: verum
end;
take p ; :: thesis: ( dom p = dom I & p . 1 = f `partial| (Z,(I . 1)) & ( for i being Nat st 1 <= i & i < len I holds
ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) ) ) )

thus dom p = dom I by A2, FINSEQ_3:29; :: thesis: ( p . 1 = f `partial| (Z,(I . 1)) & ( for i being Nat st 1 <= i & i < len I holds
ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) ) ) )

thus p . 1 = f `partial| (Z,(I . 1)) by A2; :: thesis: for i being Nat st 1 <= i & i < len I holds
ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) )

thus for i being Nat st 1 <= i & i < len I holds
ex g being PartFunc of (product S),(Partdiff_SP (S,T,I,i)) st
( p . i = g & p . (i + 1) = g `partial| (Z,(I . (i + 1))) ) by A15; :: thesis: verum