consider w being State of (SCM S);
consider e being Element of S such that
A1: e <> 0. S by STRUCT_0:def 19;
reconsider e = e as Element of S ;
set t = w +* (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e));
A2: dom (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e)) = {(dl. (S,0)),(dl. (S,1))} by FUNCT_4:65;
then A3: dl. (S,1) in dom (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e)) by TARSKI:def 2;
A5: InsCode (p := q) = 1 by RECDEF_2:def 1
.= InsCode ((dl. (S,0)) := (dl. (S,1))) by RECDEF_2:def 1 ;
dl. (S,0) in Data-Locations SCM by SCMRING2:1;
then XX: dl. (S,0) in Data-Locations (SCM S) by SCMRING2:31;
dl. (S,0) in dom (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e)) by A2, TARSKI:def 2;
then A6: (w +* (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e))) . (dl. (S,0)) = (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e)) . (dl. (S,0)) by FUNCT_4:14
.= 0. S by AMI_3:52, FUNCT_4:66 ;
(Exec (((dl. (S,0)) := (dl. (S,1))),(w +* (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e))))) . (dl. (S,0)) = (w +* (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e))) . (dl. (S,1)) by SCMRING2:13
.= (((dl. (S,0)),(dl. (S,1))) --> ((0. S),e)) . (dl. (S,1)) by A3, FUNCT_4:14
.= e by FUNCT_4:66 ;
hence for b₁ being InsType of (SCM S) st b₁ = InsCode (p := q) holds
not b₁ is jump-only by A1, A5, A6, AMISTD_1:def 3, XX; :: thesis: verum