proposition: Lemma multLemma1 : forall a b : nat, a * b <> 0 -> a <> 0.
proof: Proof. intros a b H H0; apply H; now subst a. Qed.
imports: hydras.Ackermann(primRec cPair) Coq(Arith Lia) hydras.Ackermann(code folProp extEqualNat codeList) hydras(Compat815)