proposition: Theorem NotEqComp : forall a : rZ, a <> rZComp a.
proof: Proof. intros a; case a; red in |- *; intros H'; discriminate. Qed.
imports: Stalmarck(sTactic) Coq(Relation_Definitions) Coq(ZArith) Coq(Inverse_Image) Coq(Inclusion) Coq(Wf_nat) Coq(List)