url stringclasses 147
values | commit stringclasses 147
values | file_path stringlengths 7 101 | full_name stringlengths 1 94 | start stringlengths 6 10 | end stringlengths 6 11 | tactic stringlengths 1 11.2k | state_before stringlengths 3 2.09M | state_after stringlengths 6 2.09M |
|---|---|---|---|---|---|---|---|---|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | push_neg | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | intros v' a1 a2 | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp only [if_neg a2] | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | exact h2 v' a1 | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tail✝ F ↔ Ho... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | unfold Function.updateITE | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | congr! 1 | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | case a.h₁.a
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | case _ =>
simp | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | apply Holds_coincide_Var | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | intro v' a1 | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp only [eq_comm] | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | have s1 :
(List.map (fun (x : VarName) =>
if v = x then V' t else V x) xs) =
(List.map (V ∘ fun (x : VarName) =>
if v = x then t else x) xs) | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | {
simp only [List.map_eq_map_iff]
intro x a2
simp
split_ifs
case _ c2 =>
apply h2
subst c2
exact h1 a2
case _ c2 =>
rfl
} | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp only [s1] | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | apply Function.updateListITE_mem_eq_len | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case h1.h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp only [List.map_eq_map_iff] | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | intro x a2 | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | split_ifs | case s1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case pos
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | case _ c2 =>
apply h2
subst c2
exact h1 a2 | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | case _ c2 =>
rfl | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | apply h2 | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | case a
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | subst c2 | case a
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I ... | case a
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | exact h1 a2 | case a
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I ... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | rfl | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp only [isFreeIn_iff_mem_freeVarSet] at a1 | case h1.h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... | case h1.h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp only [← List.mem_toFinset] | case h1.h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... | case h1.h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | exact Finset.mem_of_subset hd.h1 a1 | case h1.h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp at c1 | case h1.h2
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... | case h1.h2
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp | case h1.h2
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... | case h1.h2
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | tauto | case h1.h2
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds ... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | apply ih V binders | D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I V tl (f... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | simp only [fastAdmitsAux] | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | exact h1 | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem_aux | [1001, 1] | [1136, 17] | exact h2 | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
v t : VarName
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (binders : Finset VarName) (F : Formula),
fastAdmitsAux v t binders F →
(∀ v ∉ binders, V' v = V v) →
(Holds D I (Function.updateITE V v (V' t)) tl F ↔ Holds D I... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem | [1139, 1] | [1153, 7] | simp only [fastAdmits] at h1 | D : Type
I : Interpretation D
V : VarAssignment D
E : Env
v t : VarName
F : Formula
h1 : fastAdmits v t F
⊢ Holds D I (Function.updateITE V v (V t)) E F ↔ Holds D I V E (fastReplaceFree v t F) | D : Type
I : Interpretation D
V : VarAssignment D
E : Env
v t : VarName
F : Formula
h1 : fastAdmitsAux v t ∅ F
⊢ Holds D I (Function.updateITE V v (V t)) E F ↔ Holds D I V E (fastReplaceFree v t F) |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem | [1139, 1] | [1153, 7] | apply substitution_theorem_aux D I V V E v t ∅ F h1 | D : Type
I : Interpretation D
V : VarAssignment D
E : Env
v t : VarName
F : Formula
h1 : fastAdmitsAux v t ∅ F
⊢ Holds D I (Function.updateITE V v (V t)) E F ↔ Holds D I V E (fastReplaceFree v t F) | D : Type
I : Interpretation D
V : VarAssignment D
E : Env
v t : VarName
F : Formula
h1 : fastAdmitsAux v t ∅ F
⊢ ∀ v ∉ ∅, V v = V v |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_theorem | [1139, 1] | [1153, 7] | simp | D : Type
I : Interpretation D
V : VarAssignment D
E : Env
v t : VarName
F : Formula
h1 : fastAdmitsAux v t ∅ F
⊢ ∀ v ∉ ∅, V v = V v | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_is_valid | [1156, 1] | [1168, 11] | simp only [IsValid] at h2 | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : F.IsValid
⊢ (fastReplaceFree v t F).IsValid | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (fastReplaceFree v t F).IsValid |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_is_valid | [1156, 1] | [1168, 11] | simp only [IsValid] | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (fastReplaceFree v t F).IsValid | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (fastReplaceFree v t F) |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_is_valid | [1156, 1] | [1168, 11] | intro D I V E | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (fastReplaceFree v t F) | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I V E (fastReplaceFree v t F) |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_is_valid | [1156, 1] | [1168, 11] | simp only [← substitution_theorem D I V E v t F h1] | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I V E (fastReplaceFree v t F) | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I (Function.updateITE V v (V t)) E F |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/Admits.lean | FOL.NV.Sub.Var.One.Rec.substitution_is_valid | [1156, 1] | [1168, 11] | apply h2 | v t : VarName
F : Formula
h1 : fastAdmits v t F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I (Function.updateITE V v (V t)) E F | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | induction F generalizing binders | F : Formula
v t : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders F = F | case pred_const_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders (pred_const_ a✝¹ a✝) = pred_const_ a✝¹ a✝
case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders (pred_var... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | any_goals
simp only [replaceFreeAux] | case pred_const_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders (pred_const_ a✝¹ a✝) = pred_const_ a✝¹ a✝
case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders (pred_var... | case pred_const_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ pred_const_ a✝¹ (List.map (fun x => if v = x ∧ x ∉ binders then t else x) a✝) = pred_const_ a✝¹ a✝
case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ pred_v... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | case pred_const_ X xs | pred_var_ X xs | def_ X xs =>
simp
simp only [List.map_eq_self_iff]
simp
intro x _ a2 a3
subst a2
contradiction | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ def_ X (List.map (fun x => if v = x ∧ x ∉ binders then t else x) xs) = def_ X xs | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | case eq_ x y =>
simp
constructor
case left | right =>
intro a1 a2
subst a1
contradiction | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ eq_ (if v = x ∧ x ∉ binders then t else x) (if v = y ∧ y ∉ binders then t else y) = eq_ x y | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | case not_ phi phi_ih =>
tauto | v t : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ (replaceFreeAux v t binders phi).not_ = phi.not_ | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | 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 =>
simp
tauto | v t : VarName
phi psi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
psi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders psi = psi
binders : Finset VarName
h1 : v ∈ binders
⊢ (replaceFreeAux v t binders phi).iff_ (replaceFreeAux v t binder... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | case forall_ x phi phi_ih | exists_ x phi phi_ih =>
simp
apply phi_ih
simp
left
exact h1 | v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ exists_ x (replaceFreeAux v t (binders ∪ {x}) phi) = exists_ x phi | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp only [replaceFreeAux] | case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders (def_ a✝¹ a✝) = def_ a✝¹ a✝ | case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ def_ a✝¹ (List.map (fun x => if v = x ∧ x ∉ binders then t else x) a✝) = def_ a✝¹ a✝ |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ def_ X (List.map (fun x => if v = x ∧ x ∉ binders then t else x) xs) = def_ X xs | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ List.map (fun x => if v = x ∧ x ∉ binders then t else x) xs = xs |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp only [List.map_eq_self_iff] | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ List.map (fun x => if v = x ∧ x ∉ binders then t else x) xs = xs | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ ∀ x ∈ xs, (if v = x ∧ x ∉ binders then t else x) = x |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ ∀ x ∈ xs, (if v = x ∧ x ∉ binders then t else x) = x | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ ∀ x ∈ xs, v = x → x ∉ binders → t = x |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | intro x _ a2 a3 | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ ∀ x ∈ xs, v = x → x ∉ binders → t = x | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
x : VarName
a✝ : x ∈ xs
a2 : v = x
a3 : x ∉ binders
⊢ t = x |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | subst a2 | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
x : VarName
a✝ : x ∈ xs
a2 : v = x
a3 : x ∉ binders
⊢ t = x | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
a✝ : v ∈ xs
a3 : v ∉ binders
⊢ t = v |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | contradiction | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∈ binders
a✝ : v ∈ xs
a3 : v ∉ binders
⊢ t = v | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ eq_ (if v = x ∧ x ∉ binders then t else x) (if v = y ∧ y ∉ binders then t else y) = eq_ x y | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ (v = x → x ∉ binders → t = x) ∧ (v = y → y ∉ binders → t = y) |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | constructor | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ (v = x → x ∉ binders → t = x) ∧ (v = y → y ∉ binders → t = y) | case left
v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ v = x → x ∉ binders → t = x
case right
v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ v = y → y ∉ binders → t = y |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | case left | right =>
intro a1 a2
subst a1
contradiction | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ v = y → y ∉ binders → t = y | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | intro a1 a2 | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
⊢ v = y → y ∉ binders → t = y | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
a1 : v = y
a2 : y ∉ binders
⊢ t = y |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | subst a1 | v t x y : VarName
binders : Finset VarName
h1 : v ∈ binders
a1 : v = y
a2 : y ∉ binders
⊢ t = y | v t x : VarName
binders : Finset VarName
h1 : v ∈ binders
a2 : v ∉ binders
⊢ t = v |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | contradiction | v t x : VarName
binders : Finset VarName
h1 : v ∈ binders
a2 : v ∉ binders
⊢ t = v | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | tauto | v t : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ (replaceFreeAux v t binders phi).not_ = phi.not_ | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp | v t : VarName
phi psi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
psi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders psi = psi
binders : Finset VarName
h1 : v ∈ binders
⊢ (replaceFreeAux v t binders phi).iff_ (replaceFreeAux v t binder... | v t : VarName
phi psi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
psi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders psi = psi
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders phi = phi ∧ replaceFreeAux v t binder... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | tauto | v t : VarName
phi psi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
psi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders psi = psi
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t binders phi = phi ∧ replaceFreeAux v t binder... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp | v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ exists_ x (replaceFreeAux v t (binders ∪ {x}) phi) = exists_ x phi | v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t (binders ∪ {x}) phi = phi |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | apply phi_ih | v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ replaceFreeAux v t (binders ∪ {x}) phi = phi | case h1
v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ v ∈ binders ∪ {x} |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | simp | case h1
v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ v ∈ binders ∪ {x} | case h1
v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ v ∈ binders ∨ v = x |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | left | case h1
v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ v ∈ binders ∨ v = x | case h1.h
v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ v ∈ binders |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_mem_binders | [122, 1] | [160, 13] | exact h1 | case h1.h
v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∈ binders → replaceFreeAux v t binders phi = phi
binders : Finset VarName
h1 : v ∈ binders
⊢ v ∈ binders | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | induction F generalizing binders | F : Formula
v t : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders F = fastReplaceFree v t F | case pred_const_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (pred_const_ a✝¹ a✝) = fastReplaceFree v t (pred_const_ a✝¹ a✝)
case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | any_goals
simp only [replaceFreeAux]
simp only [fastReplaceFree] | case pred_const_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (pred_const_ a✝¹ a✝) = fastReplaceFree v t (pred_const_ a✝¹ a✝)
case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux... | case pred_const_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ pred_const_ a✝¹ (List.map (fun x => if v = x ∧ x ∉ binders then t else x) a✝) =
pred_const_ a✝¹ (List.map (fun x => if v = x then t else x) a✝)
case pred_var_
v t : VarName
a✝¹ : PredName
a✝ : List VarName
b... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case pred_const_ X xs | pred_var_ X xs | def_ X xs =>
congr!
case _ x =>
constructor
case mp =>
tauto
case mpr =>
intro a1
subst a1
tauto | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ def_ X (List.map (fun x => if v = x ∧ x ∉ binders then t else x) xs) =
def_ X (List.map (fun x => if v = x then t else x) xs) | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case eq_ x y =>
congr!
case _ | _ =>
constructor
case mp =>
tauto
case mpr =>
intro a1
subst a1
tauto | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ eq_ (if v = x ∧ x ∉ binders then t else x) (if v = y ∧ y ∉ binders then t else y) =
eq_ (if v = x then t else x) (if v = y then t else y) | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case not_ phi phi_ih =>
tauto | v t : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders phi = fastReplaceFree v t phi
binders : Finset VarName
h1 : v ∉ binders
⊢ (replaceFreeAux v t binders phi).not_ = (fastReplaceFree v t phi).not_ | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | 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 =>
simp
tauto | v t : VarName
phi psi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders phi = fastReplaceFree v t phi
psi_ih : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders psi = fastReplaceFree v t psi
binders : Finset VarName
h1 : v ∉ binders
⊢ (replaceFreeAux v t bind... | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case forall_ x phi phi_ih | exists_ x phi phi_ih =>
split_ifs
case pos c1 =>
congr! 1
apply replaceFreeAux_mem_binders
simp
right
exact c1
case neg c1 =>
congr! 1
apply phi_ih
simp
tauto | v t x : VarName
phi : Formula
phi_ih : ∀ (binders : Finset VarName), v ∉ binders → replaceFreeAux v t binders phi = fastReplaceFree v t phi
binders : Finset VarName
h1 : v ∉ binders
⊢ exists_ x (replaceFreeAux v t (binders ∪ {x}) phi) =
if v = x then exists_ x phi else exists_ x (fastReplaceFree v t phi) | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | simp only [replaceFreeAux] | case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ replaceFreeAux v t binders (def_ a✝¹ a✝) = fastReplaceFree v t (def_ a✝¹ a✝) | case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ def_ a✝¹ (List.map (fun x => if v = x ∧ x ∉ binders then t else x) a✝) = fastReplaceFree v t (def_ a✝¹ a✝) |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | simp only [fastReplaceFree] | case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ def_ a✝¹ (List.map (fun x => if v = x ∧ x ∉ binders then t else x) a✝) = fastReplaceFree v t (def_ a✝¹ a✝) | case def_
v t : VarName
a✝¹ : DefName
a✝ : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ def_ a✝¹ (List.map (fun x => if v = x ∧ x ∉ binders then t else x) a✝) =
def_ a✝¹ (List.map (fun x => if v = x then t else x) a✝) |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | congr! | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ def_ X (List.map (fun x => if v = x ∧ x ∉ binders then t else x) xs) =
def_ X (List.map (fun x => if v = x then t else x) xs) | case h.e'_2.h.e'_3.h.h₁.a
v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x✝ : VarName
⊢ v = x✝ ∧ x✝ ∉ binders ↔ v = x✝ |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case _ x =>
constructor
case mp =>
tauto
case mpr =>
intro a1
subst a1
tauto | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x ∧ x ∉ binders ↔ v = x | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | constructor | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x ∧ x ∉ binders ↔ v = x | case mp
v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x ∧ x ∉ binders → v = x
case mpr
v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x → v = x ∧ x ∉ binders |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case mp =>
tauto | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x ∧ x ∉ binders → v = x | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case mpr =>
intro a1
subst a1
tauto | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x → v = x ∧ x ∉ binders | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | tauto | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x ∧ x ∉ binders → v = x | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | intro a1 | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
⊢ v = x → v = x ∧ x ∉ binders | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
a1 : v = x
⊢ v = x ∧ x ∉ binders |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | subst a1 | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
x : VarName
a1 : v = x
⊢ v = x ∧ x ∉ binders | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = v ∧ v ∉ binders |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | tauto | v t : VarName
X : DefName
xs : List VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = v ∧ v ∉ binders | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | congr! | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ eq_ (if v = x ∧ x ∉ binders then t else x) (if v = y ∧ y ∉ binders then t else y) =
eq_ (if v = x then t else x) (if v = y then t else y) | case h.e'_1.h₁.a
v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = x ∧ x ∉ binders ↔ v = x
case h.e'_2.h₁.a
v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y ∧ y ∉ binders ↔ v = y |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case _ | _ =>
constructor
case mp =>
tauto
case mpr =>
intro a1
subst a1
tauto | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y ∧ y ∉ binders ↔ v = y | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | constructor | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y ∧ y ∉ binders ↔ v = y | case mp
v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y ∧ y ∉ binders → v = y
case mpr
v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y → v = y ∧ y ∉ binders |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case mp =>
tauto | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y ∧ y ∉ binders → v = y | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | case mpr =>
intro a1
subst a1
tauto | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y → v = y ∧ y ∉ binders | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | tauto | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y ∧ y ∉ binders → v = y | no goals |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | intro a1 | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = y → v = y ∧ y ∉ binders | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
a1 : v = y
⊢ v = y ∧ y ∉ binders |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | subst a1 | v t x y : VarName
binders : Finset VarName
h1 : v ∉ binders
a1 : v = y
⊢ v = y ∧ y ∉ binders | v t x : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = v ∧ v ∉ binders |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/One/Rec/ReplaceFree.lean | FOL.NV.Sub.Var.One.Rec.replaceFreeAux_eq_fastReplaceFree | [163, 1] | [216, 12] | tauto | v t x : VarName
binders : Finset VarName
h1 : v ∉ binders
⊢ v = v ∧ v ∉ binders | no goals |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.