Section Extensions.
Let orH := orH L.
Let andH := andH L.
Let existH := existH L.
Let iffH := iffH L.
Let ifThenElseH := ifThenElseH L.
intros.
unfold orH, fol.orH in |- *.
rewrite subFormulaImp.
rewrite subFormulaNot.
reflexivity.
Qed.

Lemma subFormulaAnd :
forall (f1 f2 : fol.Formula L) (v : nat) (s : fol.Term L),
substituteFormula (andH f1 f2) v s =
andH (substituteFormula f1 v s) (substituteFormula f2 v s).