proposition: Lemma freeVarAddForalls1 : forall (n m v : nat) (A : Formula), In v (freeVarF (addForalls m n A)) -> In v (freeVarF A).
proof: Proof. intros n m v A H. induction n as [| n Hrecn]; simpl in H; auto. apply Hrecn. eapply in_remove. exact H. Qed.
imports: Coq(Arith) hydras.Ackermann(extEqualNat subAll folProp subProp folReplace folLogic3 NN NNtheory primRec expressible) Coqprime(ChineseRem) Coq(Vector List Lia) hydras(ListExt cPair MoreDecidable) hydras(Compat815 ssrnat_extracts) Coq(Utf8)