per cases ( i = 1 or i <> 1 ) ;
suppose A2: i = 1 ; :: thesis: (PartDiffSeq (f,Z,I)) . i is PartFunc of (product S),(Partdiff_SP (S,T,I,i))
then A3: (PartDiffSeq (f,Z,I)) . i = f `partial| (Z,(I . i)) by Def6;
Partdiff_SP (S,T,I,i) = (Partdiff_SP (S,T,I)) . i by Def4, A1
.= R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . 1),(dom S)))),T) by Def3, A2 ;
hence (PartDiffSeq (f,Z,I)) . i is PartFunc of (product S),(Partdiff_SP (S,T,I,i)) by A3, A2; :: thesis: verum
end;
suppose i <> 1 ; :: thesis: (PartDiffSeq (f,Z,I)) . i is PartFunc of (product S),(Partdiff_SP (S,T,I,i))
then 1 < i by A1, XXREAL_0:1;
then 1 + 1 <= i by NAT_1:13;
then A4: 2 - 1 <= i - 1 by XREAL_1:9;
then reconsider j = i - 1 as Nat by INT_1:3, ORDINAL1:def 12;
i - 1 < i - 0 by XREAL_1:15;
then A5: j < len I by A1, XXREAL_0:2;
consider g being PartFunc of (product S),(Partdiff_SP (S,T,I,j)) such that
A6: ( (PartDiffSeq (f,Z,I)) . j = g & (PartDiffSeq (f,Z,I)) . (j + 1) = g `partial| (Z,(I . (j + 1))) ) by Def6, A5, A4;
A7: (Partdiff_SP (S,T,I)) . j = Partdiff_SP (S,T,I,j) by Def4, A4, A5;
Partdiff_SP (S,T,I,i) = (Partdiff_SP (S,T,I)) . (j + 1) by Def4, A1
.= R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . (j + 1)),(dom S)))),(modetrans ((Partdiff_SP (S,T,I)) . j))) by Def3, A5, A4
.= R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . (j + 1)),(dom S)))),(Partdiff_SP (S,T,I,j))) by A7, NDIFF_6:def 1 ;
hence (PartDiffSeq (f,Z,I)) . i is PartFunc of (product S),(Partdiff_SP (S,T,I,i)) by A6; :: thesis: verum
end;
end;