proposition: Lemma subFormulaRelation : forall (r : Relations L) (ts : fol.Terms L (arityR L r)) (v : nat) (s : fol.Term L), substF (atomic r ts) v s = atomic r (substTs (arityR L r) ts v s).
proof: Proof. reflexivity. Qed.
imports: Coq(Wf_nat Arith Lists.List Peano_dec) hydras.Ackermann(ListExt)