Theorem: FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree
Proof state before:
F : Formula
v t : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders F = fastReplaceFree v t F
Tactic:
induction F generalizing binders
Proof state after:
case pred_const_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (pred_const_ a✝¹ a✝) = fastReplaceFree v t (pred_const_ a✝¹ a✝)

case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (pred_var_ a✝¹ a✝) = fastReplaceFree v t (pred_var_ a✝¹ a✝)

case eq_
v t a✝¹ a✝ : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (eq_ a✝¹ a✝) = fastReplaceFree v t (eq_ a✝¹ a✝)

case true_
v t : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders true_ = fastReplaceFree v t true_

case false_
v t : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders false_ = fastReplaceFree v t false_

case not_
v t : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝ = fastReplaceFree v t a✝
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders a✝.not_ = fastReplaceFree v t a✝.not_

case imp_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝¹ = fastReplaceFree v t a✝¹
a_ih✝ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝ = fastReplaceFree v t a✝
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (a✝¹.imp_ a✝) = fastReplaceFree v t (a✝¹.imp_ a✝)

case and_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝¹ = fastReplaceFree v t a✝¹
a_ih✝ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝ = fastReplaceFree v t a✝
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (a✝¹.and_ a✝) = fastReplaceFree v t (a✝¹.and_ a✝)

case or_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝¹ = fastReplaceFree v t a✝¹
a_ih✝ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝ = fastReplaceFree v t a✝
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (a✝¹.or_ a✝) = fastReplaceFree v t (a✝¹.or_ a✝)

case iff_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝¹ = fastReplaceFree v t a✝¹
a_ih✝ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝ = fastReplaceFree v t a✝
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (a✝¹.iff_ a✝) = fastReplaceFree v t (a✝¹.iff_ a✝)

case forall_
v t a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝ = fastReplaceFree v t a✝
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (forall_ a✝¹ a✝) = fastReplaceFree v t (forall_ a✝¹ a✝)

case exists_
v t a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders a✝ = fastReplaceFree v t a✝
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (exists_ a✝¹ a✝) = fastReplaceFree v t (exists_ a✝¹ a✝)

case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (def_ a✝¹ a✝) = fastReplaceFree v t (def_ a✝¹ a✝)