let s be State of ; :: thesis: ( Euclide-Algorithm c= s implies for k being Element of NAT st IC (Computation s,k) = 1 holds
( IC (Computation s,(k + 1)) = 2 & (Computation s,(k + 1)) . (dl. 0 ) = ((Computation s,k) . (dl. 0 )) div ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 1) = ((Computation s,k) . (dl. 0 )) mod ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 2) = (Computation s,k) . (dl. 2) ) )
assume A1: Euclide-Algorithm c= s ; :: thesis: for k being Element of NAT st IC (Computation s,k) = 1 holds
( IC (Computation s,(k + 1)) = 2 & (Computation s,(k + 1)) . (dl. 0 ) = ((Computation s,k) . (dl. 0 )) div ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 1) = ((Computation s,k) . (dl. 0 )) mod ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 2) = (Computation s,k) . (dl. 2) )
let k be Element of NAT ; :: thesis: ( IC (Computation s,k) = 1 implies ( IC (Computation s,(k + 1)) = 2 & (Computation s,(k + 1)) . (dl. 0 ) = ((Computation s,k) . (dl. 0 )) div ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 1) = ((Computation s,k) . (dl. 0 )) mod ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 2) = (Computation s,k) . (dl. 2) ) )
assume A2: IC (Computation s,k) = 1 ; :: thesis: ( IC (Computation s,(k + 1)) = 2 & (Computation s,(k + 1)) . (dl. 0 ) = ((Computation s,k) . (dl. 0 )) div ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 1) = ((Computation s,k) . (dl. 0 )) mod ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 2) = (Computation s,k) . (dl. 2) )
A3: Computation s,(k + 1) = Exec (s . (IC (Computation s,k))),(Computation s,k) by AMI_1:55
.= Exec (Divide (dl. 0 ),(dl. 1)),(Computation s,k) by A1, A2, Lm3 ;
hence IC (Computation s,(k + 1)) = Next by AMI_3:12
.= 1 + 1 by A2
.= 2 ;
:: thesis: ( (Computation s,(k + 1)) . (dl. 0 ) = ((Computation s,k) . (dl. 0 )) div ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 1) = ((Computation s,k) . (dl. 0 )) mod ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 2) = (Computation s,k) . (dl. 2) )
thus ( (Computation s,(k + 1)) . (dl. 0 ) = ((Computation s,k) . (dl. 0 )) div ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 1) = ((Computation s,k) . (dl. 0 )) mod ((Computation s,k) . (dl. 1)) & (Computation s,(k + 1)) . (dl. 2) = (Computation s,k) . (dl. 2) ) by A3, Lm1, Lm2, AMI_3:12; :: thesis: verum