let N be with_non-empty_elements set ; :: thesis: for S being non empty stored-program IC-Ins-separated definite standard AMI-Struct of NAT ,N
for I being Instruction of S st ( for f being Instruction-Location of S holds NIC I,f = {(NextLoc f)} ) holds
JUMP I is empty
let S be non empty stored-program IC-Ins-separated definite standard AMI-Struct of NAT ,N; :: thesis: for I being Instruction of S st ( for f being Instruction-Location of S holds NIC I,f = {(NextLoc f)} ) holds
JUMP I is empty
let I be Instruction of S; :: thesis: ( ( for f being Instruction-Location of S holds NIC I,f = {(NextLoc f)} ) implies JUMP I is empty )
assume A1: for f being Instruction-Location of S holds NIC I,f = {(NextLoc f)} ; :: thesis: JUMP I is empty
set p = 1;
set q = 2;
reconsider p = 1, q = 2 as Instruction-Location of S by AMI_1:def 4;
set X = { (NIC I,f) where f is Instruction-Location of S : verum } ;
assume not JUMP I is empty ; :: thesis: contradiction
then consider x being set such that
A2: x in meet { (NIC I,f) where f is Instruction-Location of S : verum } by XBOOLE_0:def 1;
A3: NIC I,p = {(NextLoc p)} by A1;
A4: NIC I,q = {(NextLoc q)} by A1;
A5: {(NextLoc p)} in { (NIC I,f) where f is Instruction-Location of S : verum } by A3;
A6: {(NextLoc q)} in { (NIC I,f) where f is Instruction-Location of S : verum } by A4;
A7: x in {(NextLoc p)} by A2, A5, SETFAM_1:def 1;
A8: x in {(NextLoc q)} by A2, A6, SETFAM_1:def 1;
A9: x = NextLoc p by A7, TARSKI:def 1;
x = NextLoc q by A8, TARSKI:def 1;
hence contradiction by A9, AMISTD_1:36; :: thesis: verum