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/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp only [Holds]
Δ : List Formula F : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E (false_.iff_ true_.not_)
Δ : List Formula F : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ False ↔ ¬True
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E (false_.iff_ true_.not_) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
tauto
Δ : List Formula F : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ False ↔ ¬True
no goals
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ False ↔ ¬True TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
intro D I V E _
Δ : List Formula F phi psi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E ((phi.and_ psi).iff_ (phi.imp_ psi.not_).not_)
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((phi.and_ psi).iff_ (phi.imp_ psi.not_).not_)
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E ((phi.and_ psi).iff_ (phi.imp_ psi.not_).not_) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp only [Holds]
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((phi.and_ psi).iff_ (phi.imp_ psi.not_).not_)
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E phi ∧ Holds D I V E psi ↔ ¬(Holds D I V E phi → ¬Holds D I V E psi)
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((phi.and_ psi).iff_ (phi.imp_ psi.not_).not_) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
tauto
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E phi ∧ Holds D I V E psi ↔ ¬(Holds D I V E phi → ¬Holds D I V E psi)
no goals
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E phi ∧ Holds D I V E psi ↔ ¬(Holds D I V E phi → ¬Holds D I V E psi) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
intro D I V E _
Δ : List Formula F phi psi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E ((phi.or_ psi).iff_ (phi.not_.imp_ psi))
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((phi.or_ psi).iff_ (phi.not_.imp_ psi))
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E ((phi.or_ psi).iff_ (phi.not_.imp_ psi)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp only [Holds]
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((phi.or_ psi).iff_ (phi.not_.imp_ psi))
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E phi ∨ Holds D I V E psi ↔ ¬Holds D I V E phi → Holds D I V E psi
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((phi.or_ psi).iff_ (phi.not_.imp_ psi)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
tauto
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E phi ∨ Holds D I V E psi ↔ ¬Holds D I V E phi → Holds D I V E psi
no goals
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E phi ∨ Holds D I V E psi ↔ ¬Holds D I V E phi → Holds D I V E psi TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
intro D I V E _
Δ : List Formula F phi psi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E (((phi.iff_ psi).imp_ ((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_).imp_ (((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_.imp_ (phi.iff_ ...
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E (((phi.iff_ psi).imp_ ((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_).imp_ (((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_.imp_ (phi.iff_ psi)).not_).not_
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E (((phi.iff_ psi).imp_ ((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_).imp_ ((...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp only [Holds]
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E (((phi.iff_ psi).imp_ ((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_).imp_ (((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_.imp_ (phi.iff_ psi)).not_).not_
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ ¬(((Holds D I V E phi ↔ Holds D I V E psi) → ¬((Holds D I V E phi → Holds D I V E psi) → ¬(Holds D I V E psi → Holds D I V E phi))) → ¬(¬((Holds D I V E phi → Holds D I V E psi) ...
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E (((phi.iff_ psi).imp_ ((phi.imp_ psi).imp_ (psi.imp_ phi).not_).not_).imp_ (((phi.imp_ psi).imp_ (psi.imp...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
tauto
Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ ¬(((Holds D I V E phi ↔ Holds D I V E psi) → ¬((Holds D I V E phi → Holds D I V E psi) → ¬(Holds D I V E psi → Holds D I V E phi))) → ¬(¬((Holds D I V E phi → Holds D I V E psi) ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F phi psi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ ¬(((Holds D I V E phi ↔ Holds D I V E psi) → ¬((Holds D I V E phi → Holds D I V E psi) → ¬(Holds D I V E psi → Holds D I V ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
intro D I V E _
Δ : List Formula F : Formula v : VarName phi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E ((exists_ v phi).iff_ (forall_ v phi.not_).not_)
Δ : List Formula F : Formula v : VarName phi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((exists_ v phi).iff_ (forall_ v phi.not_).not_)
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula v : VarName phi : Formula ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E ((exists_ v phi).iff_ (forall_ v phi.not_).not_) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp only [Holds]
Δ : List Formula F : Formula v : VarName phi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((exists_ v phi).iff_ (forall_ v phi.not_).not_)
Δ : List Formula F : Formula v : VarName phi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ (∃ d, Holds D I (Function.updateITE V v d) E phi) ↔ ¬∀ (d : D), ¬Holds D I (Function.updateITE V v d) E phi
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula v : VarName phi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ Holds D I V E ((exists_ v phi).iff_ (forall_ v phi.not_).not_) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp
Δ : List Formula F : Formula v : VarName phi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ (∃ d, Holds D I (Function.updateITE V v d) E phi) ↔ ¬∀ (d : D), ¬Holds D I (Function.updateITE V v d) E phi
no goals
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula v : VarName phi : Formula D : Type I : Interpretation D V : VarAssignment D E : Env a✝ : ∀ H ∈ [], Holds D I V E H ⊢ (∃ d, Holds D I (Function.updateITE V v d) E phi) ↔ ¬∀ (d : D), ¬Holds D I (Function.updateITE V v d) E phi TACTI...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
intro D I V E a1
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (...
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env a1 ...
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp at a1
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env a1 ...
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env a1 ...
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
obtain s1 := Sub.Pred.All.Rec.Option.Fresh.substitution_theorem D I V E freshChar τ
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env a1 ...
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env a1 ...
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp only [← s1] at a1
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env a1 ...
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env s1 ...
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
simp only [← s1]
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env s1 ...
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env s1 ...
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
apply ih_2
Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : Env s1 ...
case a Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : ...
Please generate a tactic in lean4 to solve the state. STATE: Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.soundness
[793, 1]
[979, 13]
exact a1
case a Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V E phi D : Type I : Interpretation D V : VarAssignment D E : ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case a Δ : List Formula F : Formula Δ' : List Formula phi : Formula τ : PredName → ℕ → Option (List VarName × Formula) a✝ : IsDeduct Δ' phi ih_2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ', Holds D I V E H) → Holds D I V...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.not_IsDeduct_false
[982, 1]
[988, 26]
intro contra
⊢ ¬IsDeduct [] false_
contra : IsDeduct [] false_ ⊢ False
Please generate a tactic in lean4 to solve the state. STATE: ⊢ ¬IsDeduct [] false_ TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.not_IsDeduct_false
[982, 1]
[988, 26]
obtain s1 := soundness [] false_ contra Unit default default default
contra : IsDeduct [] false_ ⊢ False
contra : IsDeduct [] false_ s1 : (∀ H ∈ [], Holds Unit default default default H) → Holds Unit default default default false_ ⊢ False
Please generate a tactic in lean4 to solve the state. STATE: contra : IsDeduct [] false_ ⊢ False TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.not_IsDeduct_false
[982, 1]
[988, 26]
simp at s1
contra : IsDeduct [] false_ s1 : (∀ H ∈ [], Holds Unit default default default H) → Holds Unit default default default false_ ⊢ False
contra : IsDeduct [] false_ s1 : Holds Unit default default default false_ ⊢ False
Please generate a tactic in lean4 to solve the state. STATE: contra : IsDeduct [] false_ s1 : (∀ H ∈ [], Holds Unit default default default H) → Holds Unit default default default false_ ⊢ False TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Program/Backend.lean
FOL.NV.Program.Backend.not_IsDeduct_false
[982, 1]
[988, 26]
simp only [Holds] at s1
contra : IsDeduct [] false_ s1 : Holds Unit default default default false_ ⊢ False
no goals
Please generate a tactic in lean4 to solve the state. STATE: contra : IsDeduct [] false_ s1 : Holds Unit default default default false_ ⊢ False TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
induction F generalizing V
D : Type I : Interpretation D V : VarAssignment D E : Env F : Formula σ : VarName → VarName h1 : Function.Injective σ ⊢ Holds D I (V ∘ σ) E F ↔ Holds D I V E (replaceAll σ F)
case pred_const_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : PredName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (pred_const_ a✝¹ a✝) ↔ Holds D I V E (replaceAll σ (pred_const_ a✝¹ a✝)) case pred_var_ D : Type I : Interpretation D E : Env σ : VarName → V...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D V : VarAssignment D E : Env F : Formula σ : VarName → VarName h1 : Function.Injective σ ⊢ Holds D I (V ∘ σ) E F ↔ Holds D I V E (replaceAll σ F) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
all_goals simp only [replaceAll]
case pred_const_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : PredName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (pred_const_ a✝¹ a✝) ↔ Holds D I V E (replaceAll σ (pred_const_ a✝¹ a✝)) case pred_var_ D : Type I : Interpretation D E : Env σ : VarName → V...
case pred_const_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : PredName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (pred_const_ a✝¹ a✝) ↔ Holds D I V E (pred_const_ a✝¹ (List.map σ a✝)) case pred_var_ D : Type I : Interpretation D E : Env σ : VarName → Var...
Please generate a tactic in lean4 to solve the state. STATE: case pred_const_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : PredName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (pred_const_ a✝¹ a✝) ↔ Holds D I V E (replaceAll σ (pred_const_ a✝¹ a✝)) case pr...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
any_goals simp only [Holds]
case pred_const_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : PredName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (pred_const_ a✝¹ a✝) ↔ Holds D I V E (pred_const_ a✝¹ (List.map σ a✝)) case pred_var_ D : Type I : Interpretation D E : Env σ : VarName → Var...
case pred_const_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : PredName a✝ : List VarName V : VarAssignment D ⊢ I.pred_const_ a✝¹ (List.map (V ∘ σ) a✝) ↔ I.pred_const_ a✝¹ (List.map V (List.map σ a✝)) case pred_var_ D : Type I : Interpretation D E : Env σ : VarName → VarNa...
Please generate a tactic in lean4 to solve the state. STATE: case pred_const_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : PredName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (pred_const_ a✝¹ a✝) ↔ Holds D I V E (pred_const_ a✝¹ (List.map σ a✝)) case pred...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
case pred_const_ X xs | pred_var_ X xs => simp
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ X : PredName xs : List VarName V : VarAssignment D ⊢ I.pred_var_ X (List.map (V ∘ σ) xs) ↔ I.pred_var_ X (List.map V (List.map σ xs))
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ X : PredName xs : List VarName V : VarAssignment D ⊢ I.pred_var_ X (List.map (V ∘ σ) xs) ↔ I.pred_var_ X (List.map V (List.map σ xs)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
case eq_ x y => simp
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x y : VarName V : VarAssignment D ⊢ (V ∘ σ) x = (V ∘ σ) y ↔ V (σ x) = V (σ y)
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x y : VarName V : VarAssignment D ⊢ (V ∘ σ) x = (V ∘ σ) y ↔ V (σ x) = V (σ y) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
case not_ phi phi_ih => congr! 1 exact phi_ih V
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ¬Holds D I (V ∘ σ) E phi ↔ ¬Holds D I V E (replaceAll σ phi)
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ¬Holds D I (V ∘ σ) E phi ↔ ¬Holds D I V E (r...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
case forall_ x phi phi_ih | exists_ x phi phi_ih => first | apply forall_congr' | apply exists_congr intro a have s1 : Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a apply Function.updateITE_comp_right_injective apply h1 simp only [← s1] exact phi_ih (Function.updateITE V (σ x) a)
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∃ d, Holds D I (Function.updateITE (V ∘ σ) x d) E phi) ↔ ∃ d, Holds D I (Function.update...
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∃ d, Holds D I (Function.update...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [replaceAll]
case def_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : DefName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (def_ a✝¹ a✝) ↔ Holds D I V E (replaceAll σ (def_ a✝¹ a✝))
case def_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : DefName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (def_ a✝¹ a✝) ↔ Holds D I V E (def_ a✝¹ (List.map σ a✝))
Please generate a tactic in lean4 to solve the state. STATE: case def_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : DefName a✝ : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (def_ a✝¹ a✝) ↔ Holds D I V E (replaceAll σ (def_ a✝¹ a✝)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [Holds]
case exists_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : VarName a✝ : Formula a_ih✝ : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E a✝ ↔ Holds D I V E (replaceAll σ a✝) V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (exists_ a✝¹ a✝) ↔ Holds D I V E (exists_ (σ a✝¹) (replaceAll ...
case exists_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : VarName a✝ : Formula a_ih✝ : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E a✝ ↔ Holds D I V E (replaceAll σ a✝) V : VarAssignment D ⊢ (∃ d, Holds D I (Function.updateITE (V ∘ σ) a✝¹ d) E a✝) ↔ ∃ d, Holds D I (Fun...
Please generate a tactic in lean4 to solve the state. STATE: case exists_ D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ a✝¹ : VarName a✝ : Formula a_ih✝ : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E a✝ ↔ Holds D I V E (replaceAll σ a✝) V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ X : PredName xs : List VarName V : VarAssignment D ⊢ I.pred_var_ X (List.map (V ∘ σ) xs) ↔ I.pred_var_ X (List.map V (List.map σ xs))
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ X : PredName xs : List VarName V : VarAssignment D ⊢ I.pred_var_ X (List.map (V ∘ σ) xs) ↔ I.pred_var_ X (List.map V (List.map σ xs)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x y : VarName V : VarAssignment D ⊢ (V ∘ σ) x = (V ∘ σ) y ↔ V (σ x) = V (σ y)
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x y : VarName V : VarAssignment D ⊢ (V ∘ σ) x = (V ∘ σ) y ↔ V (σ x) = V (σ y) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
congr! 1
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ¬Holds D I (V ∘ σ) E phi ↔ ¬Holds D I V E (replaceAll σ phi)
case a.h.e'_1.a D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi)
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ¬Holds D I (V ∘ σ) E phi ↔ ¬Holds D I V E (r...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
exact phi_ih V
case a.h.e'_1.a D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ 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 σ : VarName → VarName h1 : Function.Injective σ phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ Holds D I (V ∘ σ) E phi ↔ Ho...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
congr! 1
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi psi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) psi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E psi ↔ Holds D I V E (replaceAll σ psi) V : VarAssignment D ⊢ (Holds D...
case a.h.e'_1.a D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi psi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) psi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E psi ↔ Holds D I V E (replaceAll σ psi) V : VarAssignm...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi psi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) psi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E psi ↔ Ho...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
exact phi_ih V
case a.h.e'_1.a D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi psi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) psi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E psi ↔ Holds D I V E (replaceAll σ psi) V : VarAssignm...
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 σ : VarName → VarName h1 : Function.Injective σ phi psi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) psi_ih : ∀ (V : VarAssignment D), Holds D I (V...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
exact psi_ih V
case a.h.e'_2.a D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ phi psi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) psi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E psi ↔ Holds D I V E (replaceAll σ psi) V : VarAssignm...
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 σ : VarName → VarName h1 : Function.Injective σ phi psi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) psi_ih : ∀ (V : VarAssignment D), Holds D I (V...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
first | apply forall_congr' | apply exists_congr
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∃ d, Holds D I (Function.updateITE (V ∘ σ) x d) E phi) ↔ ∃ d, Holds D I (Function.update...
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ∀ (a : D), Holds D I (Function.updateITE (V ∘ σ) x a) E phi ↔ Holds D I (Function....
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∃ d, Holds D I (Function.update...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
intro a
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ∀ (a : D), Holds D I (Function.updateITE (V ∘ σ) x a) E phi ↔ Holds D I (Function....
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Holds D I (Function.updateITE (V ∘ σ) x a) E phi ↔ Holds D I (Function.updateITE...
Please generate a tactic in lean4 to solve the state. STATE: case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ∀ (a : D), Holds D I ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
have s1 : Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Holds D I (Function.updateITE (V ∘ σ) x a) E phi ↔ Holds D I (Function.updateITE...
case s1 D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a case h D : T...
Please generate a tactic in lean4 to solve the state. STATE: case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Holds D I (Function...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply Function.updateITE_comp_right_injective
case s1 D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a case h D : T...
case s1.h1 D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Function.Injective σ case h D : Type I : Interpretation D E : Env σ : VarNa...
Please generate a tactic in lean4 to solve the state. STATE: case s1 D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Function.updateITE...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply h1
case s1.h1 D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Function.Injective σ case h D : Type I : Interpretation D E : Env σ : VarNa...
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D s1 : Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a ⊢ Holds D I...
Please generate a tactic in lean4 to solve the state. STATE: case s1.h1 D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D ⊢ Function.Inject...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [← s1]
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D s1 : Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a ⊢ Holds D I...
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D s1 : Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a ⊢ Holds D I...
Please generate a tactic in lean4 to solve the state. STATE: case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D s1 : Function.updateI...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
exact phi_ih (Function.updateITE V (σ x) a)
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D s1 : Function.updateITE V (σ x) a ∘ σ = Function.updateITE (V ∘ σ) x a ⊢ Holds D I...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D a : D s1 : Function.updateI...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply forall_congr'
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∀ (d : D), Holds D I (Function.updateITE (V ∘ σ) x d) E phi) ↔ ∀ (d : D), Holds D I (Fun...
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ∀ (a : D), Holds D I (Function.updateITE (V ∘ σ) x a) E phi ↔ Holds D I (Function....
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∀ (d : D), Holds D I (Function....
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply exists_congr
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∃ d, Holds D I (Function.updateITE (V ∘ σ) x d) E phi) ↔ ∃ d, Holds D I (Function.update...
case h D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ ∀ (a : D), Holds D I (Function.updateITE (V ∘ σ) x a) E phi ↔ Holds D I (Function....
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ x : VarName phi : Formula phi_ih : ∀ (V : VarAssignment D), Holds D I (V ∘ σ) E phi ↔ Holds D I V E (replaceAll σ phi) V : VarAssignment D ⊢ (∃ d, Holds D I (Function.update...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
induction E
D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (def_ X xs) ↔ Holds D I V E (def_ X (List.map σ xs))
case nil D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) [] (def_ X xs) ↔ Holds D I V [] (def_ X (List.map σ xs)) case cons D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : ...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D E : Env σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) E (def_ X xs) ↔ Holds D I V E (def_ X (List.map σ xs)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
case nil => simp only [Holds]
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) [] (def_ X xs) ↔ Holds D I V [] (def_ X (List.map σ xs))
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) [] (def_ X xs) ↔ Holds D I V [] (def_ X (List.map σ xs)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [Holds]
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) [] (def_ X xs) ↔ Holds D I V [] (def_ X (List.map σ xs))
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D ⊢ Holds D I (V ∘ σ) [] (def_ X xs) ↔ Holds D I V [] (def_ X (List.map σ xs)) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [Holds]
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ Holds D I (V ∘ σ) (E_hd :: E_tl) (def_ X xs) ↔ Holds D I V (E_h...
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ (if X = E_hd.name ∧ xs.length = E_hd.args.length then Hol...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ Ho...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ (if X = E_hd.name ∧ xs.length = E_hd.args.length then Hol...
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ (if X = E_hd.name ∧ xs.length = E_hd.args.length then Hol...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ (i...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
split_ifs
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ (if X = E_hd.name ∧ xs.length = E_hd.args.length then Hol...
case pos D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) h✝ : X = E_hd.name ∧ xs.length = E_hd.args.length ⊢ Hold...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) ⊢ (i...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
case _ c1 => apply E_ih
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1 : ¬(X = E_hd.name ∧ xs.length = E_hd.args.length) ⊢ Holds D I ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1 :...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
cases c1
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1 : X = E_hd.name ∧ xs.length = E_hd.args.length ⊢ Holds D I (Fu...
case intro D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) left✝ : X = E_hd.name right✝ : xs.length = E_hd.args.l...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1 :...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply Holds_coincide_Var
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.args.length ⊢...
case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.args....
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_l...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
intro v a1
case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.args....
case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.args....
Please generate a tactic in lean4 to solve the state. STATE: case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ x...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [isFreeIn_iff_mem_freeVarSet v E_hd.q] at a1
case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.args....
case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.args....
Please generate a tactic in lean4 to solve the state. STATE: case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ x...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply Function.updateListITE_mem_eq_len
case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.args....
case h1.h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.ar...
Please generate a tactic in lean4 to solve the state. STATE: case h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ x...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [<- List.mem_toFinset]
case h1.h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.ar...
case h1.h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.ar...
Please generate a tactic in lean4 to solve the state. STATE: case h1.h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply Finset.mem_of_subset E_hd.h1 a1
case h1.h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.ar...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h1.h1 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp
case h1.h2 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.ar...
case h1.h2 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.ar...
Please generate a tactic in lean4 to solve the state. STATE: case h1.h2 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
simp only [c1_right]
case h1.h2 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1_left : X = E_hd.name c1_right : xs.length = E_hd.ar...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h1.h2 D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_theorem
[33, 1]
[96, 19]
apply E_ih
D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1 : ¬(X = E_hd.name ∧ xs.length = E_hd.args.length) ⊢ Holds D I ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D σ : VarName → VarName h1 : Function.Injective σ X : DefName xs : List VarName V : VarAssignment D E_hd : Definition E_tl : List Definition E_ih : Holds D I (V ∘ σ) E_tl (def_ X xs) ↔ Holds D I V E_tl (def_ X (List.map σ xs)) c1 :...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_is_valid
[99, 1]
[111, 13]
simp only [IsValid] at h2
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : F.IsValid ⊢ (replaceAll σ F).IsValid
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F ⊢ (replaceAll σ F).IsValid
Please generate a tactic in lean4 to solve the state. STATE: F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : F.IsValid ⊢ (replaceAll σ F).IsValid TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_is_valid
[99, 1]
[111, 13]
simp only [IsValid]
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F ⊢ (replaceAll σ F).IsValid
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (replaceAll σ F)
Please generate a tactic in lean4 to solve the state. STATE: F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F ⊢ (replaceAll σ F).IsValid TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_is_valid
[99, 1]
[111, 13]
intro D I V E
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (replaceAll σ F)
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F D : Type I : Interpretation D V : VarAssignment D E : Env ⊢ Holds D I V E (replaceAll σ F)
Please generate a tactic in lean4 to solve the state. STATE: F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F ⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E (replaceAll σ F) TACTIC:...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_is_valid
[99, 1]
[111, 13]
simp only [← substitution_theorem D I V E F σ h1]
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F D : Type I : Interpretation D V : VarAssignment D E : Env ⊢ Holds D I V E (replaceAll σ F)
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F D : Type I : Interpretation D V : VarAssignment D E : Env ⊢ Holds D I (V ∘ σ) E F
Please generate a tactic in lean4 to solve the state. STATE: F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F D : Type I : Interpretation D V : VarAssignment D E : Env ⊢ Holds D I V E (replaceAll σ F) TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Inj/ReplaceAll.lean
FOL.NV.Sub.Var.All.Rec.Inj.substitution_is_valid
[99, 1]
[111, 13]
apply h2
F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F D : Type I : Interpretation D V : VarAssignment D E : Env ⊢ Holds D I (V ∘ σ) E F
no goals
Please generate a tactic in lean4 to solve the state. STATE: F : Formula σ : VarName → VarName h1 : Function.Injective σ h2 : ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), Holds D I V E F D : Type I : Interpretation D V : VarAssignment D E : Env ⊢ Holds D I (V ∘ σ) E F TACTIC:
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
induction E generalizing F binders V V' σ σ'
D : Type I : Interpretation D V V' : VarAssignment D E : Env σ σ' : VarName → VarName binders : Finset VarName F : Formula h1 : admitsAux σ binders F h2 : ∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v) h2' : ∀ v ∈ binders, v = σ' v h3 : ∀ v ∉ binders, σ' v = σ v ⊢ Holds D I V E F ↔ Holds D I V' E (fast...
case nil D : Type I : Interpretation D V V' : VarAssignment D σ σ' : VarName → VarName binders : Finset VarName F : Formula h1 : admitsAux σ binders F h2 : ∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v) h2' : ∀ v ∈ binders, v = σ' v h3 : ∀ v ∉ binders, σ' v = σ v ⊢ Holds D I V [] F ↔ Holds D I V' [] (f...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D V V' : VarAssignment D E : Env σ σ' : VarName → VarName binders : Finset VarName F : Formula h1 : admitsAux σ binders F h2 : ∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v) h2' : ∀ v ∈ binders, v = σ' v h3 : ∀ v ∉...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
induction F generalizing binders V V' σ σ'
case cons D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v ...
case cons.pred_const_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈...
Please generate a tactic in lean4 to solve the state. STATE: case cons D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
all_goals simp only [admitsAux] at h1 simp only [fastReplaceFree] simp only [Holds]
case cons.pred_const_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈...
case cons.pred_const_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈...
Please generate a tactic in lean4 to solve the state. STATE: case cons.pred_const_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
case not_ phi phi_ih => congr! 1 exact phi_ih V V' σ σ' binders h1 h2 h2' h3
D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v = σ' v) → ...
no goals
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ bind...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
simp only [admitsAux] at h1
case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binder...
case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binder...
Please generate a tactic in lean4 to solve the state. STATE: case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binder...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
simp only [fastReplaceFree]
case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binder...
case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binder...
Please generate a tactic in lean4 to solve the state. STATE: case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binder...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
simp only [Holds]
case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binder...
case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binder...
Please generate a tactic in lean4 to solve the state. STATE: case cons.def_ D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binder...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
congr! 1
D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v = σ' v) → ...
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ bind...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
simp
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
simp only [List.map_eq_map_iff]
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
intro v a1
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
apply h2
case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
case a.h.e'_4.a D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binde...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_4 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
by_cases c1 : v ∈ binders
case a.h.e'_4.a D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binde...
case pos D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v =...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_4.a D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binde...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
left
case pos D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v =...
case pos.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
Please generate a tactic in lean4 to solve the state. STATE: case pos D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ'...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
exact c1
case pos.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case pos.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
right
case neg D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v =...
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
Please generate a tactic in lean4 to solve the state. STATE: case neg D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ'...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
simp only [h3 v c1]
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
Please generate a tactic in lean4 to solve the state. STATE: case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
exact h1 v a1 c1
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
cases h1
D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v = σ' v) → ...
case intro D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ bind...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
congr! 1
D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v = σ' v) → ...
case a.h.e'_2 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
Please generate a tactic in lean4 to solve the state. STATE: D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ bind...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
apply h2
case a.h.e'_2 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
case a.h.e'_2.a D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binde...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_2 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
by_cases c1 : x ∈ binders
case a.h.e'_2.a D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binde...
case pos D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v =...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_2.a D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binde...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
left
case pos D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v =...
case pos.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
Please generate a tactic in lean4 to solve the state. STATE: case pos D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ'...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
exact c1
case pos.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case pos.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
right
case neg D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v =...
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
Please generate a tactic in lean4 to solve the state. STATE: case neg D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ'...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
simp only [h3 x c1]
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
Please generate a tactic in lean4 to solve the state. STATE: case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
exact h1_left c1
case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders, v...
no goals
Please generate a tactic in lean4 to solve the state. STATE: case neg.h D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ ...
https://github.com/pthomas505/FOL.git
097a4abea51b641d144539b9a0f7516f3b9d818c
FOL/NV/Sub/Var/All/Rec/Admits.lean
FOL.NV.Sub.Var.All.Rec.substitution_theorem_aux
[74, 1]
[207, 28]
apply h2
case a.h.e'_3 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binders...
case a.h.e'_3.a D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders ∨ σ' v ∉ binders → V v = V' (σ' v)) → (∀ v ∈ binde...
Please generate a tactic in lean4 to solve the state. STATE: case a.h.e'_3 D : Type I : Interpretation D head✝ : Definition tail✝ : List Definition tail_ih✝ : ∀ (V V' : VarAssignment D) (σ σ' : VarName → VarName) (binders : Finset VarName) (F : Formula), admitsAux σ binders F → (∀ (v : VarName), v ∈ binders...