A1: now

let x be set ; :: thesis: ( x in dom SCM+FSA-OK implies (s +* (t .--> u)) . x in SCM+FSA-OK . x )
assume A2: x in dom SCM+FSA-OK ; :: thesis: (s +* (t .--> u)) . x in SCM+FSA-OK . x

now

per cases ( x = t or x <> t ) ;

suppose A3: x = t ; :: thesis: (s +* (t .--> u)) . x in SCM+FSA-OK . x

{t} = dom (t .--> u) by FUNCOP_1:13;
then t in dom (t .--> u) by TARSKI:def 1;
then (s +* (t .--> u)) . t = (t .--> u) . t by FUNCT_4:13
.= u by FUNCOP_1:72 ;
then (s +* (t .--> u)) . t in INT by INT_1:def 2;
hence (s +* (t .--> u)) . x in SCM+FSA-OK . x by A3, Th10; :: thesis: verum

end;

suppose A4: x <> t ; :: thesis: (s +* (t .--> u)) . x in SCM+FSA-OK . x

{t} = dom (t .--> u) by FUNCOP_1:13;
then not x in dom (t .--> u) by A4, TARSKI:def 1;
then (s +* (t .--> u)) . x = s . x by FUNCT_4:11;
hence (s +* (t .--> u)) . x in SCM+FSA-OK . x by A2, CARD_3:9; :: thesis: verum

end;

end;

end;

hence (s +* (t .--> u)) . x in SCM+FSA-OK . x ; :: thesis: verum

end;

A5: dom SCM+FSA-OK = SCM+FSA-Memory by FUNCT_2:def 1;
then dom s = SCM+FSA-Memory by CARD_3:9;
then dom (s +* (t .--> u)) = SCM+FSA-Memory \/ (dom (t .--> u)) by FUNCT_4:def 1
.= SCM+FSA-Memory \/ {t} by FUNCOP_1:13
.= dom SCM+FSA-OK by A5, ZFMISC_1:40 ;
hence s +* (t .--> u) is SCM+FSA-State by A1, CARD_3:9; :: thesis: verum