let R be good Ring; :: thesis: for a, c being Data-Location of R
for i1 being Instruction-Location of SCM R
for s being State of (SCM R) holds
( ( s . a = 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = i1 ) & ( s . a <> 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = Next ) & (Exec (a =0_goto i1),s) . c = s . c )
let a, c be Data-Location of R; :: thesis: for i1 being Instruction-Location of SCM R
for s being State of (SCM R) holds
( ( s . a = 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = i1 ) & ( s . a <> 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = Next ) & (Exec (a =0_goto i1),s) . c = s . c )
let i1 be Instruction-Location of SCM R; :: thesis: for s being State of (SCM R) holds
( ( s . a = 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = i1 ) & ( s . a <> 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = Next ) & (Exec (a =0_goto i1),s) . c = s . c )
let s be State of (SCM R); :: thesis: ( ( s . a = 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = i1 ) & ( s . a <> 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = Next ) & (Exec (a =0_goto i1),s) . c = s . c )
reconsider I = a =0_goto i1 as Element of SCM-Instr R by Def1;
reconsider S = s as SCM-State of R by Def1;
reconsider i = 7 as Element of Segm 8 by GR_CY_1:10;
A1: I = [i,<*i1,a*>] ;
A2: IC s = IC S by Def1;
A3: ( a is Element of SCM-Data-Loc & i1 is Element of NAT ) by Th1, AMI_1:def 4;
A4: Exec (a =0_goto i1),s = SCM-Exec-Res I,S by Th12
.= SCM-Chg S,(IFEQ (S . (I cond_address )),(0. R),(I cjump_address ),(succ (IC S))) by A3, SCMRING1:def 14 ;
thus ( s . a = 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = i1 ) :: thesis: ( ( s . a <> 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = Next ) & (Exec (a =0_goto i1),s) . c = s . c )

proof

assume s . a = 0. R ; :: thesis: (Exec (a =0_goto i1),s) . (IC (SCM R)) = i1
then A5: S . (I cond_address ) = 0. R by A1, A3, SCMRING1:19;
thus (Exec (a =0_goto i1),s) . (IC (SCM R)) = (Exec (a =0_goto i1),s) . NAT by Def1
.= IFEQ (S . (I cond_address )),(0. R),(I cjump_address ),(succ (IC S)) by A4, SCMRING1:10
.= I cjump_address by A5, FUNCOP_1:def 8
.= i1 by A1, A3, SCMRING1:19 ; :: thesis: verum

end;

thus ( s . a <> 0. R implies (Exec (a =0_goto i1),s) . (IC (SCM R)) = Next ) :: thesis: (Exec (a =0_goto i1),s) . c = s . c

proof

assume s . a <> 0. R ; :: thesis: (Exec (a =0_goto i1),s) . (IC (SCM R)) = Next
then A6: S . (I cond_address ) <> 0. R by A1, A3, SCMRING1:19;
thus (Exec (a =0_goto i1),s) . (IC (SCM R)) = (Exec (a =0_goto i1),s) . NAT by Def1
.= IFEQ (S . (I cond_address )),(0. R),(I cjump_address ),(succ (IC S)) by A4, SCMRING1:10
.= Next by A2, A6, FUNCOP_1:def 8 ; :: thesis: verum

end;

c is Element of SCM-Data-Loc by Th1;
hence (Exec (a =0_goto i1),s) . c = s . c by A4, SCMRING1:11; :: thesis: verum