let G be non empty good 1-sorted ; :: thesis: for i being Element of SCM-Memory holds
( (SCM-OK G) . i = NAT iff i = NAT )
let i be Element of SCM-Memory ; :: thesis: ( (SCM-OK G) . i = NAT iff i = NAT )
thus ( (SCM-OK G) . i = NAT implies i = NAT ) :: thesis: ( i = NAT implies (SCM-OK G) . i = NAT )

proof

assume A1: (SCM-OK G) . i = NAT ; :: thesis: i = NAT
assume A2: i <> NAT ; :: thesis: contradiction

per cases i in SCM-Data-Loc by A2, Lm1;

suppose i in SCM-Data-Loc ; :: thesis: contradiction

then (SCM-OK G) . i = the carrier of G by Def3;
hence contradiction by A1, Def2; :: thesis: verum

end;

end;

end;

thus ( i = NAT implies (SCM-OK G) . i = NAT ) by Def3; :: thesis: verum