let n be Nat; :: thesis: for s being positive Nat
for f being b1 -element natural-valued positive FinSequence st f is with_sum_of_squares_of_reciprocals_equal_1 holds
ex g being b1 + (3 * n) -element natural-valued positive FinSequence st g is with_sum_of_squares_of_reciprocals_equal_1

let s be positive Nat; :: thesis: for f being s -element natural-valued positive FinSequence st f is with_sum_of_squares_of_reciprocals_equal_1 holds
ex g being s + (3 * n) -element natural-valued positive FinSequence st g is with_sum_of_squares_of_reciprocals_equal_1

let f be s -element natural-valued positive FinSequence; :: thesis: ( f is with_sum_of_squares_of_reciprocals_equal_1 implies ex g being s + (3 * n) -element natural-valued positive FinSequence st g is with_sum_of_squares_of_reciprocals_equal_1 )
set g = (f | (s - 1)) ^ <*(2 * (f . s)),(2 * (f . s)),(2 * (f . s)),(2 * (f . s))*>;
assume A1: f is with_sum_of_squares_of_reciprocals_equal_1 ; :: thesis: ex g being s + (3 * n) -element natural-valued positive FinSequence st g is with_sum_of_squares_of_reciprocals_equal_1
defpred S1[ Nat] means ex g being s + (3 * $1) -element natural-valued positive FinSequence st g is with_sum_of_squares_of_reciprocals_equal_1 ;
A2: S1[ 0 ] by A1;
A3: for k being Nat st S1[k] holds
S1[k + 1]
proof end;
for k being Nat holds S1[k] from NAT_1:sch 2(A2, A3);
hence ex g being s + (3 * n) -element natural-valued positive FinSequence st g is with_sum_of_squares_of_reciprocals_equal_1 ; :: thesis: verum