Theorem: FOL.NV.Sub.Var.One.Rec.free_and_bound_unchanged_imp_fastAdmitsAux
Proof state before:
case pred_const_
v u : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (pred_const_ a✝¹ a✝) = toIsBoundAux binders (fastReplaceFree v u (pred_const_ a✝¹ a✝))
⊢ fastAdmitsAux v u binders (pred_const_ a✝¹ a✝)

case pred_var_
v u : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (pred_var_ a✝¹ a✝) = toIsBoundAux binders (fastReplaceFree v u (pred_var_ a✝¹ a✝))
⊢ fastAdmitsAux v u binders (pred_var_ a✝¹ a✝)

case eq_
v u a✝¹ a✝ : VarName
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (eq_ a✝¹ a✝) = toIsBoundAux binders (fastReplaceFree v u (eq_ a✝¹ a✝))
⊢ fastAdmitsAux v u binders (eq_ a✝¹ a✝)

case true_
v u : VarName
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders true_ = toIsBoundAux binders (fastReplaceFree v u true_)
⊢ fastAdmitsAux v u binders true_

case false_
v u : VarName
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders false_ = toIsBoundAux binders (fastReplaceFree v u false_)
⊢ fastAdmitsAux v u binders false_

case not_
v u : VarName
a✝ : Formula
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders a✝.not_ = toIsBoundAux binders (fastReplaceFree v u a✝.not_)
⊢ fastAdmitsAux v u binders a✝.not_

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

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

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

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

case forall_
v u a✝¹ : VarName
a✝ : Formula
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (forall_ a✝¹ a✝) = toIsBoundAux binders (fastReplaceFree v u (forall_ a✝¹ a✝))
⊢ fastAdmitsAux v u binders (forall_ a✝¹ a✝)

case exists_
v u a✝¹ : VarName
a✝ : Formula
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (exists_ a✝¹ a✝) = toIsBoundAux binders (fastReplaceFree v u (exists_ a✝¹ a✝))
⊢ fastAdmitsAux v u binders (exists_ a✝¹ a✝)

case def_
v u : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (def_ a✝¹ a✝) = toIsBoundAux binders (fastReplaceFree v u (def_ a✝¹ a✝))
⊢ fastAdmitsAux v u binders (def_ a✝¹ a✝)
Tactic:
all_goals
  simp only [fastReplaceFree] at h2
  simp only [fastAdmitsAux]
Proof state after:
case pred_const_
v u : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
h2 :
  toIsBoundAux binders (pred_const_ a✝¹ a✝) =
    toIsBoundAux binders (pred_const_ a✝¹ (List.map (fun x => if v = x then u else x) a✝))
⊢ v ∈ a✝ → u ∉ binders

case pred_var_
v u : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
h2 :
  toIsBoundAux binders (pred_var_ a✝¹ a✝) =
    toIsBoundAux binders (pred_var_ a✝¹ (List.map (fun x => if v = x then u else x) a✝))
⊢ v ∈ a✝ → u ∉ binders

case eq_
v u a✝¹ a✝ : VarName
binders : Finset VarName
h1 : v ∉ binders
h2 :
  toIsBoundAux binders (eq_ a✝¹ a✝) = toIsBoundAux binders (eq_ (if v = a✝¹ then u else a✝¹) (if v = a✝ then u else a✝))
⊢ v = a✝¹ ∨ v = a✝ → u ∉ binders

case not_
v u : VarName
a✝ : Formula
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders a✝.not_ = toIsBoundAux binders (fastReplaceFree v u a✝).not_
⊢ fastAdmitsAux v u binders a✝

case imp_
v u : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName),
    v ∉ binders →
      toIsBoundAux binders a✝¹ = toIsBoundAux binders (fastReplaceFree v u a✝¹) → fastAdmitsAux v u binders a✝¹
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (a✝¹.imp_ a✝) = toIsBoundAux binders ((fastReplaceFree v u a✝¹).imp_ (fastReplaceFree v u a✝))
⊢ fastAdmitsAux v u binders a✝¹ ∧ fastAdmitsAux v u binders a✝

case and_
v u : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName),
    v ∉ binders →
      toIsBoundAux binders a✝¹ = toIsBoundAux binders (fastReplaceFree v u a✝¹) → fastAdmitsAux v u binders a✝¹
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (a✝¹.and_ a✝) = toIsBoundAux binders ((fastReplaceFree v u a✝¹).and_ (fastReplaceFree v u a✝))
⊢ fastAdmitsAux v u binders a✝¹ ∧ fastAdmitsAux v u binders a✝

case or_
v u : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName),
    v ∉ binders →
      toIsBoundAux binders a✝¹ = toIsBoundAux binders (fastReplaceFree v u a✝¹) → fastAdmitsAux v u binders a✝¹
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (a✝¹.or_ a✝) = toIsBoundAux binders ((fastReplaceFree v u a✝¹).or_ (fastReplaceFree v u a✝))
⊢ fastAdmitsAux v u binders a✝¹ ∧ fastAdmitsAux v u binders a✝

case iff_
v u : VarName
a✝¹ a✝ : Formula
a_ih✝¹ :
  ∀ (binders : Finset VarName),
    v ∉ binders →
      toIsBoundAux binders a✝¹ = toIsBoundAux binders (fastReplaceFree v u a✝¹) → fastAdmitsAux v u binders a✝¹
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 : toIsBoundAux binders (a✝¹.iff_ a✝) = toIsBoundAux binders ((fastReplaceFree v u a✝¹).iff_ (fastReplaceFree v u a✝))
⊢ fastAdmitsAux v u binders a✝¹ ∧ fastAdmitsAux v u binders a✝

case forall_
v u a✝¹ : VarName
a✝ : Formula
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 :
  toIsBoundAux binders (forall_ a✝¹ a✝) =
    toIsBoundAux binders (if v = a✝¹ then forall_ a✝¹ a✝ else forall_ a✝¹ (fastReplaceFree v u a✝))
⊢ v = a✝¹ ∨ fastAdmitsAux v u (binders ∪ {a✝¹}) a✝

case exists_
v u a✝¹ : VarName
a✝ : Formula
a_ih✝ :
  ∀ (binders : Finset VarName),
    v ∉ binders → toIsBoundAux binders a✝ = toIsBoundAux binders (fastReplaceFree v u a✝) → fastAdmitsAux v u binders a✝
binders : Finset VarName
h1 : v ∉ binders
h2 :
  toIsBoundAux binders (exists_ a✝¹ a✝) =
    toIsBoundAux binders (if v = a✝¹ then exists_ a✝¹ a✝ else exists_ a✝¹ (fastReplaceFree v u a✝))
⊢ v = a✝¹ ∨ fastAdmitsAux v u (binders ∪ {a✝¹}) a✝

case def_
v u : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
h2 :
  toIsBoundAux binders (def_ a✝¹ a✝) = toIsBoundAux binders (def_ a✝¹ (List.map (fun x => if v = x then u else x) a✝))
⊢ v ∈ a✝ → u ∉ binders