set S = ECIW-signature ;
set G = INT-ElemIns ;
let X be non empty countable set ; for T being Subset of (Funcs X,INT )
for c being Enumeration of X
for f being INT-Exec of c,T
for v being INT-Variable of X
for t being INT-Expression of X holds v,t form_assignment_wrt f
let T be Subset of (Funcs X,INT ); for c being Enumeration of X
for f being INT-Exec of c,T
for v being INT-Variable of X
for t being INT-Expression of X holds v,t form_assignment_wrt f
let c be Enumeration of X; for f being INT-Exec of c,T
for v being INT-Variable of X
for t being INT-Expression of X holds v,t form_assignment_wrt f
set A = FreeUnivAlgNSG ECIW-signature ,INT-ElemIns ;
let f be INT-Exec of c,T; for v being INT-Variable of X
for t being INT-Expression of X holds v,t form_assignment_wrt f
let v be INT-Variable of X; for t being INT-Expression of X holds v,t form_assignment_wrt f
let t be INT-Expression of X; v,t form_assignment_wrt f
reconsider v9 = v as Element of Funcs (Funcs X,INT ),X by FUNCT_2:11;
reconsider t9 = t as Element of Funcs (Funcs X,INT ),INT by FUNCT_2:11;
A1:
ElementaryInstructions (FreeUnivAlgNSG ECIW-signature ,INT-ElemIns ) = FreeGenSetNSG ECIW-signature ,INT-ElemIns
by AOFA_000:70;
A2:
rng c c= NAT
by Th11;
dom c = X
by Th6;
then reconsider c9 = c as Function of X,NAT by A2, FUNCT_2:4;
reconsider cv = c9 * v as Element of Funcs (Funcs X,INT ),NAT by FUNCT_2:11;
set v1 = cv ** c9,NAT ;
set t1 = t9 ** c9,NAT ;
A3:
Terminals (DTConUA ECIW-signature ,INT-ElemIns ) = INT-ElemIns
by FREEALG:3;
A4:
[(cv ** c9,NAT ),(t9 ** c9,NAT )] in INT-ElemIns
by ZFMISC_1:106;
then
root-tree [(cv ** c9,NAT ),(t9 ** c9,NAT )] in ElementaryInstructions (FreeUnivAlgNSG ECIW-signature ,INT-ElemIns )
by A1, A3;
then reconsider I = root-tree [(cv ** c9,NAT ),(t9 ** c9,NAT )] as Element of (FreeUnivAlgNSG ECIW-signature ,INT-ElemIns ) ;
take
I
; AOFA_I00:def 15 ( I in ElementaryInstructions (FreeUnivAlgNSG ECIW-signature ,INT-ElemIns ) & ( for s being Element of Funcs X,INT holds f . s,I = s +* (v . s),(t . s) ) )
for s being Element of Funcs X,INT holds f . s,(root-tree [((c * v9) ** c,NAT ),(t9 ** c,NAT )]) = s +* (v9 . s),(t9 . s)
by A2, Def28;
hence
( I in ElementaryInstructions (FreeUnivAlgNSG ECIW-signature ,INT-ElemIns ) & ( for s being Element of Funcs X,INT holds f . s,I = s +* (v . s),(t . s) ) )
by A1, A3, A4; verum