reach1: Reachability in exactly 1 M-step. Definition: reach1(x,y,A,F,M) = (\exists k: F*(x,k,A): ~A(k) & F*(M(k),y,A)) Wp: wp("M' := M[i<-c]", reach1(x,y,A,F,M)) = (substituting in the definition) (\exists k: F*(x,k,A): ~A(k) & F*(M'(k),y,A)) = (expanding M'(k)) (\exists k: F*(x,k,A): ~A(k) & (k=i & F*(c,y,A) | k\neq i & F*(M(k),y,A))) = (distributing \exists over |) (\exists k: F*(x,k,A): ~A(k) & k=i & F*(c,y,A)) | (\exists k: F*(x,k,A): ~A(k) & k\neq i & F*(M(k),y,A)) = (lemma 0; definition of Ai; simplifying (1)) F*(x,i,A) & ~A(i) & F*(c,y,A) | (\exists k: F*(x,k,Ai): ~Ai(k) & F*(M(k),y,Ai)) = (definition of reach1) F*(x,i,A) & ~A(i) & F*(c,y,A) | reach1(x,y,Ai,F,M)