let I be Instruction of (SCM R); :: according to COMPOS_1:def 35 :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

set T = InsCode I;
X: JumpPart I in JumpParts (InsCode I) ;
per cases ( InsCode I = 0 or InsCode I = 1 or InsCode I = 2 or InsCode I = 3 or InsCode I = 4 or InsCode I = 5 or InsCode I = 6 or InsCode I = 7 ) by Lm3;
suppose InsCode I = 0 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

then I = halt (SCM R) by Th16;
hence for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT ) ; :: thesis: verum
end;
suppose InsCode I = 1 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

end;
suppose InsCode I = 2 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

end;
suppose InsCode I = 3 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

end;
suppose InsCode I = 4 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

end;
suppose InsCode I = 5 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

end;
suppose A122: InsCode I = 6 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

then consider i2 being Element of NAT such that
W: I = goto (i2,R) by Th22;
let k be set ; :: thesis: ( not k in dom (I `2_3) or (product" (JumpParts (InsCode I))) . k = NAT )
assume Z: k in dom (JumpPart I) ; :: thesis: (product" (JumpParts (InsCode I))) . k = NAT
for f being Function st f in JumpParts (InsCode I) holds
k in dom f
proof
let f be Function; :: thesis: ( f in JumpParts (InsCode I) implies k in dom f )
assume f in JumpParts (InsCode I) ; :: thesis: k in dom f
then consider J being Instruction of (SCM R) such that
W1: f = JumpPart J and
W2: InsCode J = InsCode I ;
thus k in dom f by Z, W1, W2, COMPOS_1:def 33; :: thesis: verum
end;
then k in dom (product" (JumpParts (InsCode I))) by CARD_3:def 13;
then k in {1} by A122, Th38;
then k = 1 by TARSKI:def 1;
hence (product" (JumpParts (InsCode I))) . k = NAT by W, Th50; :: thesis: verum
end;
suppose A135: InsCode I = 7 ; :: thesis: for b1 being set holds
( not b1 in dom (I `2_3) or (product" (JumpParts (InsCode I))) . b1 = NAT )

then consider a being Data-Location of R, i1 being Element of NAT such that
W: I = a =0_goto i1 by Th23;
let k be set ; :: thesis: ( not k in dom (I `2_3) or (product" (JumpParts (InsCode I))) . k = NAT )
assume Z: k in dom (JumpPart I) ; :: thesis: (product" (JumpParts (InsCode I))) . k = NAT
for f being Function st f in JumpParts (InsCode I) holds
k in dom f
proof
let f be Function; :: thesis: ( f in JumpParts (InsCode I) implies k in dom f )
assume f in JumpParts (InsCode I) ; :: thesis: k in dom f
then consider J being Instruction of (SCM R) such that
W1: f = JumpPart J and
W2: InsCode J = InsCode I ;
thus k in dom f by Z, W1, W2, COMPOS_1:def 33; :: thesis: verum
end;
then k in dom (product" (JumpParts (InsCode I))) by CARD_3:def 13;
then k in {1} by A135, Th39;
then k = 1 by TARSKI:def 1;
hence (product" (JumpParts (InsCode I))) . k = NAT by W, Th51; :: thesis: verum
end;
end;