Theorem: FOL.NV.Sub.Var.One.Rec.fastAdmitsAux_add_binders
Proof state before:
F : Formula
v u : VarName
S T : Finset VarName
h1 : fastAdmitsAux v u S F
h2 : u ∉ T
⊢ fastAdmitsAux v u (S ∪ T) F
Tactic:
induction F generalizing S
Proof state after:
case pred_const_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : fastAdmitsAux v u S (pred_const_ a✝¹ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (pred_const_ a✝¹ a✝)

case pred_var_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : fastAdmitsAux v u S (pred_var_ a✝¹ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (pred_var_ a✝¹ a✝)

case eq_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : VarName
S : Finset VarName
h1 : fastAdmitsAux v u S (eq_ a✝¹ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (eq_ a✝¹ a✝)

case true_
v u : VarName
T : Finset VarName
h2 : u ∉ T
S : Finset VarName
h1 : fastAdmitsAux v u S true_
⊢ fastAdmitsAux v u (S ∪ T) true_

case false_
v u : VarName
T : Finset VarName
h2 : u ∉ T
S : Finset VarName
h1 : fastAdmitsAux v u S false_
⊢ fastAdmitsAux v u (S ∪ T) false_

case not_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝ : Formula
a_ih✝ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝ → fastAdmitsAux v u (S ∪ T) a✝
S : Finset VarName
h1 : fastAdmitsAux v u S a✝.not_
⊢ fastAdmitsAux v u (S ∪ T) a✝.not_

case imp_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝¹ → fastAdmitsAux v u (S ∪ T) a✝¹
a_ih✝ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝ → fastAdmitsAux v u (S ∪ T) a✝
S : Finset VarName
h1 : fastAdmitsAux v u S (a✝¹.imp_ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (a✝¹.imp_ a✝)

case and_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝¹ → fastAdmitsAux v u (S ∪ T) a✝¹
a_ih✝ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝ → fastAdmitsAux v u (S ∪ T) a✝
S : Finset VarName
h1 : fastAdmitsAux v u S (a✝¹.and_ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (a✝¹.and_ a✝)

case or_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝¹ → fastAdmitsAux v u (S ∪ T) a✝¹
a_ih✝ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝ → fastAdmitsAux v u (S ∪ T) a✝
S : Finset VarName
h1 : fastAdmitsAux v u S (a✝¹.or_ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (a✝¹.or_ a✝)

case iff_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝¹ → fastAdmitsAux v u (S ∪ T) a✝¹
a_ih✝ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝ → fastAdmitsAux v u (S ∪ T) a✝
S : Finset VarName
h1 : fastAdmitsAux v u S (a✝¹.iff_ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (a✝¹.iff_ a✝)

case forall_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝ → fastAdmitsAux v u (S ∪ T) a✝
S : Finset VarName
h1 : fastAdmitsAux v u S (forall_ a✝¹ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (forall_ a✝¹ a✝)

case exists_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (S : Finset VarName), fastAdmitsAux v u S a✝ → fastAdmitsAux v u (S ∪ T) a✝
S : Finset VarName
h1 : fastAdmitsAux v u S (exists_ a✝¹ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (exists_ a✝¹ a✝)

case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : fastAdmitsAux v u S (def_ a✝¹ a✝)
⊢ fastAdmitsAux v u (S ∪ T) (def_ a✝¹ a✝)