Theorem: LN.FormulaOpenFreeVarSet' (FOL/LN/Paper.lean)

State before:
j : ℕ
z : String
F : Formula
⊢ F.freeVarSet ⊆ (Formula.open j (free_ z) F).freeVarSet
Tactic:
induction F generalizing j
State after:
case pred_
z a✝¹ : String
a✝ : List Var
j : ℕ
⊢ (pred_ a✝¹ a✝).freeVarSet ⊆ (Formula.open j (free_ z) (pred_ a✝¹ a✝)).freeVarSet

case not_
z : String
a✝ : Formula
a_ih✝ : ∀ (j : ℕ), a✝.freeVarSet ⊆ (Formula.open j (free_ z) a✝).freeVarSet
j : ℕ
⊢ a✝.not_.freeVarSet ⊆ (Formula.open j (free_ z) a✝.not_).freeVarSet

case imp_
z : String
a✝¹ a✝ : Formula
a_ih✝¹ : ∀ (j : ℕ), a✝¹.freeVarSet ⊆ (Formula.open j (free_ z) a✝¹).freeVarSet
a_ih✝ : ∀ (j : ℕ), a✝.freeVarSet ⊆ (Formula.open j (free_ z) a✝).freeVarSet
j : ℕ
⊢ (a✝¹.imp_ a✝).freeVarSet ⊆ (Formula.open j (free_ z) (a✝¹.imp_ a✝)).freeVarSet

case forall_
z a✝¹ : String
a✝ : Formula
a_ih✝ : ∀ (j : ℕ), a✝.freeVarSet ⊆ (Formula.open j (free_ z) a✝).freeVarSet
j : ℕ
⊢ (forall_ a✝¹ a✝).freeVarSet ⊆ (Formula.open j (free_ z) (forall_ a✝¹ a✝)).freeVarSet

State before:
z : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.not_.freeVarSet ⊆ (Formula.open j (free_ z) phi.not_).freeVarSet
Tactic:
case not_ phi phi_ih =>
  simp only [Formula.open]
  simp only [Formula.freeVarSet]
  apply phi_ih
State after:
no goals

State before:
z x : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ (forall_ x phi).freeVarSet ⊆ (Formula.open j (free_ z) (forall_ x phi)).freeVarSet
Tactic:
case forall_ x phi phi_ih =>
  simp only [Formula.open]
  simp only [Formula.freeVarSet]
  apply phi_ih
State after:
no goals

State before:
z X : String
vs : List Var
j : ℕ
⊢ (pred_ X vs).freeVarSet ⊆ (Formula.open j (free_ z) (pred_ X vs)).freeVarSet
Tactic:
simp only [Formula.open]
State after:
z X : String
vs : List Var
j : ℕ
⊢ (pred_ X vs).freeVarSet ⊆ (pred_ X (List.map (Var.open j (free_ z)) vs)).freeVarSet

State before:
z X : String
vs : List Var
j : ℕ
⊢ (pred_ X vs).freeVarSet ⊆ (pred_ X (List.map (Var.open j (free_ z)) vs)).freeVarSet
Tactic:
simp only [Formula.freeVarSet]
State after:
z X : String
vs : List Var
j : ℕ
⊢ vs.toFinset.biUnion Var.freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet

State before:
z X : String
vs : List Var
j : ℕ
⊢ vs.toFinset.biUnion Var.freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet
Tactic:
simp
State after:
z X : String
vs : List Var
j : ℕ
⊢ ∀ x ∈ vs, x.freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet

State before:
z X : String
vs : List Var
j : ℕ
⊢ ∀ x ∈ vs, x.freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet
Tactic:
intro v a1
State after:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ v.freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet

State before:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ v.freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet
Tactic:
trans Var.freeVarSet (Var.open j (free_ z) v)
State after:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ v.freeVarSet ⊆ (Var.open j (free_ z) v).freeVarSet

z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ (Var.open j (free_ z) v).freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet

State before:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ v.freeVarSet ⊆ (Var.open j (free_ z) v).freeVarSet
Tactic:
apply VarOpenFreeVarSet'
State after:
no goals

