A0: len (f ^ g) = m + n by CARD_1:def 7;
A0a: m + 0 <= m + n by XREAL_1:6;
A1: len ((f ^ g) | m) = m by CARD_1:def 7
.= len f by CARD_1:def 7 ;
for k being Nat st k in dom f holds
f . k = ((f ^ g) | m) . k
proof
let k be Nat; :: thesis: ( k in dom f implies f . k = ((f ^ g) | m) . k )
assume B1: k in dom f ; :: thesis: f . k = ((f ^ g) | m) . k
dom f = m by CARD_1:def 7;
then ((f ^ g) | m) . k = (f ^ g) . k by A0, A0a, B1, AFINSQ_1:53
.= f . k by B1, AFINSQ_1:def 3 ;
hence f . k = ((f ^ g) | m) . k ; :: thesis: verum
end;
hence (f ^ g) | m = f by A1; :: thesis: verum