Theorem: FOL.NV.Sub.Var.One.Rec.fastReplaceFree_aux_fastAdmitsAux
Proof state before:
F : Formula
v t : VarName
binders : Finset VarName
h1 : ¬occursIn t F
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (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 : ¬occursIn t (pred_const_ a✝¹ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (pred_const_ a✝¹ a✝))

case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : ¬occursIn t (pred_var_ a✝¹ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (pred_var_ a✝¹ a✝))

case eq_
v t a✝¹ a✝ : VarName
binders : Finset VarName
h1 : ¬occursIn t (eq_ a✝¹ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (eq_ a✝¹ a✝))

case true_
v t : VarName
binders : Finset VarName
h1 : ¬occursIn t true_
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t true_)

case false_
v t : VarName
binders : Finset VarName
h1 : ¬occursIn t false_
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t false_)

case not_
v t : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), ¬occursIn t a✝ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝)
binders : Finset VarName
h1 : ¬occursIn t a✝.not_
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t a✝.not_)

case imp_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName), ¬occursIn t a✝¹ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝¹)
a_ih✝ : ∀ (binders : Finset VarName), ¬occursIn t a✝ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝)
binders : Finset VarName
h1 : ¬occursIn t (a✝¹.imp_ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (a✝¹.imp_ a✝))

case and_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName), ¬occursIn t a✝¹ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝¹)
a_ih✝ : ∀ (binders : Finset VarName), ¬occursIn t a✝ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝)
binders : Finset VarName
h1 : ¬occursIn t (a✝¹.and_ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (a✝¹.and_ a✝))

case or_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName), ¬occursIn t a✝¹ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝¹)
a_ih✝ : ∀ (binders : Finset VarName), ¬occursIn t a✝ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝)
binders : Finset VarName
h1 : ¬occursIn t (a✝¹.or_ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (a✝¹.or_ a✝))

case iff_
v t : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName), ¬occursIn t a✝¹ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝¹)
a_ih✝ : ∀ (binders : Finset VarName), ¬occursIn t a✝ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝)
binders : Finset VarName
h1 : ¬occursIn t (a✝¹.iff_ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (a✝¹.iff_ a✝))

case forall_
v t a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), ¬occursIn t a✝ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝)
binders : Finset VarName
h1 : ¬occursIn t (forall_ a✝¹ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (forall_ a✝¹ a✝))

case exists_
v t a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), ¬occursIn t a✝ → v ∉ binders → fastAdmitsAux t v binders (fastReplaceFree v t a✝)
binders : Finset VarName
h1 : ¬occursIn t (exists_ a✝¹ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (exists_ a✝¹ a✝))

case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : ¬occursIn t (def_ a✝¹ a✝)
h2 : v ∉ binders
⊢ fastAdmitsAux t v binders (fastReplaceFree v t (def_ a✝¹ a✝))