State before:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ (Var.open j (free_ z) v).freeVarSet ⊆ (List.map (Var.open j (free_ z)) vs).toFinset.biUnion Var.freeVarSet
Tactic:
apply Finset.subset_biUnion_of_mem Var.freeVarSet
State after:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ Var.open j (free_ z) v ∈ (List.map (Var.open j (free_ z)) vs).toFinset

State before:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ Var.open j (free_ z) v ∈ (List.map (Var.open j (free_ z)) vs).toFinset
Tactic:
apply List.mem_toFinset.mpr
State after:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ Var.open j (free_ z) v ∈ List.map (Var.open j (free_ z)) vs

State before:
z X : String
vs : List Var
j : ℕ
v : Var
a1 : v ∈ vs
⊢ Var.open j (free_ z) v ∈ List.map (Var.open j (free_ z)) vs
Tactic:
exact List.mem_map_of_mem (Var.open j (free_ z)) a1
State after:
no goals

State before:
z : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.not_.freeVarSet ⊆ (Formula.open j (free_ z) phi.not_).freeVarSet
Tactic:
simp only [Formula.open]
State after:
z : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.not_.freeVarSet ⊆ (Formula.open j (free_ z) phi).not_.freeVarSet

State before:
z : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.not_.freeVarSet ⊆ (Formula.open j (free_ z) phi).not_.freeVarSet
Tactic:
simp only [Formula.freeVarSet]
State after:
z : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet

State before:
z : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
Tactic:
apply phi_ih
State after:
no goals

State before:
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ (phi.imp_ psi).freeVarSet ⊆ (Formula.open j (free_ z) (phi.imp_ psi)).freeVarSet
Tactic:
simp only [Formula.open]
State after:
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ (phi.imp_ psi).freeVarSet ⊆ ((Formula.open j (free_ z) phi).imp_ (Formula.open j (free_ z) psi)).freeVarSet

State before:
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ (phi.imp_ psi).freeVarSet ⊆ ((Formula.open j (free_ z) phi).imp_ (Formula.open j (free_ z) psi)).freeVarSet
Tactic:
simp only [Formula.freeVarSet]
State after:
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ∪ psi.freeVarSet ⊆
    (Formula.open j (free_ z) phi).freeVarSet ∪ (Formula.open j (free_ z) psi).freeVarSet

State before:
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ∪ psi.freeVarSet ⊆
    (Formula.open j (free_ z) phi).freeVarSet ∪ (Formula.open j (free_ z) psi).freeVarSet
Tactic:
apply Finset.union_subset_left_right
State after:
case h1
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet

case h2
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet

State before:
case h1
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
Tactic:
exact phi_ih j
State after:
no goals

State before:
case h2
z : String
phi psi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
psi_ih : ∀ (j : ℕ), psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
j : ℕ
⊢ psi.freeVarSet ⊆ (Formula.open j (free_ z) psi).freeVarSet
Tactic:
exact psi_ih j
State after:
no goals

State before:
z x : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ (forall_ x phi).freeVarSet ⊆ (Formula.open j (free_ z) (forall_ x phi)).freeVarSet
Tactic:
simp only [Formula.open]
State after:
z x : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ (forall_ x phi).freeVarSet ⊆ (forall_ x (Formula.open (j + 1) (free_ z) phi)).freeVarSet

State before:
z x : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ (forall_ x phi).freeVarSet ⊆ (forall_ x (Formula.open (j + 1) (free_ z) phi)).freeVarSet
Tactic:
simp only [Formula.freeVarSet]
State after:
z x : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ⊆ (Formula.open (j + 1) (free_ z) phi).freeVarSet

State before:
z x : String
phi : Formula
phi_ih : ∀ (j : ℕ), phi.freeVarSet ⊆ (Formula.open j (free_ z) phi).freeVarSet
j : ℕ
⊢ phi.freeVarSet ⊆ (Formula.open (j + 1) (free_ z) phi).freeVarSet
Tactic:
apply phi_ih
State after:
no goals