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/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | split_ifs | D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : DefName
... | case pos
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X :... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | case pos c1 =>
apply ih
intro P ds a1
simp only [predVarOccursIn_iff_mem_predVarSet P ds.length] at a1
simp only [hd.h2] at a1
simp at a1 | D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : DefName
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | case neg c1 =>
apply ih
intro P ds a1
simp only [predVarOccursIn] at a1 | D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : DefName
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | apply ih | D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : DefName
... | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | intro P ds a1 | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_va... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | simp only [predVarOccursIn_iff_mem_predVarSet P ds.length] at a1 | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_va... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | simp only [hd.h2] at a1 | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_va... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | simp at a1 | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_va... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | apply ih | D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : DefName
... | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | intro P ds a1 | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_va... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_PredVar | [175, 1] | [236, 40] | simp only [predVarOccursIn] at a1 | case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_var_ P ds)) →
(Holds D I V tl F ↔ Holds D I' V tl F)
X : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h2
D : Type
I I' : Interpretation D
h1 : I.pred_const_ = I'.pred_const_
hd : Definition
tl : List Definition
ih :
∀ (V : VarAssignment D) (F : Formula),
(∀ (P : PredName) (ds : List D), predVarOccursIn P ds.length F → (I.pred_var_ P ds ↔ I'.pred_va... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | induction F generalizing V | D : Type
I : Interpretation D
V : VarAssignment D
E E' : Env
F : Formula
h1 : ∃ E1, E' = E1 ++ E
h2 : all_def_in_env E F
h3 : E'.nodup_
⊢ Holds D I V E' F ↔ Holds D I V E F | case pred_const_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : PredName
a✝ : List VarName
V : VarAssignment D
h2 : all_def_in_env E (pred_const_ a✝¹ a✝)
⊢ Holds D I V E' (pred_const_ a✝¹ a✝) ↔ Holds D I V E (pred_const_ a✝¹ a✝)
case pred_var_
D : Type
I : Interpretation D
E E' :... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V : VarAssignment D
E E' : Env
F : Formula
h1 : ∃ E1, E' = E1 ++ E
h2 : all_def_in_env E F
h3 : E'.nodup_
⊢ Holds D I V E' F ↔ Holds D I V E F
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | any_goals
simp only [all_def_in_env] at h2
simp only [Holds] | case pred_const_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : PredName
a✝ : List VarName
V : VarAssignment D
h2 : all_def_in_env E (pred_const_ a✝¹ a✝)
⊢ Holds D I V E' (pred_const_ a✝¹ a✝) ↔ Holds D I V E (pred_const_ a✝¹ a✝)
case pred_var_
D : Type
I : Interpretation D
E E' :... | case not_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝ : Formula
a_ih✝ : ∀ (V : VarAssignment D), all_def_in_env E a✝ → (Holds D I V E' a✝ ↔ Holds D I V E a✝)
V : VarAssignment D
h2 : all_def_in_env E a✝
⊢ ¬Holds D I V E' a✝ ↔ ¬Holds D I V E a✝
case imp_
D : Type
I : Interpretatio... | Please generate a tactic in lean4 to solve the state.
STATE:
case pred_const_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : PredName
a✝ : List VarName
V : VarAssignment D
h2 : all_def_in_env E (pred_const_ a✝¹ a✝)
⊢ Holds D I V E' (pred_const_ a✝¹ a✝) ↔ Holds D I V E (pred_const_... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | case not_ phi phi_ih =>
congr! 1
exact phi_ih V h2 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ¬Holds D I V E' phi ↔ ¬Holds D I V E phi | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ¬Holds D I V E' phi... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | case forall_ x phi phi_ih | exists_ x phi phi_ih =>
first | apply forall_congr' | apply exists_congr
intro d
apply phi_ih
exact h2 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∃ d, Holds D I (Function.updateITE V x d) E' phi) ↔ ∃ d, Holds D I ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∃ d, H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp only [all_def_in_env] at h2 | case def_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : DefName
a✝ : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ a✝¹ a✝)
⊢ Holds D I V E' (def_ a✝¹ a✝) ↔ Holds D I V E (def_ a✝¹ a✝) | case def_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : DefName
a✝ : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, a✝¹ = d.name ∧ a✝.length = d.args.length
⊢ Holds D I V E' (def_ a✝¹ a✝) ↔ Holds D I V E (def_ a✝¹ a✝) | Please generate a tactic in lean4 to solve the state.
STATE:
case def_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : DefName
a✝ : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ a✝¹ a✝)
⊢ Holds D I V E' (def_ a✝¹ a✝) ↔ Holds D I V E (def_ a✝¹ a✝)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp only [Holds] | case exists_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (V : VarAssignment D), all_def_in_env E a✝ → (Holds D I V E' a✝ ↔ Holds D I V E a✝)
V : VarAssignment D
h2 : all_def_in_env E a✝
⊢ Holds D I V E' (exists_ a✝¹ a✝) ↔ Holds D I V E (exists_ a✝... | case exists_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (V : VarAssignment D), all_def_in_env E a✝ → (Holds D I V E' a✝ ↔ Holds D I V E a✝)
V : VarAssignment D
h2 : all_def_in_env E a✝
⊢ (∃ d, Holds D I (Function.updateITE V a✝¹ d) E' a✝) ↔ ∃ d, ... | Please generate a tactic in lean4 to solve the state.
STATE:
case exists_
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
a✝¹ : VarName
a✝ : Formula
a_ih✝ : ∀ (V : VarAssignment D), all_def_in_env E a✝ → (Holds D I V E' a✝ ↔ Holds D I V E a✝)
V : VarAssignment D
h2 : all_def_in_env E a✝
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | congr! 1 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ¬Holds D I V E' phi ↔ ¬Holds D I V E phi | case a.h.e'_1.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ Holds D I V E' phi ↔ Holds D I V E phi | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ¬Holds D I V E' phi... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact phi_ih V h2 | case a.h.e'_1.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ Holds D I V E' phi ↔ Holds D I V E phi | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ Hol... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | cases h2 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds D I V E' psi ↔ Holds D I V E psi)
V : VarAssignment D
h2 : a... | case intro
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds D I V E' psi ↔ Holds D I V E psi)
V : VarAssignme... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | congr! 1 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds D I V E' psi ↔ Holds D I V E psi)
V : VarAssignment D
h2_lef... | case a.h.e'_1.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds D I V E' psi ↔ Holds D I V E psi)
V : VarAss... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact phi_ih V h2_left | case a.h.e'_1.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds D I V E' psi ↔ Holds D I V E psi)
V : VarAss... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_en... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact psi_ih V h2_right | case a.h.e'_2.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_env E psi → (Holds D I V E' psi ↔ Holds D I V E psi)
V : VarAss... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_2.a
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
psi_ih : ∀ (V : VarAssignment D), all_def_in_en... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | first | apply forall_congr' | apply exists_congr | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∃ d, Holds D I (Function.updateITE V x d) E' phi) ↔ ∃ d, Holds D I ... | case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ∀ (a : D), Holds D I (Function.updateITE V x a) E' phi ↔ Hold... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∃ d, H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | intro d | case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ∀ (a : D), Holds D I (Function.updateITE V x a) E' phi ↔ Hold... | case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
d : D
⊢ Holds D I (Function.updateITE V x d) E' phi ↔ Holds D I... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | apply phi_ih | case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
d : D
⊢ Holds D I (Function.updateITE V x d) E' phi ↔ Holds D I... | case h.h2
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
d : D
⊢ all_def_in_env E phi | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
d ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact h2 | case h.h2
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
d : D
⊢ all_def_in_env E phi | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h.h2
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | apply forall_congr' | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∀ (d : D), Holds D I (Function.updateITE V x d) E' phi) ↔ ∀ (d : D)... | case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ∀ (a : D), Holds D I (Function.updateITE V x a) E' phi ↔ Hold... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∀ (d :... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | apply exists_congr | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∃ d, Holds D I (Function.updateITE V x d) E' phi) ↔ ∃ d, Holds D I ... | case h
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ ∀ (a : D), Holds D I (Function.updateITE V x a) E' phi ↔ Hold... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D), all_def_in_env E phi → (Holds D I V E' phi ↔ Holds D I V E phi)
V : VarAssignment D
h2 : all_def_in_env E phi
⊢ (∃ d, H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | apply Exists.elim h1 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
⊢ ∀ (a : Env), E' = a ++ E → (Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | intro E1 h1_1 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
⊢ ∀ (a : Env), E' = a ++ E → (Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)) | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
⊢ ∀ (a : Env), E' = a ++ E → (Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs))
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | clear h1 | D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h1 : ∃ E1, E' = E1 ++ E
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp only [all_def_in_env] at h2 | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : all_def_in_env E (def_ X xs)
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | apply Exists.elim h2 | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
⊢ ∀ (a : Definition),
a ∈ E ∧ X = a.name ∧ xs.length = a.args.length → (Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | intro a h2_1 | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
⊢ ∀ (a : Definition),
a ∈ E ∧ X = a.name ∧ xs.length = a.args.length → (Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs)) | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
⊢ ∀ (a : Definition),
a ∈ E ∧ X = a.name ∧ xs.length = a.args.lengt... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | clear h2 | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
h2 : ∃ d ∈ E, X = d.name ∧ xs.length = d.args.length
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp only [Env.nodup_] at h3 | D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs) | D : Type
I : Interpretation D
E E' : Env
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) E'
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ Holds D I V E' (def_ X xs) ↔ Hol... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h3 : E'.nodup_
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ Holds D I V E' (def_ X xs) ↔ Holds D I V E (def_ X xs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | subst h1_1 | D : Type
I : Interpretation D
E E' : Env
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) E'
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
⊢ Holds D I V E' (def_ X xs) ↔ Hol... | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1 ++ E)
⊢ Holds D I V (E1 ++ E) (def_ X xs) ↔ Holds D I V ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E E' : Env
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) E'
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
h1_1 : E' = E1 ++ E
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | induction E1 | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1 ++ E)
⊢ Holds D I V (E1 ++ E) (def_ X xs) ↔ Holds D I V ... | case nil
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) ([] ++ E)
⊢ Holds D I V ([] ++ E) (def_ X xs) ↔ Holds D I V ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
E1 : Env
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False)... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | case nil =>
simp | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) ([] ++ E)
⊢ Holds D I V ([] ++ E) (def_ X xs) ↔ Holds D I V E (def_ X... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) ([] ++ E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) ([] ++ E)
⊢ Holds D I V ([] ++ E) (def_ X xs) ↔ Holds D I V E (def_ X... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
h3 : List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) ([] ++ E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp at h3 | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(H... | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(H... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | cases h2_1 | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(H... | case intro
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a : Definition
h2_1 : a ∈ E ∧ X = a.name ∧ xs.length = a.args.length
E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | cases h2_1_right | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h3... | case intro
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | cases h3 | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h3... | case intro
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp only [Holds] | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | split_ifs | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | case pos
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | case _ c1 =>
exact E1_ih h3_right | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | cases c1 | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | case intro
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exfalso | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | apply h3_left a | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | case a
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | right | case a
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X ... | case a.h
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ ... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact h2_1_left | case a.h
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | subst c1_left | case a
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X ... | case a
D : Type
I : Interpretation D
E : Env
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
h2_1_left : a ∈ E
h2_1_right_right : xs.length = a.args.length
h3_left : ∀ (a' : Definition), a' ∈ E1_tl ∨ a' ∈ E → E1_hd.name = a'.name → ¬E1_hd.args.length = a'.args.length
h3_right : List.P... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact h2_1_right_left | case a
D : Type
I : Interpretation D
E : Env
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
h2_1_left : a ∈ E
h2_1_right_right : xs.length = a.args.length
h3_left : ∀ (a' : Definition), a' ∈ E1_tl ∨ a' ∈ E → E1_hd.name = a'.name → ¬E1_hd.args.length = a'.args.length
h3_right : List.P... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a
D : Type
I : Interpretation D
E : Env
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
h2_1_left : a ∈ E
h2_1_right_right : xs.length = a.args.length
h3_left : ∀ (a' : Definition), a' ∈ E1_tl ∨ a' ∈ E → E1_hd.name = a'... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | trans List.length xs | case a
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X ... | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | simp only [eq_comm] | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact c1_right | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact h2_1_right_right | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Semantics.lean | FOL.NV.Holds_coincide_Env | [239, 1] | [316, 35] | exact E1_ih h3_right | D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D I V (E1_tl ++ E) (def_ X xs) ↔ Holds D I V E (def_ X xs))
h2... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
X : DefName
xs : List VarName
V : VarAssignment D
a E1_hd : Definition
E1_tl : List Definition
E1_ih :
List.Pairwise (fun d1 d2 => d1.name = d2.name → d1.args.length = d2.args.length → False) (E1_tl ++ E) →
(Holds D... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | induction E generalizing F V | D : Type
I : Interpretation D
V : VarAssignment D
E : Env
u v : VarName
F : Formula
a : D
h1 : ¬isFreeIn v F
h2 : ¬isBoundIn v F
⊢ Holds D I (Function.updateITE V u a) E F ↔
Holds D I (Function.updateITE V v a) E (Sub.Var.One.Rec.fastReplaceFree u v F) | case nil
D : Type
I : Interpretation D
u v : VarName
a : D
V : VarAssignment D
F : Formula
h1 : ¬isFreeIn v F
h2 : ¬isBoundIn v F
⊢ Holds D I (Function.updateITE V u a) [] F ↔
Holds D I (Function.updateITE V v a) [] (Sub.Var.One.Rec.fastReplaceFree u v F)
case cons
D : Type
I : Interpretation D
u v : VarName
a : D... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
u v : VarName
F : Formula
a : D
h1 : ¬isFreeIn v F
h2 : ¬isBoundIn v F
⊢ Holds D I (Function.updateITE V u a) E F ↔
Holds D I (Function.updateITE V v a) E (Sub.Var.One.Rec.fastReplaceFree u v F)
TA... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case nil.def_ X xs =>
simp only [Sub.Var.One.Rec.fastReplaceFree]
simp only [Holds] | D : Type
I : Interpretation D
u v : VarName
a : D
X : DefName
xs : List VarName
V : VarAssignment D
h1 : ¬isFreeIn v (def_ X xs)
h2 : ¬isBoundIn v (def_ X xs)
⊢ Holds D I (Function.updateITE V u a) [] (def_ X xs) ↔
Holds D I (Function.updateITE V v a) [] (Sub.Var.One.Rec.fastReplaceFree u v (def_ X xs)) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
X : DefName
xs : List VarName
V : VarAssignment D
h1 : ¬isFreeIn v (def_ X xs)
h2 : ¬isBoundIn v (def_ X xs)
⊢ Holds D I (Function.updateITE V u a) [] (def_ X xs) ↔
Holds D I (Function.updateITE V v a) [] ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | induction F generalizing V | case cons
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.... | case cons.pred_const_
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (... | Please generate a tactic in lean4 to solve the state.
STATE:
case cons
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case pred_const_ X xs | pred_var_ X xs =>
simp only [isFreeIn] at h1
simp only [Sub.Var.One.Rec.fastReplaceFree]
simp only [Holds]
congr! 1
simp
simp only [List.map_eq_map_iff]
intro x a1
simp
simp only [Function.updateITE]
simp only [eq_comm]
split_ifs
case _ c1 c2 =>
rfl
case _ c1 c2 =>
... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case true_ | false_ =>
simp only [Sub.Var.One.Rec.fastReplaceFree]
simp only [Holds] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case not_ phi phi_ih =>
simp only [isFreeIn] at h1
simp only [isBoundIn] at h2
simp only [Sub.Var.One.Rec.fastReplaceFree]
simp only [Holds]
congr! 1
exact phi_ih V h1 h2 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Sub.Var.One.Rec.fastReplaceFree] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Holds] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | congr! 1 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [List.map_eq_map_iff] | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | intro x a1 | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Function.updateITE] | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [eq_comm] | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | split_ifs | case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case pos
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.R... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_4
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case _ c1 c2 =>
rfl | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case _ c1 c2 =>
contradiction | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case _ c1 c2 =>
subst c2
contradiction | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | case _ c1 c2 =>
rfl | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | rfl | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | contradiction | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | subst c2 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | contradiction | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | rfl | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Sub.Var.One.Rec.fastReplaceFree] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Holds] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | congr! 1 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | case a.h.e'_2
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Function.updateITE] | case a.h.e'_2
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_2
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_2
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | split_ifs <;> tauto | case a.h.e'_2
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_2
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Function.updateITE] | case a.h.e'_3
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | case a.h.e'_3
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_3
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | split_ifs <;> tauto | case a.h.e'_3
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_3
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Sub.Var.One.Rec.fastReplaceFree] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Holds] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [isFreeIn] at h1 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [isBoundIn] at h2 | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Alpha.lean | FOL.NV.replace_empty_Holds | [181, 1] | [345, 19] | simp only [Sub.Var.One.Rec.fastReplaceFree] | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds D I (Function.updateITE V v a) tail✝ (Sub.Var.One.Rec.fastRe... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
u v : VarName
a : D
head✝ : Definition
tail✝ : List Definition
tail_ih✝ :
∀ (V : VarAssignment D) (F : Formula),
¬isFreeIn v F →
¬isBoundIn v F →
(Holds D I (Function.updateITE V u a) tail✝ F ↔
Holds... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.