for n, m being Integer st n >=0 holds for sm, sn, pn being FinSequence of INT for i being Integer st len sm = n + 1 & len sn = n + 1 & len pn = n + 1 & ( not n < m implies ( sm . 1 = m & 1 <= i & i <= n & ( for k being Integer st 1 <= k & k < i holds ( sm .(k + 1)=(sm . k)* 2 & not sm .(k + 1)> n ) ) & sm .(i + 1)=(sm . i)* 2 & sm .(i + 1)> n & pn .(i + 1)=0 & sn .(i + 1)= n & ( for j being Integer st 1 <= j & j <= i holds ( ( sn .((i + 1)-(j - 1))>= sm .((i + 1)- j) implies ( sn .((i + 1)- j)=(sn .((i + 1)-(j - 1)))-(sm .((i + 1)- j)) & pn .((i + 1)- j)=((pn .((i + 1)-(j - 1)))* 2)+ 1 ) ) & ( not sn .((i + 1)-(j - 1))>= sm .((i + 1)- j) implies ( sn .((i + 1)- j)= sn .((i + 1)-(j - 1)) & pn .((i + 1)- j)=(pn .((i + 1)-(j - 1)))* 2 ) ) ) ) & idiv1_prg (n,m) = pn . 1 ) ) holds ( len sm = n + 1 & len sn = n + 1 & len pn = n + 1 & ( n < m implies idiv1_prg (n,m) =0 ) & ( not n < m implies ( 1 indom sm & sm . 1 = m & 1 <= i & i <= n & ( for k being Integer st 1 <= k & k < i holds ( k + 1 indom sm & k indom sm & sm .(k + 1)=(sm . k)* 2 & not sm .(k + 1)> n ) ) & i + 1 indom sm & i indom sm & sm .(i + 1)=(sm . i)* 2 & sm .(i + 1)> n & i + 1 indom pn & pn .(i + 1)=0 & i + 1 indom sn & sn .(i + 1)= n & ( for j being Integer st 1 <= j & j <= i holds ( (i + 1)-(j - 1)indom sn & (i + 1)- j indom sm & ( sn .((i + 1)-(j - 1))>= sm .((i + 1)- j) implies ( (i + 1)- j indom sn & (i + 1)- j indom sm & sn .((i + 1)- j)=(sn .((i + 1)-(j - 1)))-(sm .((i + 1)- j)) & (i + 1)- j indom pn & (i + 1)-(j - 1)indom pn & pn .((i + 1)- j)=((pn .((i + 1)-(j - 1)))* 2)+ 1 ) ) & ( not sn .((i + 1)-(j - 1))>= sm .((i + 1)- j) implies ( (i + 1)- j indom sn & (i + 1)-(j - 1)indom sn & sn .((i + 1)- j)= sn .((i + 1)-(j - 1)) & (i + 1)- j indom pn & (i + 1)-(j - 1)indom pn & pn .((i + 1)- j)=(pn .((i + 1)-(j - 1)))* 2 ) ) ) ) & 1 indom pn & idiv1_prg (n,m) = pn . 1 ) ) )