Theorem: FOL.NV.Sub.Var.One.Rec.fastAdmitsAux_add_binders (FOL/NV/Sub/Var/One/Rec/Admits.lean)

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
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✝)

State before:
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✝)
Tactic:
all_goals
  simp only [fastAdmitsAux] at h1
  simp only [fastAdmitsAux]
State after:
case pred_const_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T

case pred_var_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T

case eq_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : VarName
S : Finset VarName
h1 : v = a✝¹ ∨ v = a✝ → u ∉ S
⊢ v = a✝¹ ∨ v = a✝ → u ∉ S ∪ T

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✝
⊢ fastAdmitsAux v u (S ∪ T) a✝

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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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 : v = a✝¹ ∨ fastAdmitsAux v u (S ∪ {a✝¹}) a✝
⊢ v = a✝¹ ∨ fastAdmitsAux v u (S ∪ T ∪ {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 : v = a✝¹ ∨ fastAdmitsAux v u (S ∪ {a✝¹}) a✝
⊢ v = a✝¹ ∨ fastAdmitsAux v u (S ∪ T ∪ {a✝¹}) a✝

case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : v = x ∨ fastAdmitsAux v u (S ∪ {x}) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ T ∪ {x}) phi
Tactic:
case forall_ x phi phi_ih | exists_ x phi phi_ih =>
  simp
  cases h1
  case inl h1 =>
    tauto
  case inr h1 =>
    specialize phi_ih (S ∪ {x}) h1
    right
    simp only [Finset.union_right_comm_assoc]
    exact phi_ih
State after:
no goals

State before:
case pred_const_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T

case pred_var_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T

case eq_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : VarName
S : Finset VarName
h1 : v = a✝¹ ∨ v = a✝ → u ∉ S
⊢ v = a✝¹ ∨ v = a✝ → u ∉ S ∪ T

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✝
⊢ fastAdmitsAux v u (S ∪ T) a✝

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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) a✝

case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T
Tactic:
any_goals
  simp only [Finset.mem_union]
State after:
case pred_const_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)

case pred_var_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)

case eq_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : VarName
S : Finset VarName
h1 : v = a✝¹ ∨ v = a✝ → u ∉ S
⊢ v = a✝¹ ∨ v = a✝ → ¬(u ∈ S ∨ u ∈ T)

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✝
⊢ fastAdmitsAux v u (S ∪ T) a✝

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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) a✝

case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)

State before:
case pred_const_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)

case pred_var_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)

case eq_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ a✝ : VarName
S : Finset VarName
h1 : v = a✝¹ ∨ v = a✝ → u ∉ S
⊢ v = a✝¹ ∨ v = a✝ → ¬(u ∈ S ∨ u ∈ T)

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✝
⊢ fastAdmitsAux v u (S ∪ T) a✝

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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) 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✝¹ ∧ fastAdmitsAux v u S a✝
⊢ fastAdmitsAux v u (S ∪ T) a✝¹ ∧ fastAdmitsAux v u (S ∪ T) a✝

case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)
Tactic:
all_goals
  tauto
State after:
no goals

State before:
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✝)
Tactic:
simp only [fastAdmitsAux] at h1
State after:
case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ fastAdmitsAux v u (S ∪ T) (def_ a✝¹ a✝)

State before:
case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ fastAdmitsAux v u (S ∪ T) (def_ a✝¹ a✝)
Tactic:
simp only [fastAdmitsAux]
State after:
case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : v = x ∨ fastAdmitsAux v u (S ∪ {x}) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ T ∪ {x}) phi
Tactic:
simp
State after:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : v = x ∨ fastAdmitsAux v u (S ∪ {x}) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : v = x ∨ fastAdmitsAux v u (S ∪ {x}) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi
Tactic:
cases h1
State after:
case inl
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h✝ : v = x
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi

case inr
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h✝ : fastAdmitsAux v u (S ∪ {x}) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : v = x
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi
Tactic:
case inl h1 =>
  tauto
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi
Tactic:
case inr h1 =>
  specialize phi_ih (S ∪ {x}) h1
  right
  simp only [Finset.union_right_comm_assoc]
  exact phi_ih
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : v = x
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi
Tactic:
tauto
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), fastAdmitsAux v u S phi → fastAdmitsAux v u (S ∪ T) phi
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi
Tactic:
specialize phi_ih (S ∪ {x}) h1
State after:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
phi_ih : fastAdmitsAux v u (S ∪ {x} ∪ T) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi

State before:
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
phi_ih : fastAdmitsAux v u (S ∪ {x} ∪ T) phi
⊢ v = x ∨ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi
Tactic:
right
State after:
case h
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
phi_ih : fastAdmitsAux v u (S ∪ {x} ∪ T) phi
⊢ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi

State before:
case h
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
phi_ih : fastAdmitsAux v u (S ∪ {x} ∪ T) phi
⊢ fastAdmitsAux v u (S ∪ (T ∪ {x})) phi
Tactic:
simp only [Finset.union_right_comm_assoc]
State after:
case h
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
phi_ih : fastAdmitsAux v u (S ∪ {x} ∪ T) phi
⊢ fastAdmitsAux v u (S ∪ {x} ∪ T) phi

State before:
case h
v u : VarName
T : Finset VarName
h2 : u ∉ T
x : VarName
phi : Formula
S : Finset VarName
h1 : fastAdmitsAux v u (S ∪ {x}) phi
phi_ih : fastAdmitsAux v u (S ∪ {x} ∪ T) phi
⊢ fastAdmitsAux v u (S ∪ {x} ∪ T) phi
Tactic:
exact phi_ih
State after:
no goals

State before:
case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → u ∉ S ∪ T
Tactic:
simp only [Finset.mem_union]
State after:
case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)

State before:
case def_
v u : VarName
T : Finset VarName
h2 : u ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ → u ∉ S
⊢ v ∈ a✝ → ¬(u ∈ S ∨ u ∈ T)
Tactic:
tauto
State after:
no goals