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/All/Rec/Sub.lean | FOL.NV.Sub.Pred.All.Rec.substitution_is_valid | [269, 1] | [282, 11] | simp only [β s1] | F : Formula
Ο : PredName β β β List VarName Γ Formula
h1 : admits Ο 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
s1 :
Holds D
{ nonempty := β―, pred_const_ := I.pred_const_,
pred_var_ := fun X ds =>
... | F : Formula
Ο : PredName β β β List VarName Γ Formula
h1 : admits Ο 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
s1 :
Holds D
{ nonempty := β―, pred_const_ := I.pred_const_,
pred_var_ := fun X ds =>
... | Please generate a tactic in lean4 to solve the state.
STATE:
F : Formula
Ο : PredName β β β List VarName Γ Formula
h1 : admits Ο 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
s1 :
Holds D
{ nonempty := β―, pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Sub.lean | FOL.NV.Sub.Pred.All.Rec.substitution_is_valid | [269, 1] | [282, 11] | apply h2 | F : Formula
Ο : PredName β β β List VarName Γ Formula
h1 : admits Ο 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
s1 :
Holds D
{ nonempty := β―, pred_const_ := I.pred_const_,
pred_var_ := fun X ds =>
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
F : Formula
Ο : PredName β β β List VarName Γ Formula
h1 : admits Ο 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
s1 :
Holds D
{ nonempty := β―, pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | induction F generalizing V V' Ο | D : Type
I : Interpretation D
V V' V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
Ο : VarName β VarName
F : Formula
h1 : β (x : VarName), isFreeIn x F β V' x = V (Ο x)
h2 : β x β F.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I' D I V'' E Ο) V' E F β Holds ... | case pred_const_
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
aβΒΉ : PredName
aβ : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x (pred_const_ aβΒΉ aβ) β V' x = V (Ο x)
h2 : β x β (pred_const_ aβΒΉ aβ).pr... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V V' V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
Ο : VarName β VarName
F : Formula
h1 : β (x : VarName), isFreeIn x F β V' x = V (Ο x)
h2 : β x β F.predVarSet.biUnion (predVarFreeVarS... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | case pred_const_ X xs =>
simp only [isFreeIn] at h1
simp only [subAux]
simp only [Holds]
simp only [I']
simp only [Interpretation.usingPred]
simp
congr! 1
simp only [List.map_eq_map_iff]
intro x a1
simp
exact h1 x a1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x (pred_const_ X xs) β V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predV... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x (pred_const_ X xs) β V' x = V ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | case eq_ x y =>
simp only [isFreeIn] at h1
simp only [subAux]
simp only [Holds]
have s1 : V' x = V (Ο x)
apply h1
simp
simp only [s1]
have s2 : V' y = V (Ο y)
apply h1
simp
simp only [s2] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), isFreeIn x_1 (eq_ x y) β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), isFreeIn x_1 (eq_ x y) β V' x_1 = V (Ο x_1)
h2 : β x_1 β... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | case true_ | false_ =>
simp only [subAux]
simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x false_ β V' x = V (Ο x)
h2 : β x β false_.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I' D I V'' E Ο)... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x false_ β V' x = V (Ο x)
h2 : β x β false_.predVarSet.biUnion ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | case not_ phi phi_ih =>
simp only [isFreeIn] at h1
simp only [predVarSet] at h2
simp only [subAux]
simp only [Holds]
congr! 1
exact phi_ih V V' Ο h1 h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x (pred_const_ X xs) β V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predV... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x (pred_const_ X xs) β V' x = V ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [subAux] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ (I' D I ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [I'] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ (I' D I ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ (Interpr... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Interpretation.usingPred] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ (Interpr... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ I.pred_c... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ I.pred_c... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ I.pred_c... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | congr! 1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ I.pred_c... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).pre... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [List.map_eq_map_iff] | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_co... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | intro x a1 | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_co... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_co... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact h1 x a1 | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_const_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_co... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x (pred_var_ X xs) β V' x = V (Ο x)
h2 : β x β (pred_var_ X xs).predVarSet.biUnion (predVarFr... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_var_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x (pred_var_ X xs) β V' x = V (Ο... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [predVarSet] at h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_var_ X xs).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β {(X, xs.length)}.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I' D I V'' E... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β (pred_var_ X xs).predV... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp at h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β {(X, xs.length)}.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I' D I V'' E... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β predVarFreeVarSet Ο (X, xs.length), V'' x = V x
β’ Holds D (I' D I V'' E Ο) V' E (pr... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β {(X, xs.length)}.biUni... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [predVarFreeVarSet] at h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β predVarFreeVarSet Ο (X, xs.length), V'' x = V x
β’ Holds D (I' D I V'' E Ο) V' E (pr... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 : β x β predVarFreeVarSet Ο (X... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [subAux] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [I'] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Interpretation.usingPred] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | split_ifs | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | case pos
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.len... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | case _ c1 c2 =>
simp only [Holds]
simp
congr! 1
simp only [List.map_eq_map_iff]
intro x a1
simp
exact h1 x a1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | case _ c1 =>
simp only [Holds]
simp
congr! 1
simp only [List.map_eq_map_iff]
intro x a1
simp
exact h1 x a1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [c1] at h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
c2 : xs.length = ((Ο X xs.length).get β―).1.length
h2 :
β ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp at h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
c2 : xs.length = ((Ο X xs.length).get β―).1.length
h2 :
β ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
c2 : xs.length = ((Ο X xs.length).get β―).1.length
h2 : β x ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | set zs := (Option.get (Ο X (List.length xs)) (_ : Option.isSome (Ο X (List.length xs)) = true)).1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
c2 : xs.length = ((Ο X xs.length).get β―).1.length
h2 : β x ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | set H := (Option.get (Ο X (List.length xs)) (_ : Option.isSome (Ο X (List.length xs)) = true)).2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | obtain s1 := Sub.Var.All.Rec.Fresh.substitution_theorem D I V E (Function.updateListITE id zs (xs.map Ο)) c H | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Function.updateListITE_comp] at s1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp at s1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [s1] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | clear s1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply Holds_coincide_Var | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 : xs.leng... | case h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 :... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = tru... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | intro x a1 | case h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 :... | case h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 :... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSo... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | by_cases c3 : x β zs | case h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 :... | case pos
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSo... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply Function.updateListITE_map_mem_ext | case pos
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 ... | case pos.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isS... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | case pos.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
... | case pos.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact h1 | case pos.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case pos.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [β c2] | case pos.h2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case pos.h2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact c3 | case pos.h3
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case pos.h3
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Function.updateListITE_not_mem V'' x zs (List.map V' xs) c3] | case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 ... | case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 ... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isS... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Function.updateListITE_not_mem V x zs (List.map (V β Ο ) xs) c3] | case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 ... | case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 ... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isS... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply h2 | case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c2 ... | case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isS... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [isFreeIn_iff_mem_freeVarSet] at a1 | case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c... | case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact a1 | case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact c3 | case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).isSome = true
zs : List VarName := ((Ο X xs.length).get β―).1
c... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case neg.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
c1 : (Ο X xs.length).i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | congr! 1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [List.map_eq_map_iff] | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | intro x a1 | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact h1 x a1 | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | congr! 1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X xs.length).get ... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [List.map_eq_map_iff] | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | intro x a1 | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact h1 x a1 | case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
if h : (Ο X xs.length).isSome = true then
((Ο X x... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
X : PredName
xs : List VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β x β xs, V' x = V (Ο x)
h2 :
β
x β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), isFreeIn x_1 (eq_ x y) β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 ... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), isFreeIn x_1 (eq_ x y) β V' x_1 = V (Ο x_1)
h2 : β x_1 β... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [subAux] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | have s1 : V' x = V (Ο x) | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | case s1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply h1 | case s1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x... | case s1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V''... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | case s1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V''... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [s1] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | have s2 : V' y = V (Ο y) | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | case s2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply h1 | case s2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x... | case s2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V''... | Please generate a tactic in lean4 to solve the state.
STATE:
case s2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp | case s2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V''... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | Please generate a tactic in lean4 to solve the state.
STATE:
case s2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [s2] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_ x y).predVarSet.biUnion (predVarFreeVarSet Ο), V'' x_1 = V x... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
x y : VarName
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x_1 : VarName), x_1 = x β¨ x_1 = y β V' x_1 = V (Ο x_1)
h2 : β x_1 β (eq_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [subAux] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x false_ β V' x = V (Ο x)
h2 : β x β false_.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I' D I V'' E Ο)... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x false_ β V' x = V (Ο x)
h2 : β x β false_.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I' D I V'' E Ο)... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x false_ β V' x = V (Ο x)
h2 : β x β false_.predVarSet.biUnion ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x false_ β V' x = V (Ο x)
h2 : β x β false_.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x = V x
β’ Holds D (I' D I V'' E Ο)... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
V V' : VarAssignment D
Ο : VarName β VarName
h1 : β (x : VarName), isFreeIn x false_ β V' x = V (Ο x)
h2 : β x β false_.predVarSet.biUnion ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [predVarSet] at h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [subAux] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | congr! 1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V'' x =... | case a.h.e'_1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVa... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact phi_ih V V' Ο h1 h2 | case a.h.e'_1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVa... | 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
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [predVarSet] at h2 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [subAux] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Holds] | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | congr! 1 | D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFreeVarSet Ο), V''... | case a.h.e'_1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFr... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply phi_ih V V' Ο | case a.h.e'_1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVarFr... | case a.h.e'_1.a.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVa... | 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
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | intro x a1 | case a.h.e'_1.a.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVa... | case a.h.e'_1.a.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVa... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply h1 | case a.h.e'_1.a.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVa... | case a.h.e'_1.a.h1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pred... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h1
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | left | case a.h.e'_1.a.h1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pred... | case a.h.e'_1.a.h1.a.h
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pr... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h1.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | exact a1 | case a.h.e'_1.a.h1.a.h
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pr... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h1.a.h
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x ph... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | intro x a1 | case a.h.e'_1.a.h2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVa... | case a.h.e'_1.a.h2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVa... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply h2 | case a.h.e'_1.a.h2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (predVa... | case a.h.e'_1.a.h2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pred... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h2
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | simp only [Finset.mem_biUnion, Finset.mem_union] at a1 | case a.h.e'_1.a.h2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pred... | case a.h.e'_1.a.h2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pred... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Pred/All/Rec/Option/Fresh/Sub.lean | FOL.NV.Sub.Pred.All.Rec.Option.Fresh.substitution_theorem_aux | [123, 1] | [434, 44] | apply Exists.elim a1 | case a.h.e'_1.a.h2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pred... | case a.h.e'_1.a.h2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi β V' x = V (Ο x)) β
(β x β phi.predVarSet.biUnion (pred... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a.h2.a
D : Type
I : Interpretation D
V'' : VarAssignment D
E : Env
c : Char
Ο : PredName β β β Option (List VarName Γ Formula)
phi psi : Formula
phi_ih :
β (V V' : VarAssignment D) (Ο : VarName β VarName),
(β (x : VarName), isFreeIn x phi ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.