let a be Data-Location ; :: thesis: for i1 being Instruction-Location of SCM holds JUMP (a >0_goto i1) = {i1}
let i1 be Instruction-Location of SCM ; :: thesis: JUMP (a >0_goto i1) = {i1}
set X = { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum } ;
now let x be
set ;
:: thesis: ( ( x in meet { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum } implies x in {i1} ) & ( x in {i1} implies x in meet { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum } ) )hereby :: thesis: ( x in {i1} implies x in meet { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum } )
assume A1:
x in meet { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum }
;
:: thesis: x in {i1}set il1 =
il. 1;
set il2 =
il. 2;
(
NIC (a >0_goto i1),
(il. 1) in { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum } &
NIC (a >0_goto i1),
(il. 2) in { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum } )
;
then A2:
(
x in NIC (a >0_goto i1),
(il. 1) &
x in NIC (a >0_goto i1),
(il. 2) )
by A1, SETFAM_1:def 1;
(
NIC (a >0_goto i1),
(il. 1) = {i1,(Next )} &
NIC (a >0_goto i1),
(il. 2) = {i1,(Next )} )
by Th50;
then
( (
x = i1 or
x = Next ) & (
x = i1 or
x = Next ) )
by A2, TARSKI:def 2;
hence
x in {i1}
by TARSKI:def 1;
:: thesis: verum
end; assume
x in {i1}
;
:: thesis: x in meet { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum } then A3:
x = i1
by TARSKI:def 1;
A4:
NIC (a >0_goto i1),
i1 in { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum }
;
hence
x in meet { (NIC (a >0_goto i1),il) where il is Instruction-Location of SCM : verum }
by A3, A4, SETFAM_1:def 1;
:: thesis: verum end;
hence
JUMP (a >0_goto i1) = {i1}
by TARSKI:2; :: thesis: verum