let I be Element of Segm 8; :: thesis: for S being non empty 1-sorted
for x being Element of SCM-Instr S
for mk being Element of NAT
for ml being Element of SCM-Data-Loc st x = [I,<*mk*>,<*ml*>] holds
( x cjump_address = mk & x cond_address = ml )
let S be non empty 1-sorted ; :: thesis: for x being Element of SCM-Instr S
for mk being Element of NAT
for ml being Element of SCM-Data-Loc st x = [I,<*mk*>,<*ml*>] holds
( x cjump_address = mk & x cond_address = ml )
let x be Element of SCM-Instr S; :: thesis: for mk being Element of NAT
for ml being Element of SCM-Data-Loc st x = [I,<*mk*>,<*ml*>] holds
( x cjump_address = mk & x cond_address = ml )
let mk be Element of NAT ; :: thesis: for ml being Element of SCM-Data-Loc st x = [I,<*mk*>,<*ml*>] holds
( x cjump_address = mk & x cond_address = ml )
let ml be Element of SCM-Data-Loc ; :: thesis: ( x = [I,<*mk*>,<*ml*>] implies ( x cjump_address = mk & x cond_address = ml ) )
assume A1: x = [I,<*mk*>,<*ml*>] ; :: thesis: ( x cjump_address = mk & x cond_address = ml )
then consider mk9 being Element of NAT such that
A2: <*mk9*> = x `2_3 and
A3: x cjump_address = <*mk9*> /. 1 by Def5;
<*mk9*> = <*mk*> by A1, A2;
hence x cjump_address = mk by A3, FINSEQ_4:16; :: thesis: x cond_address = ml
consider ml9 being Element of SCM-Data-Loc such that
A4: <*ml9*> = x `3_3 and
A5: x cond_address = <*ml9*> /. 1 by A1, Def6;
<*ml9*> = <*ml*> by A1, A4;
hence x cond_address = ml by A5, FINSEQ_4:16; :: thesis: verum