Suppose
is partially correct. Suppose
is True (if evaluates to True at , so does ), and suppose
is True . So is stronger (or as strong as) , and is stronger than (or as strong as) . Then also
is partially correct.
Proof.
Suppose
is partially correct and
and
are both tautologies. Suppose input satisfies . Then satisfies . So when the code is applied to , any output satisfies (since
is partially correct). So any such output satisfies (since
is a tautology). So by definition
is partially corect.