let D, E be non empty set ; :: thesis: for d being Element of D
for p being FinSequence of D
for h being Function of D,E holds h * (p ^ <*d*>) = (h * p) ^ <*(h . d)*>
let d be Element of D; :: thesis: for p being FinSequence of D
for h being Function of D,E holds h * (p ^ <*d*>) = (h * p) ^ <*(h . d)*>
let p be FinSequence of D; :: thesis: for h being Function of D,E holds h * (p ^ <*d*>) = (h * p) ^ <*(h . d)*>
let h be Function of D,E; :: thesis: h * (p ^ <*d*>) = (h * p) ^ <*(h . d)*>
set q = h * (p ^ <*d*>);
set r = (h * p) ^ <*(h . d)*>;
set i = (len p) + 1;
A1:
len (h * (p ^ <*d*>)) = len (p ^ <*d*>)
by FINSEQ_2:37;
A2:
len (p ^ <*d*>) = (len p) + 1
by FINSEQ_2:19;
A3:
len ((h * p) ^ <*(h . d)*>) = (len (h * p)) + 1
by FINSEQ_2:19;
A4:
len (h * p) = len p
by FINSEQ_2:37;
X:
dom (h * (p ^ <*d*>)) = Seg ((len p) + 1)
by A1, A2, FINSEQ_1:def 3;
hence
h * (p ^ <*d*>) = (h * p) ^ <*(h . d)*>
by A1, A2, A3, A4, FINSEQ_2:10; :: thesis: verum