let k be Element of NAT ; :: thesis: for s being State of
for I being Program of
for a being read-write Int-Location holds (StepWhile>0 a,I,s) . (k + 1) = (StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 1
let s be State of ; :: thesis: for I being Program of
for a being read-write Int-Location holds (StepWhile>0 a,I,s) . (k + 1) = (StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 1
let I be Program of ; :: thesis: for a being read-write Int-Location holds (StepWhile>0 a,I,s) . (k + 1) = (StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 1
let a be read-write Int-Location ; :: thesis: (StepWhile>0 a,I,s) . (k + 1) = (StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 1
set sk = (StepWhile>0 a,I,s) . k;
set sk0 = (StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 0 ;
(StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 0 = (StepWhile>0 a,I,s) . k by Def5;
hence (StepWhile>0 a,I,s) . (k + 1) = Computation (((StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 0 ) +* ((while>0 a,I) +* (Start-At (insloc 0 )))),((LifeSpan (((StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 0 ) +* (I +* (Start-At (insloc 0 ))))) + 3) by Def5
.= (StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . (0 + 1) by Def5
.= (StepWhile>0 a,I,((StepWhile>0 a,I,s) . k)) . 1 ;
:: thesis: verum