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

State before:
F : Formula
v u : VarName
S T : Finset VarName
h1 : admitsAux v u (S ∪ T) F
h2 : v ∉ T
⊢ admitsAux v u S F
Tactic:
induction F generalizing S
State after:
case pred_const_
v u : VarName
T : Finset VarName
h2 : v ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : admitsAux v u (S ∪ T) (pred_const_ a✝¹ a✝)
⊢ admitsAux v u S (pred_const_ a✝¹ a✝)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

case def_
v u : VarName
T : Finset VarName
h2 : v ∉ T
a✝¹ : DefName
a✝ : List VarName
S : Finset VarName
h1 : admitsAux v u (S ∪ T) (def_ a✝¹ a✝)
⊢ admitsAux v u S (def_ a✝¹ a✝)
Tactic:
all_goals
  simp only [admitsAux] at h1
  simp only [admitsAux]
State after:
case pred_const_
v u : VarName
T : Finset VarName
h2 : v ∉ T
a✝¹ : PredName
a✝ : List VarName
S : Finset VarName
h1 : v ∈ a✝ ∧ v ∉ S ∪ T → u ∉ S ∪ T
⊢ v ∈ a✝ ∧ v ∉ S → u ∉ S

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

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

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

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

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

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

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

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

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

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

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
X : DefName
xs : List VarName
S : Finset VarName
h1 : v ∈ xs ∧ v ∉ S ∪ T → u ∉ S ∪ T
⊢ v ∈ xs ∧ v ∉ S → u ∉ S
Tactic:
case pred_const_ X xs | pred_var_ X xs | eq_ x y | def_ X xs =>
  simp at h1
  tauto
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
phi : Formula
phi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) phi → admitsAux v u S phi
S : Finset VarName
h1 : admitsAux v u (S ∪ T) phi
⊢ admitsAux v u S phi
Tactic:
case not_ phi phi_ih =>
  exact phi_ih S h1
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
phi psi : Formula
phi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) phi → admitsAux v u S phi
psi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) psi → admitsAux v u S psi
S : Finset VarName
h1 : admitsAux v u (S ∪ T) phi ∧ admitsAux v u (S ∪ T) psi
⊢ admitsAux v u S phi ∧ admitsAux v u S psi
Tactic:
case
    imp_ phi psi phi_ih psi_ih
  | and_ phi psi phi_ih psi_ih
  | or_ phi psi phi_ih psi_ih
  | iff_ phi psi phi_ih psi_ih =>
  tauto
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) phi → admitsAux v u S phi
S : Finset VarName
h1 : admitsAux v u (S ∪ T ∪ {x}) phi
⊢ admitsAux v u (S ∪ {x}) phi
Tactic:
case forall_ x phi phi_ih | exists_ x phi phi_ih =>
  simp only [Finset.union_right_comm S T {x}] at h1
  tauto
State after:
no goals

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

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

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
X : DefName
xs : List VarName
S : Finset VarName
h1 : v ∈ xs ∧ v ∉ S ∪ T → u ∉ S ∪ T
⊢ v ∈ xs ∧ v ∉ S → u ∉ S
Tactic:
simp at h1
State after:
v u : VarName
T : Finset VarName
h2 : v ∉ T
X : DefName
xs : List VarName
S : Finset VarName
h1 : v ∈ xs → v ∉ S → v ∉ T → u ∉ S ∧ u ∉ T
⊢ v ∈ xs ∧ v ∉ S → u ∉ S

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
X : DefName
xs : List VarName
S : Finset VarName
h1 : v ∈ xs → v ∉ S → v ∉ T → u ∉ S ∧ u ∉ T
⊢ v ∈ xs ∧ v ∉ S → u ∉ S
Tactic:
tauto
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
phi : Formula
phi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) phi → admitsAux v u S phi
S : Finset VarName
h1 : admitsAux v u (S ∪ T) phi
⊢ admitsAux v u S phi
Tactic:
exact phi_ih S h1
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
phi psi : Formula
phi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) phi → admitsAux v u S phi
psi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) psi → admitsAux v u S psi
S : Finset VarName
h1 : admitsAux v u (S ∪ T) phi ∧ admitsAux v u (S ∪ T) psi
⊢ admitsAux v u S phi ∧ admitsAux v u S psi
Tactic:
tauto
State after:
no goals

State before:
v u : VarName
T : Finset VarName
h2 : v ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) phi → admitsAux v u S phi
S : Finset VarName
h1 : admitsAux v u (S ∪ T ∪ {x}) phi
⊢ admitsAux v u (S ∪ {x}) phi
Tactic:
simp only [Finset.union_right_comm S T {x}] at h1
State after:
v u : VarName
T : Finset VarName
h2 : v ∉ T
x : VarName
phi : Formula
phi_ih : ∀ (S : Finset VarName), admitsAux v u (S ∪ T) phi → admitsAux v u S phi
S : Finset VarName
h1 : admitsAux v u (S ∪ {x} ∪ T) phi
⊢ admitsAux v u (S ∪ {x}) phi

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