let n be object ; :: according to NUMBER06:def 8 :: thesis: (f ^ g) . n is triangular
per cases ( n in dom (f ^ g) or not n in dom (f ^ g) ) ;
suppose A1: n in dom (f ^ g) ; :: thesis: (f ^ g) . n is triangular
then reconsider n = n as Nat ;
A2: 1 <= n by A1, FINSEQ_3:25;
A3: n <= len (f ^ g) by A1, FINSEQ_3:25;
per cases ( n <= len f or n > len f ) ;
suppose n > len f ; :: thesis: (f ^ g) . n is triangular
then (f ^ g) . n = g . (n - (len f)) by A3, FINSEQ_1:24;
hence (f ^ g) . n is triangular by NUMBER06:def 8; :: thesis: verum
end;
end;
end;
suppose not n in dom (f ^ g) ; :: thesis: (f ^ g) . n is triangular
end;
end;