proposition: Lemma forallI (T : System) (f : Formula) (v : nat): ~ In_freeVarSys LNT v T -> SysPrf T f -> SysPrf T (allH v, f)%nt.
proof: Proof. apply (forallI LNT). Qed.
imports: Coq(Arith Ensembles List) hydras.Ackermann(Languages folProof folProp folLogic3)