let p, q be FinSequence; :: thesis: rng p c= rng (p ^ q)
let x be object ; :: according to TARSKI:def 3 :: thesis: ( not x in rng p or x in rng (p ^ q) )
assume x in rng p ; :: thesis: x in rng (p ^ q)
then consider y being object such that
A1: y in dom p and
A2: x = p . y by FUNCT_1:def 3;
reconsider k = y as Element of NAT by A1;
A3: dom p c= dom (p ^ q) by Th26;
(p ^ q) . k = p . k by A1, Def7;
hence x in rng (p ^ q) by A1, A2, A3, FUNCT_1:def 3; :: thesis: verum