proposition: Lemma LNN2LNT_freeVarF2 (f : fol.Formula LNN) (v : nat): In v (freeVarF f) -> In v (freeVarF (LNN2LNT_formula f)).
proof: Proof. intros ? ; destruct (LNN2LNT_freeVarF f v); auto. Qed.
imports: Coq(Ensembles List Arith) hydras.Ackermann(misc ListExt folProp folProof Languages subAll subProp folLogic3 folReplace LNN LNT codeNatToTerm NewNotations)