proposition: Remark In_betaFormula_subst_1_2 : forall (a b : Term) (v : nat), In v (freeVarF (substF (substF βR 1 a) 2 b)) -> In v (freeVarT a) \/ In v (freeVarT b) \/ In v (freeVarT (L:=LNN) (var 0)).
proof: Proof. intros a b v H. apply In_betaFormula_subst_1_2_0. rewrite (subFormulaId LNN); 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)