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

State before:
F : Formula
v : VarName
binders : Finset VarName
⊢ admitsAux v v binders F
Tactic:
induction F generalizing binders
State after:
case pred_const_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ admitsAux v v binders (pred_const_ a✝¹ a✝)

case pred_var_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ admitsAux v v binders (pred_var_ a✝¹ a✝)

case eq_
v a✝¹ a✝ : VarName
binders : Finset VarName
⊢ admitsAux v v binders (eq_ a✝¹ a✝)

case true_
v : VarName
binders : Finset VarName
⊢ admitsAux v v binders true_

case false_
v : VarName
binders : Finset VarName
⊢ admitsAux v v binders false_

case not_
v : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝.not_

case imp_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.imp_ a✝)

case and_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.and_ a✝)

case or_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.or_ a✝)

case iff_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.iff_ a✝)

case forall_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (forall_ a✝¹ a✝)

case exists_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (exists_ a✝¹ a✝)

case def_
v : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
⊢ admitsAux v v binders (def_ a✝¹ a✝)

State before:
case pred_const_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ admitsAux v v binders (pred_const_ a✝¹ a✝)

case pred_var_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ admitsAux v v binders (pred_var_ a✝¹ a✝)

case eq_
v a✝¹ a✝ : VarName
binders : Finset VarName
⊢ admitsAux v v binders (eq_ a✝¹ a✝)

case true_
v : VarName
binders : Finset VarName
⊢ admitsAux v v binders true_

case false_
v : VarName
binders : Finset VarName
⊢ admitsAux v v binders false_

case not_
v : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝.not_

case imp_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.imp_ a✝)

case and_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.and_ a✝)

case or_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.or_ a✝)

case iff_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (a✝¹.iff_ a✝)

case forall_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (forall_ a✝¹ a✝)

case exists_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders (exists_ a✝¹ a✝)

case def_
v : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
⊢ admitsAux v v binders (def_ a✝¹ a✝)
Tactic:
all_goals
  simp only [admitsAux]
State after:
case pred_const_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders

case pred_var_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders

case eq_
v a✝¹ a✝ : VarName
binders : Finset VarName
⊢ (v = a✝¹ ∨ v = a✝) ∧ v ∉ binders → v ∉ binders

case not_
v : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝

case imp_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case and_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case or_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case iff_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case forall_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v (binders ∪ {a✝¹}) a✝

case exists_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v (binders ∪ {a✝¹}) a✝

case def_
v : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders

State before:
case pred_const_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders

case pred_var_
v : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders

case eq_
v a✝¹ a✝ : VarName
binders : Finset VarName
⊢ (v = a✝¹ ∨ v = a✝) ∧ v ∉ binders → v ∉ binders

case not_
v : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝

case imp_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case and_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case or_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case iff_
v : VarName
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (binders : Finset VarName), admitsAux v v binders a✝¹
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v binders a✝¹ ∧ admitsAux v v binders a✝

case forall_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v (binders ∪ {a✝¹}) a✝

case exists_
v a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (binders : Finset VarName), admitsAux v v binders a✝
binders : Finset VarName
⊢ admitsAux v v (binders ∪ {a✝¹}) a✝

case def_
v : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders
Tactic:
all_goals
  tauto
State after:
no goals

State before:
case def_
v : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
⊢ admitsAux v v binders (def_ a✝¹ a✝)
Tactic:
simp only [admitsAux]
State after:
case def_
v : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders

State before:
case def_
v : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
⊢ v ∈ a✝ ∧ v ∉ binders → v ∉ binders
Tactic:
tauto
State after:
no goals