proposition: Theorem contradictoryNotRealize : forall S : State, contradictory S -> forall f : rNat -> bool, ~ realizeState f S.
proof: Proof. intros S H' f; red in |- *; intros H'0; inversion H'. absurd (rZEval f x = rZEval f (rZComp x)). rewrite rZEvalCompInv; case (rZEval f x); auto with stalmarck; red in |- *; intros; discriminate. apply realizeStateInv with (S := S); auto with stalmarck. Qed.
imports: Coq(List)