url stringclasses 147
values | commit stringclasses 147
values | file_path stringlengths 7 101 | full_name stringlengths 1 94 | start stringlengths 6 10 | end stringlengths 6 11 | tactic stringlengths 1 11.2k | state_before stringlengths 3 2.09M | state_after stringlengths 6 2.09M | input stringlengths 73 2.09M |
|---|---|---|---|---|---|---|---|---|---|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | congr! 1 | D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ ¬Holds D I V E (sub σ c phi) ↔ ¬Holds D I (V ∘ σ) E phi | case a.h.e'_1.a
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ ¬Holds D I V E (sub σ c phi) ↔ ¬Holds D I ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact phi_ih V σ | case a.h.e'_1.a
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E (sub σ c 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 : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E (sub σ c phi... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [sub] | D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c psi) ↔ Holds D I (V ∘ σ) E psi
V : VarAssignment D
σ : VarName... | D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c psi) ↔ Holds D I (V ∘ σ) E psi
V : VarAssignment D
σ : VarName... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c p... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Holds] | D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c psi) ↔ Holds D I (V ∘ σ) E psi
V : VarAssignment D
σ : VarName... | D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c psi) ↔ Holds D I (V ∘ σ) E psi
V : VarAssignment D
σ : VarName... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c p... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | congr! 1 | D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c psi) ↔ Holds D I (V ∘ σ) E psi
V : VarAssignment D
σ : VarName... | case a.h.e'_1.a
D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c 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 : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c p... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact phi_ih V σ | case a.h.e'_1.a
D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c psi) ↔ Holds D I (V ∘ σ) E psi
V : VarAssignme... | 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 : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact psi_ih V σ | case a.h.e'_2.a
D : Type
I : Interpretation D
E : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c psi) ↔ Holds D I (V ∘ σ) E psi
V : VarAssignme... | 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 : Env
c : Char
phi psi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
psi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [sub] | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E (sub σ c (exists_ x phi)) ↔ Holds D I (V ∘ σ) E (exists_ x phi) | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E
(exists_
(if ∃ y ∈ phi.freeVarSet \ {x}, σ y = x then fresh x c... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E (sub σ c (exists... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Holds] | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E
(exists_
(if ∃ y ∈ phi.freeVarSet \ {x}, σ y = x then fresh x c... | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ (∃ d,
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSet \ {x... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E
(exists_
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | first | apply forall_congr' | apply exists_congr | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ (∃ d,
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSet \ {x... | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ ∀ (a : D),
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeV... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ (∃ d,
Holds D I
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | intro d | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ ∀ (a : D),
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeV... | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSet \ {x}, ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ ∀ (a : D),
Holds D ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [phi_ih] | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSet \ {x}, ... | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSet \ {x}... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ Holds D I
(... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply Holds_coincide_Var | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSet \ {x}... | case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ ∀ (v : VarName),
isFreeIn v phi →
(Function.updateITE V
... | Please generate a tactic in lean4 to solve the state.
STATE:
case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ Holds D I
(... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | intro v a1 | case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ ∀ (v : VarName),
isFreeIn v phi →
(Function.updateITE V
... | case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
⊢ (Function.updateITE V
(if ∃ y ∈ p... | Please generate a tactic in lean4 to solve the state.
STATE:
case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
⊢ ∀ (v : VarName... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
⊢ (Function.updateITE V
(if ∃ y ∈ p... | case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
⊢ Function.updateITE V
(if ∃ y ∈ phi.fr... | Please generate a tactic in lean4 to solve the state.
STATE:
case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 :... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | split_ifs | case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
⊢ Function.updateITE V
(if ∃ y ∈ phi.fr... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
h✝ : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
⊢ Fun... | Please generate a tactic in lean4 to solve the state.
STATE:
case h.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 :... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply forall_congr' | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ (∀ (d : D),
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSe... | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ ∀ (a : D),
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeV... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ (∀ (d : D),
Holds D I
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply exists_congr | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ (∃ d,
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeVarSet \ {x... | case h
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ ∀ (a : D),
Holds D I
(Function.updateITE V
(if ∃ y ∈ phi.freeV... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
⊢ (∃ d,
Holds D I
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | obtain s0 := fresh_not_mem x c (freeVarSet (sub (Function.updateITE σ x x) c phi)) | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
⊢ Function.upd... | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
s0 : fresh x c... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | generalize (fresh x c (freeVarSet (sub (Function.updateITE σ x x) c phi))) = x' at * | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
s0 : fresh x c... | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : VarName
s... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | by_cases c2 : v = x | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : VarName
s... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [c2] | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Function.updateITE] | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | by_cases c3 : σ v = x' | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | subst c3 | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [freeVarSet_sub_eq_freeVarSet_image] at s0 | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | have s1 : σ v ∈ Finset.image (Function.updateITE σ x x) (freeVarSet phi) | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ¬... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply Finset.mem_image_update | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ¬... | case s1.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 ... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | contradiction | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact c2 | case s1.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.h1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [← isFreeIn_iff_mem_freeVarSet] | case s1.h2
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 ... | case s1.h2
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 ... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.h2
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact a1 | case s1.h2
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.h2
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Function.updateITE] | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [if_neg c2] | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [if_neg c3] | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ∃ y ∈ phi.freeVarSet \ {x}, σ y = x
x' : ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | by_cases c2 : v = x | D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
⊢ Function.up... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | subst c2 | case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {v}, σ y = v
⊢ Function.updat... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Function.updateITE] | case pos
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {v}, σ y = v
⊢ Function.updat... | case pos
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {v}, σ y = v
⊢ (if (if True t... | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v p... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | case pos
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {v}, σ y = v
⊢ (if (if True t... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case pos
D : Type
I : Interpretation D
E : Env
c : Char
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v p... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | have s1 : ¬ σ v = x | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Function.updateITE] | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [if_neg c2] | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [if_neg s1] | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 :... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case neg
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | intro contra | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply c1 | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply Exists.intro v | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | constructor | case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
c2 : ... | case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : i... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
... | case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [← isFreeIn_iff_mem_freeVarSet] | case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
... | case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
... | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | tauto | case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x
... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.left
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact contra | case s1.right
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
a1 : isFreeIn v phi
c1 : ¬∃ y ∈ phi.freeVarSet \ {x}, σ y = x... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case s1.right
D : Type
I : Interpretation D
E : Env
c : Char
x : VarName
phi : Formula
phi_ih : ∀ (V : VarAssignment D) (σ : VarName → VarName), Holds D I V E (sub σ c phi) ↔ Holds D I (V ∘ σ) E phi
V : VarAssignment D
σ : VarName → VarName
d : D
v : VarName
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | induction E | D : Type
I : Interpretation D
E : Env
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) E (def_ X xs) | case nil
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs)
case cons
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
head... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
E : Env
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V E (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) E (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | case nil =>
simp only [sub]
simp only [Holds] | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [sub] | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs) | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs) | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Holds] | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
⊢ Holds D I V [] (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) [] (def_ X xs)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [sub] at E_ih | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :: E_tl) (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) (E_hd :: E_tl)... | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :: E_tl) (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) (E_hd :: E_... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :: E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [sub] | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :: E_tl) (sub σ c (def_ X xs)) ↔ Holds D I (V ∘ σ) (E_hd :: E_... | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :: E_tl) (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) (E_hd ::... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [Holds] | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :: E_tl) (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) (E_hd ::... | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ (if X = E_hd.name ∧ (List.map σ xs).length = E_hd.args.length then
Holds D... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ Holds D I V (E_hd :... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ (if X = E_hd.name ∧ (List.map σ xs).length = E_hd.args.length then
Holds D... | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ (if X = E_hd.name ∧ xs.length = E_hd.args.length then
Holds D I (Function.... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ (if X = E_hd.name ∧... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | split_ifs | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ (if X = E_hd.name ∧ xs.length = E_hd.args.length then
Holds D I (Function.... | case pos
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
h✝ : X = E_hd.name ∧ xs.length = E_hd.args.length
⊢ Holds D I (Function.u... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
⊢ (if X = E_hd.name ∧... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | case neg c1 =>
exact E_ih | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : ¬(X = E_hd.name ∧ xs.length = E_hd.args.length)
⊢ Holds D I V E_tl (def_ X (L... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : ¬(X = E_hd.name ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply Holds_coincide_Var | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
⊢ Holds D I (Function.updateList... | case h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
⊢ ∀ (v : VarName),
i... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | intro v a1 | case h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
⊢ ∀ (v : VarName),
i... | case h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : isFreeI... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply Function.updateListITE_map_mem_ext | case h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : isFreeI... | case h1.h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : isFr... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp | case h1.h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : isFr... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h1.h1
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | cases c1 | case h1.h2
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : isFr... | case h1.h2.intro
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFreeIn v E_hd.q
left✝ : X = E_hd.name
right✝ :... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1.h2
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | case _ c1_left c1_right =>
symm
exact c1_right | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFreeIn v E_hd.q
c1_left : X = E_hd.name
c1_right : xs.length = ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFr... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | symm | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFreeIn v E_hd.q
c1_left : X = E_hd.name
c1_right : xs.length = ... | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFreeIn v E_hd.q
c1_left : X = E_hd.name
c1_right : xs.length = ... | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFr... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact c1_right | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFreeIn v E_hd.q
c1_left : X = E_hd.name
c1_right : xs.length = ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
v : VarName
a1 : isFr... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [isFreeIn_iff_mem_freeVarSet] at a1 | case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : isFr... | case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : v ∈ ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | simp only [← List.mem_toFinset] | case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : v ∈ ... | case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : v ∈ ... | Please generate a tactic in lean4 to solve the state.
STATE:
case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | apply Finset.mem_of_subset E_hd.h1 a1 | case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E_hd.name ∧ xs.length = E_hd.args.length
v : VarName
a1 : v ∈ ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h1.h3
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : X = E... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem | [128, 1] | [245, 19] | exact E_ih | D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : ¬(X = E_hd.name ∧ xs.length = E_hd.args.length)
⊢ Holds D I V E_tl (def_ X (L... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
D : Type
I : Interpretation D
c : Char
X : DefName
xs : List VarName
V : VarAssignment D
σ : VarName → VarName
E_hd : Definition
E_tl : List Definition
E_ih : Holds D I V E_tl (def_ X (List.map σ xs)) ↔ Holds D I (V ∘ σ) E_tl (def_ X xs)
c1 : ¬(X = E_hd.name ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_is_valid | [248, 1] | [260, 11] | simp only [IsValid] at h1 | σ : VarName → VarName
c : Char
F : Formula
h1 : F.IsValid
⊢ (sub σ c F).IsValid | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (sub σ c F).IsValid | Please generate a tactic in lean4 to solve the state.
STATE:
σ : VarName → VarName
c : Char
F : Formula
h1 : F.IsValid
⊢ (sub σ c F).IsValid
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_is_valid | [248, 1] | [260, 11] | simp only [IsValid] | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (sub σ c F).IsValid | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (sub σ c F) | Please generate a tactic in lean4 to solve the state.
STATE:
σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ (sub σ c F).IsValid
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_is_valid | [248, 1] | [260, 11] | intro D I V E | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (sub σ c F) | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I V E (sub σ c F) | Please generate a tactic in lean4 to solve the state.
STATE:
σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (sub σ c F)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_is_valid | [248, 1] | [260, 11] | simp only [substitution_theorem] | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I V E (sub σ c F) | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I (V ∘ σ) E F | Please generate a tactic in lean4 to solve the state.
STATE:
σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I V E (sub σ c F)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Sub/Var/All/Rec/Fresh/Sub.lean | FOL.NV.Sub.Var.All.Rec.Fresh.substitution_is_valid | [248, 1] | [260, 11] | apply h1 | σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I (V ∘ σ) E F | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
σ : VarName → VarName
c : Char
F : Formula
h1 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
⊢ Holds D I (V ∘ σ) E F
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_cons_to_set_union | [9, 1] | [17, 9] | ext a | α : Type
inst : DecidableEq α
ys : List α
x : α
⊢ ↑(x :: ys).toFinset = {x} ∪ ↑ys.toFinset | case h
α : Type
inst : DecidableEq α
ys : List α
x a : α
⊢ a ∈ ↑(x :: ys).toFinset ↔ a ∈ {x} ∪ ↑ys.toFinset | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst : DecidableEq α
ys : List α
x : α
⊢ ↑(x :: ys).toFinset = {x} ∪ ↑ys.toFinset
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_cons_to_set_union | [9, 1] | [17, 9] | simp | case h
α : Type
inst : DecidableEq α
ys : List α
x a : α
⊢ a ∈ ↑(x :: ys).toFinset ↔ a ∈ {x} ∪ ↑ys.toFinset | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h
α : Type
inst : DecidableEq α
ys : List α
x a : α
⊢ a ∈ ↑(x :: ys).toFinset ↔ a ∈ {x} ∪ ↑ys.toFinset
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_append_to_set_union | [19, 1] | [26, 9] | ext a | α : Type
inst : DecidableEq α
xs ys : List α
⊢ ↑(xs ++ ys).toFinset = ↑xs.toFinset ∪ ↑ys.toFinset | case h
α : Type
inst : DecidableEq α
xs ys : List α
a : α
⊢ a ∈ ↑(xs ++ ys).toFinset ↔ a ∈ ↑xs.toFinset ∪ ↑ys.toFinset | Please generate a tactic in lean4 to solve the state.
STATE:
α : Type
inst : DecidableEq α
xs ys : List α
⊢ ↑(xs ++ ys).toFinset = ↑xs.toFinset ∪ ↑ys.toFinset
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | list_append_to_set_union | [19, 1] | [26, 9] | simp | case h
α : Type
inst : DecidableEq α
xs ys : List α
a : α
⊢ a ∈ ↑(xs ++ ys).toFinset ↔ a ∈ ↑xs.toFinset ∪ ↑ys.toFinset | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h
α : Type
inst : DecidableEq α
xs ys : List α
a : α
⊢ a ∈ ↑(xs ++ ys).toFinset ↔ a ∈ ↑xs.toFinset ∪ ↑ys.toFinset
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | induction g | Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (x y : Node), y ∈ direct_succ_list g x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ g | case nil
Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ direct_succ_list [] x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ []
case cons
Node : Type
inst✝ : DecidableEq Node
head✝ : Node × List Node
tail✝ : List (Node × List Node)
tail_ih✝ : ∀ (x y : Node), y ∈ direct_succ_list tail✝ x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tail✝
⊢ ∀ (x... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
g : Graph Node
⊢ ∀ (x y : Node), y ∈ direct_succ_list g x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ g
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case nil =>
simp only [direct_succ_list]
simp | Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ direct_succ_list [] x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ [] | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ direct_succ_list [] x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp only [direct_succ_list] | Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ direct_succ_list [] x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ [] | Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ [] ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ [] | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ direct_succ_list [] x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp | Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ [] ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ [] | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
⊢ ∀ (x y : Node), y ∈ [] ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ []
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp only [direct_succ_list] | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (x y : Node), y ∈ direct_succ_list (hd :: tl) x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (x y : Node),
(y ∈ if hd.1 = x then hd.2 ++ direct_succ_list tl x else direct_succ_list tl x) ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (x y : Node), y ∈ direct_succ_list (hd :: tl) x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl
TACTIC... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro x y | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (x y : Node),
(y ∈ if hd.1 = x then hd.2 ++ direct_succ_list tl x else direct_succ_list tl x) ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
⊢ (y ∈ if hd.1 = x then hd.2 ++ direct_succ_list tl x else direct_succ_list tl x) ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
⊢ ∀ (x y : Node),
(y ∈ if hd.1 = x then hd.2 ++ direct_succ_list tl x else direct_succ_lis... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | split_ifs | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
⊢ (y ∈ if hd.1 = x then hd.2 ++ direct_succ_list tl x else direct_succ_list tl x) ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl | case pos
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
h✝ : hd.1 = x
⊢ y ∈ hd.2 ++ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl
case neg
Node : Type
inst✝ : DecidableEq Node
hd... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
⊢ (y ∈ if hd.1 = x then hd.2 ++ direct_succ_list tl x else direct_succ_list tl x) ↔... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | subst c1 | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : hd.1 = x
⊢ y ∈ hd.2 ++ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: tl | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ y ∈ hd.2 ++ direct_succ_list tl hd.1 ↔ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ hd :: tl | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
x y : Node
c1 : hd.1 = x
⊢ y ∈ hd.2 ++ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ hd :: ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ y ∈ hd.2 ++ direct_succ_list tl hd.1 ↔ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ hd :: tl | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ y ∈ hd.2 ∨ y ∈ direct_succ_list tl hd.1 ↔ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ y ∈ hd.2 ++ direct_succ_list tl hd.1 ↔ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ hd :: tl
TACTIC:... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | simp only [ih] | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ y ∈ hd.2 ∨ y ∈ direct_succ_list tl hd.1 ↔ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl) ↔ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ y ∈ hd.2 ∨ y ∈ direct_succ_list tl hd.1 ↔ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | constructor | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl) ↔ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl) → ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)
case mpr
Node : Type
inst✝ : Decidable... | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl) ↔ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | intro a1 | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl) → ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
⊢ (y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl) → ∃ ys, y ∈ ys ∧ ((hd.1, ys) = ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | cases a1 | case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | case mp.inl
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
h✝ : y ∈ hd.2
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)
case mp.inr
Node : Type
inst✝ : DecidableEq Node
hd : Node × List ... | Please generate a tactic in lean4 to solve the state.
STATE:
case mp
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
a1 : y ∈ hd.2 ∨ ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) =... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case _ left =>
apply Exists.intro hd.snd
tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
left : y ∈ hd.2
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
left : y ∈ hd.2
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/Parsing/DFT.lean | mem_direct_succ_list_iff | [65, 1] | [122, 16] | case _ right =>
apply Exists.elim right
intro zs a2
apply Exists.intro zs
tauto | Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys) ∈ tl) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Node : Type
inst✝ : DecidableEq Node
hd : Node × List Node
tl : List (Node × List Node)
ih : ∀ (x y : Node), y ∈ direct_succ_list tl x ↔ ∃ ys, y ∈ ys ∧ (x, ys) ∈ tl
y : Node
right : ∃ ys, y ∈ ys ∧ (hd.1, ys) ∈ tl
⊢ ∃ ys, y ∈ ys ∧ ((hd.1, ys) = hd ∨ (hd.1, ys)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.