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 | input stringlengths 73 2.09M |
|---|---|---|---|---|---|---|---|---|---|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [admitsAux] at h1 | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [replace] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [Holds] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | cases h1 | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case intro
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tai... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | congr! 1 | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case a.h.e'_1.a
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref :... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | exact phi_ih V binders h1_left h2 | case a.h.e'_1.a
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref :... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binder... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | exact psi_ih V binders h1_right h2 | case a.h.e'_2.a
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref :... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_2.a
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binder... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [admitsAux] at h1 | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [replace] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [Holds] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | first | apply forall_congr' | apply exists_congr | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | intro d | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | apply phi_ih (Function.updateITE V x d) (binders ∪ {x}) h1 | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | intro v a1 | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [Function.updateITE] | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp at a1 | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | push_neg at a1 | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | cases a1 | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h.intro
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := t... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | case h.intro a1_left a1_right =>
simp only [if_neg a1_right]
exact h2 v a1_left | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | apply forall_congr' | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | apply exists_congr | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | case h
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [if_neg a1_right] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | exact h2 v a1_left | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tail✝;
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [replace] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
⊢ Holds D (I' D I V' E_ref P zs H) V E_ref (def_ X xs) ↔ Hol... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
⊢ Holds D (I' D I V' E_ref P zs H) V E_ref (def_ X xs) ↔ Hol... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [E_ref] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
⊢ Holds D (I' D I V' E_ref P zs H) V E_ref (def_ X xs) ↔ Hol... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
⊢ Holds D (I' D I V' [] P zs H) V [] (def_ X xs) ↔ Holds D I... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [Holds] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
⊢ Holds D (I' D I V' [] P zs H) V [] (def_ X xs) ↔ Holds D I... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
E_ref : Env := []
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [replace] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [E_ref] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [Holds] | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | split_ifs | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | case pos
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | specialize ih (Function.updateListITE V hd.args (List.map V xs)) hd.q | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = hd.name ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [replace_no_predVar P zs H hd.q hd.h2] at ih | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = hd.name ... | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = hd.name ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | apply Holds_coincide_PredVar | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = hd.name ... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [I'] | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [Interpretation.usingPred] | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [predVarOccursIn_iff_mem_predVarSet] | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [hd.h2] | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H binders (def_ X xs)
h2 : ∀ x ∉ binders, V x = V' x
c1 : X = ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
E_ref : Env := hd :: tl
X : DefName
xs : List VarName
V : VarAssignment D
binders : Finset VarName
h1 : admitsAux P zs H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | apply Holds_coincide_PredVar | D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds D (I' D ... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [I'] | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds ... | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ b... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [Interpretation.usingPred] | case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ b... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp only [predVarOccursIn] | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds ... | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ b... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem_aux | [188, 1] | [334, 13] | simp | case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ binders, V x = V' x) →
let E_ref := tl;
Holds ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I : Interpretation D
V' : VarAssignment D
P : PredName
zs : List VarName
H : Formula
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula) (binders : Finset VarName),
admitsAux P zs H binders F →
(∀ x ∉ b... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem | [337, 1] | [352, 9] | apply substitution_theorem_aux D I V V E F P zs H ∅ | D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ Holds D (I' D I V E P zs H) V E F ↔ Holds D I V E (replace P zs H F) | case h1
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ admitsAux P zs H ∅ F
case h2
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ ∀ x ∉ ∅, V... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ Holds D (I' D I V E P zs H) V E F ↔ Holds D I V E (replace P zs H F)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem | [337, 1] | [352, 9] | exact h1 | case h1
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ admitsAux P zs H ∅ F | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ admitsAux P zs H ∅ F
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_theorem | [337, 1] | [352, 9] | simp | case h2
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ ∀ x ∉ ∅, V x = V x | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
⊢ ∀ x ∉ ∅, V x = V x
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_is_valid | [355, 1] | [369, 11] | simp only [IsValid] at h2 | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
h2 : F.IsValid
⊢ (replace P zs H F).IsValid | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (replace P zs H F).IsValid | Please generate a tactic in lean4 to solve the state.
STATE:
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
h2 : F.IsValid
⊢ (replace P zs H F).IsValid
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_is_valid | [355, 1] | [369, 11] | simp only [IsValid] | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (replace P zs H F).IsValid | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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 (replace P zs H F) | Please generate a tactic in lean4 to solve the state.
STATE:
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H F
h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (replace P zs H F).IsValid
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_is_valid | [355, 1] | [369, 11] | intro D I V E | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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 (replace P zs H F) | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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 (replace P zs H F) | Please generate a tactic in lean4 to solve the state.
STATE:
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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 (replace... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_is_valid | [355, 1] | [369, 11] | simp only [← substitution_theorem D I V E F P zs H h1] | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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 (replace P zs H F) | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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' D I V E P zs H) V E F | Please generate a tactic in lean4 to solve the state.
STATE:
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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 (replace P zs H F)
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/One/Rec/Sub.lean | FOL.NV.Sub.Pred.One.Rec.substitution_is_valid | [355, 1] | [369, 11] | apply h2 | F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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' D I V E P zs H) V E F | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
F : Formula
P : PredName
zs : List VarName
H : Formula
h1 : admits P zs H 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' D I V E P zs H) V E F... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | induction F | v : Var
F : Formula
⊢ occursIn v F ↔ v ∈ F.varSet | case pred_
v : Var
a✝¹ : String
a✝ : List Var
⊢ occursIn v (pred_ a✝¹ a✝) ↔ v ∈ (pred_ a✝¹ a✝).varSet
case not_
v : Var
a✝ : Formula
a_ih✝ : occursIn v a✝ ↔ v ∈ a✝.varSet
⊢ occursIn v a✝.not_ ↔ v ∈ a✝.not_.varSet
case imp_
v : Var
a✝¹ a✝ : Formula
a_ih✝¹ : occursIn v a✝¹ ↔ v ∈ a✝¹.varSet
a_ih✝ : occursIn v a✝ ↔ v ∈ a... | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
F : Formula
⊢ occursIn v F ↔ v ∈ F.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | case pred_ X vs =>
simp only [occursIn]
simp only [varSet]
simp | v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ↔ v ∈ (pred_ X vs).varSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ↔ v ∈ (pred_ X vs).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | case not_ phi phi_ih =>
simp only [occursIn]
simp only [varSet]
exact phi_ih | v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi.not_ ↔ v ∈ phi.not_.varSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi.not_ ↔ v ∈ phi.not_.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | case imp_ phi psi phi_ih psi_ih =>
simp only [occursIn]
simp only [varSet]
simp
congr! | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v (phi.imp_ psi) ↔ v ∈ (phi.imp_ psi).varSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v (phi.imp_ psi) ↔ v ∈ (phi.imp_ psi).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | case forall_ _ phi phi_ih =>
simp only [occursIn]
simp only [varSet]
exact phi_ih | v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v (forall_ a✝ phi) ↔ v ∈ (forall_ a✝ phi).varSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v (forall_ a✝ phi) ↔ v ∈ (forall_ a✝ phi).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [occursIn] | v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ↔ v ∈ (pred_ X vs).varSet | v : Var
X : String
vs : List Var
⊢ v ∈ vs ↔ v ∈ (pred_ X vs).varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ↔ v ∈ (pred_ X vs).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [varSet] | v : Var
X : String
vs : List Var
⊢ v ∈ vs ↔ v ∈ (pred_ X vs).varSet | v : Var
X : String
vs : List Var
⊢ v ∈ vs ↔ v ∈ vs.toFinset | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ v ∈ vs ↔ v ∈ (pred_ X vs).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp | v : Var
X : String
vs : List Var
⊢ v ∈ vs ↔ v ∈ vs.toFinset | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ v ∈ vs ↔ v ∈ vs.toFinset
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [occursIn] | v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi.not_ ↔ v ∈ phi.not_.varSet | v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.not_.varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi.not_ ↔ v ∈ phi.not_.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [varSet] | v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.not_.varSet | v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.not_.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | exact phi_ih | v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.varSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [occursIn] | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v (phi.imp_ psi) ↔ v ∈ (phi.imp_ psi).varSet | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ (phi.imp_ psi).varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v (phi.imp_ psi) ↔ v ∈ (phi.imp_ psi).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [varSet] | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ (phi.imp_ psi).varSet | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ phi.varSet ∪ psi.varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ (phi.imp_ psi).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ phi.varSet ∪ psi.varSet | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ phi.varSet ∨ v ∈ psi.varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ phi.varSet ∪ psi.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | congr! | v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ phi.varSet ∨ v ∈ psi.varSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi psi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
psi_ih : occursIn v psi ↔ v ∈ psi.varSet
⊢ occursIn v phi ∨ occursIn v psi ↔ v ∈ phi.varSet ∨ v ∈ psi.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [occursIn] | v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v (forall_ a✝ phi) ↔ v ∈ (forall_ a✝ phi).varSet | v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ (forall_ a✝ phi).varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v (forall_ a✝ phi) ↔ v ∈ (forall_ a✝ phi).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | simp only [varSet] | v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ (forall_ a✝ phi).varSet | v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.varSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ (forall_ a✝ phi).varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.occursIn_iff_mem_varSet | [186, 1] | [208, 17] | exact phi_ih | v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.varSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ↔ v ∈ phi.varSet
⊢ occursIn v phi ↔ v ∈ phi.varSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | induction F | v : Var
F : Formula
⊢ occursIn v F ∧ v.isFree ↔ v ∈ F.freeVarSet | case pred_
v : Var
a✝¹ : String
a✝ : List Var
⊢ occursIn v (pred_ a✝¹ a✝) ∧ v.isFree ↔ v ∈ (pred_ a✝¹ a✝).freeVarSet
case not_
v : Var
a✝ : Formula
a_ih✝ : occursIn v a✝ ∧ v.isFree ↔ v ∈ a✝.freeVarSet
⊢ occursIn v a✝.not_ ∧ v.isFree ↔ v ∈ a✝.not_.freeVarSet
case imp_
v : Var
a✝¹ a✝ : Formula
a_ih✝¹ : occursIn v a✝¹ ∧... | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
F : Formula
⊢ occursIn v F ∧ v.isFree ↔ v ∈ F.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case not_ phi phi_ih =>
simp only [Formula.freeVarSet]
simp only [occursIn]
exact phi_ih | v : Var
phi : Formula
phi_ih : occursIn v phi ∧ v.isFree ↔ v ∈ phi.freeVarSet
⊢ occursIn v phi.not_ ∧ v.isFree ↔ v ∈ phi.not_.freeVarSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi : Formula
phi_ih : occursIn v phi ∧ v.isFree ↔ v ∈ phi.freeVarSet
⊢ occursIn v phi.not_ ∧ v.isFree ↔ v ∈ phi.not_.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case imp_ phi psi phi_ih psi_ih =>
simp only [Formula.freeVarSet]
simp only [occursIn]
simp
tauto | v : Var
phi psi : Formula
phi_ih : occursIn v phi ∧ v.isFree ↔ v ∈ phi.freeVarSet
psi_ih : occursIn v psi ∧ v.isFree ↔ v ∈ psi.freeVarSet
⊢ occursIn v (phi.imp_ psi) ∧ v.isFree ↔ v ∈ (phi.imp_ psi).freeVarSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
phi psi : Formula
phi_ih : occursIn v phi ∧ v.isFree ↔ v ∈ phi.freeVarSet
psi_ih : occursIn v psi ∧ v.isFree ↔ v ∈ psi.freeVarSet
⊢ occursIn v (phi.imp_ psi) ∧ v.isFree ↔ v ∈ (phi.imp_ psi).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case forall_ _ phi phi_ih =>
simp only [Formula.freeVarSet]
simp only [occursIn]
exact phi_ih | v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ∧ v.isFree ↔ v ∈ phi.freeVarSet
⊢ occursIn v (forall_ a✝ phi) ∧ v.isFree ↔ v ∈ (forall_ a✝ phi).freeVarSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
a✝ : String
phi : Formula
phi_ih : occursIn v phi ∧ v.isFree ↔ v ∈ phi.freeVarSet
⊢ occursIn v (forall_ a✝ phi) ∧ v.isFree ↔ v ∈ (forall_ a✝ phi).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp only [Formula.freeVarSet] | v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ∧ v.isFree ↔ v ∈ (pred_ X vs).freeVarSet | v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ∧ v.isFree ↔ v ∈ vs.toFinset.biUnion Var.freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ∧ v.isFree ↔ v ∈ (pred_ X vs).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp only [occursIn] | v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ∧ v.isFree ↔ v ∈ vs.toFinset.biUnion Var.freeVarSet | v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree ↔ v ∈ vs.toFinset.biUnion Var.freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ occursIn v (pred_ X vs) ∧ v.isFree ↔ v ∈ vs.toFinset.biUnion Var.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp | v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree ↔ v ∈ vs.toFinset.biUnion Var.freeVarSet | v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree ↔ ∃ a ∈ vs, v ∈ a.freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree ↔ v ∈ vs.toFinset.biUnion Var.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | constructor | v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree ↔ ∃ a ∈ vs, v ∈ a.freeVarSet | case mp
v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree → ∃ a ∈ vs, v ∈ a.freeVarSet
case mpr
v : Var
X : String
vs : List Var
⊢ (∃ a ∈ vs, v ∈ a.freeVarSet) → v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree ↔ ∃ a ∈ vs, v ∈ a.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | intro a1 | case mp
v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree → ∃ a ∈ vs, v ∈ a.freeVarSet | case mp
v : Var
X : String
vs : List Var
a1 : v ∈ vs ∧ v.isFree
⊢ ∃ a ∈ vs, v ∈ a.freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
v : Var
X : String
vs : List Var
⊢ v ∈ vs ∧ v.isFree → ∃ a ∈ vs, v ∈ a.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | apply Exists.intro v | case mp
v : Var
X : String
vs : List Var
a1 : v ∈ vs ∧ v.isFree
⊢ ∃ a ∈ vs, v ∈ a.freeVarSet | case mp
v : Var
X : String
vs : List Var
a1 : v ∈ vs ∧ v.isFree
⊢ v ∈ vs ∧ v ∈ v.freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
v : Var
X : String
vs : List Var
a1 : v ∈ vs ∧ v.isFree
⊢ ∃ a ∈ vs, v ∈ a.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | cases v | case mp
v : Var
X : String
vs : List Var
a1 : v ∈ vs ∧ v.isFree
⊢ v ∈ vs ∧ v ∈ v.freeVarSet | case mp.free_
X : String
vs : List Var
a✝ : String
a1 : free_ a✝ ∈ vs ∧ (free_ a✝).isFree
⊢ free_ a✝ ∈ vs ∧ free_ a✝ ∈ (free_ a✝).freeVarSet
case mp.bound_
X : String
vs : List Var
a✝ : ℕ
a1 : bound_ a✝ ∈ vs ∧ (bound_ a✝).isFree
⊢ bound_ a✝ ∈ vs ∧ bound_ a✝ ∈ (bound_ a✝).freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
v : Var
X : String
vs : List Var
a1 : v ∈ vs ∧ v.isFree
⊢ v ∈ vs ∧ v ∈ v.freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case _ x =>
simp only [Var.freeVarSet]
simp
cases a1
case _ a1_left a1_right =>
exact a1_left | X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs ∧ free_ x ∈ (free_ x).freeVarSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs ∧ free_ x ∈ (free_ x).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case _ i =>
simp only [isFree] at a1
cases a1
case _ a1_left a1_right =>
contradiction | X : String
vs : List Var
i : ℕ
a1 : bound_ i ∈ vs ∧ (bound_ i).isFree
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
i : ℕ
a1 : bound_ i ∈ vs ∧ (bound_ i).isFree
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp only [Var.freeVarSet] | X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs ∧ free_ x ∈ (free_ x).freeVarSet | X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs ∧ free_ x ∈ {free_ x} | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs ∧ free_ x ∈ (free_ x).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp | X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs ∧ free_ x ∈ {free_ x} | X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs ∧ free_ x ∈ {free_ x}
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | cases a1 | X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs | case intro
X : String
vs : List Var
x : String
left✝ : free_ x ∈ vs
right✝ : (free_ x).isFree
⊢ free_ x ∈ vs | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
x : String
a1 : free_ x ∈ vs ∧ (free_ x).isFree
⊢ free_ x ∈ vs
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case _ a1_left a1_right =>
exact a1_left | X : String
vs : List Var
x : String
a1_left : free_ x ∈ vs
a1_right : (free_ x).isFree
⊢ free_ x ∈ vs | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
x : String
a1_left : free_ x ∈ vs
a1_right : (free_ x).isFree
⊢ free_ x ∈ vs
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | exact a1_left | X : String
vs : List Var
x : String
a1_left : free_ x ∈ vs
a1_right : (free_ x).isFree
⊢ free_ x ∈ vs | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
x : String
a1_left : free_ x ∈ vs
a1_right : (free_ x).isFree
⊢ free_ x ∈ vs
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp only [isFree] at a1 | X : String
vs : List Var
i : ℕ
a1 : bound_ i ∈ vs ∧ (bound_ i).isFree
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet | X : String
vs : List Var
i : ℕ
a1 : bound_ i ∈ vs ∧ False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
i : ℕ
a1 : bound_ i ∈ vs ∧ (bound_ i).isFree
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | cases a1 | X : String
vs : List Var
i : ℕ
a1 : bound_ i ∈ vs ∧ False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet | case intro
X : String
vs : List Var
i : ℕ
left✝ : bound_ i ∈ vs
right✝ : False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
i : ℕ
a1 : bound_ i ∈ vs ∧ False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case _ a1_left a1_right =>
contradiction | X : String
vs : List Var
i : ℕ
a1_left : bound_ i ∈ vs
a1_right : False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
i : ℕ
a1_left : bound_ i ∈ vs
a1_right : False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | contradiction | X : String
vs : List Var
i : ℕ
a1_left : bound_ i ∈ vs
a1_right : False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
i : ℕ
a1_left : bound_ i ∈ vs
a1_right : False
⊢ bound_ i ∈ vs ∧ bound_ i ∈ (bound_ i).freeVarSet
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | intro a1 | case mpr
v : Var
X : String
vs : List Var
⊢ (∃ a ∈ vs, v ∈ a.freeVarSet) → v ∈ vs ∧ v.isFree | case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
⊢ v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
v : Var
X : String
vs : List Var
⊢ (∃ a ∈ vs, v ∈ a.freeVarSet) → v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | apply Exists.elim a1 | case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
⊢ v ∈ vs ∧ v.isFree | case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
⊢ ∀ (a : Var), a ∈ vs ∧ v ∈ a.freeVarSet → v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
⊢ v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | intro u a2 | case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
⊢ ∀ (a : Var), a ∈ vs ∧ v ∈ a.freeVarSet → v ∈ vs ∧ v.isFree | case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
u : Var
a2 : u ∈ vs ∧ v ∈ u.freeVarSet
⊢ v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
⊢ ∀ (a : Var), a ∈ vs ∧ v ∈ a.freeVarSet → v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | cases u | case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
u : Var
a2 : u ∈ vs ∧ v ∈ u.freeVarSet
⊢ v ∈ vs ∧ v.isFree | case mpr.free_
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
a✝ : String
a2 : free_ a✝ ∈ vs ∧ v ∈ (free_ a✝).freeVarSet
⊢ v ∈ vs ∧ v.isFree
case mpr.bound_
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
a✝ : ℕ
a2 : bound_ a✝ ∈ vs ∧ v ∈ (bound_ a✝).freeVarSet
⊢ v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
u : Var
a2 : u ∈ vs ∧ v ∈ u.freeVarSet
⊢ v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case _ x =>
simp only [Var.freeVarSet] at a2
simp at a2
cases a2
case _ a2_left a2_right =>
subst a2_right
simp only [isFree]
simp
exact a2_left | v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v ∈ (free_ x).freeVarSet
⊢ v ∈ vs ∧ v.isFree | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v ∈ (free_ x).freeVarSet
⊢ v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | case _ i =>
simp only [Var.freeVarSet] at a2
simp at a2 | v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
i : ℕ
a2 : bound_ i ∈ vs ∧ v ∈ (bound_ i).freeVarSet
⊢ v ∈ vs ∧ v.isFree | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
i : ℕ
a2 : bound_ i ∈ vs ∧ v ∈ (bound_ i).freeVarSet
⊢ v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp only [Var.freeVarSet] at a2 | v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v ∈ (free_ x).freeVarSet
⊢ v ∈ vs ∧ v.isFree | v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v ∈ {free_ x}
⊢ v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v ∈ (free_ x).freeVarSet
⊢ v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | simp at a2 | v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v ∈ {free_ x}
⊢ v ∈ vs ∧ v.isFree | v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v = free_ x
⊢ v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v ∈ {free_ x}
⊢ v ∈ vs ∧ v.isFree
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Binders.lean | LN.isFreeIn_iff_mem_freeVarSet | [211, 1] | [264, 17] | cases a2 | v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v = free_ x
⊢ v ∈ vs ∧ v.isFree | case intro
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
left✝ : free_ x ∈ vs
right✝ : v = free_ x
⊢ v ∈ vs ∧ v.isFree | Please generate a tactic in lean4 to solve the state.
STATE:
v : Var
X : String
vs : List Var
a1 : ∃ a ∈ vs, v ∈ a.freeVarSet
x : String
a2 : free_ x ∈ vs ∧ v = free_ x
⊢ v ∈ vs ∧ v.isFree
TACTIC:
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.