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/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ c1 =>
split at a1
case _ c2 =>
simp at c2
exact lt_add_of_tsub_lt_left c2
case _ c2 =>
simp only [Var.lc_at] at a1
simp at a1 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
a1 :
Var.lc_at j
(if x : i - j < (List.map free_ zs).length then (List.map free_ zs)[i - j]
else bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
a1 :
Var.lc_at j
(if x : i - j < (List.map free_ zs).length then (List.map free_ zs)[i - j]
else bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.lengt... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | linarith | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : i < j
a1 : Var.lc_at j (bound_ i)
⊢ i < j + zs.length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : i < j
a1 : Var.lc_at j (bound_ i)
⊢ i < j + zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | split at a1 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
a1 :
Var.lc_at j
(if x : i - j < (List.map free_ zs).length then (List.map free_ zs)[i - j]
else bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.length | case inl
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
h✝ : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
⊢ i < j + zs.length
case inr
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
h✝ : ¬i - j < (List.map fre... | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
a1 :
Var.lc_at j
(if x : i - j < (List.map free_ zs).length then (List.map free_ zs)[i - j]
else bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.lengt... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ c2 =>
simp at c2
exact lt_add_of_tsub_lt_left c2 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
⊢ i < j + zs.length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
⊢ i < j + zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ c2 =>
simp only [Var.lc_at] at a1
simp at a1 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : ¬i - j < (List.map free_ zs).length
a1 : Var.lc_at j (bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : ¬i - j < (List.map free_ zs).length
a1 : Var.lc_at j (bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp at c2 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
⊢ i < j + zs.length | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2✝ : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
c2 : i - j < zs.length
⊢ i < j + zs.length | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
⊢ i < j + zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | exact lt_add_of_tsub_lt_left c2 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2✝ : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
c2 : i - j < zs.length
⊢ i < j + zs.length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2✝ : i - j < (List.map free_ zs).length
a1 : Var.lc_at j (List.map free_ zs)[i - j]
c2 : i - j < zs.length
⊢ i < j + zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Var.lc_at] at a1 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : ¬i - j < (List.map free_ zs).length
a1 : Var.lc_at j (bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.length | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : ¬i - j < (List.map free_ zs).length
a1 : i - j - (List.map free_ zs).length + j < j
⊢ i < j + zs.length | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : ¬i - j < (List.map free_ zs).length
a1 : Var.lc_at j (bound_ (i - j - (List.map free_ zs).length + j))
⊢ i < j + zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp at a1 | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : ¬i - j < (List.map free_ zs).length
a1 : i - j - (List.map free_ zs).length + j < j
⊢ i < j + zs.length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a2 : bound_ i ∈ vs
c1 : ¬i < j
c2 : ¬i - j < (List.map free_ zs).length
a1 : i - j - (List.map free_ zs).length + j < j
⊢ i < j + zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | intro a1 v a2 | case mpr
X : String
vs : List Var
j : ℕ
zs : List String
⊢ (∀ v ∈ vs, Var.lc_at (j + zs.length) v) → ∀ v ∈ List.map (Var.openList j (List.map free_ zs)) vs, Var.lc_at j v | case mpr
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
v : Var
a2 : v ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j v | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
X : String
vs : List Var
j : ℕ
zs : List String
⊢ (∀ v ∈ vs, Var.lc_at (j + zs.length) v) → ∀ v ∈ List.map (Var.openList j (List.map free_ zs)) vs, Var.lc_at j v
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | cases v | case mpr
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
v : Var
a2 : v ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j v | case mpr.free_
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
a✝ : String
a2 : free_ a✝ ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (free_ a✝)
case mpr.bound_
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
a✝ :... | Please generate a tactic in lean4 to solve the state.
STATE:
case mpr
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
v : Var
a2 : v ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j v
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ x =>
simp only [Var.lc_at] | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
x : String
a2 : free_ x ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (free_ x) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
x : String
a2 : free_ x ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (free_ x)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ i =>
simp only [Var.lc_at]
simp at a2
apply Exists.elim a2
intro z a3
clear a2
cases a3
case _ a3_left a3_right =>
specialize a1 z a3_left
cases z
case _ x =>
simp only [Var.openList] at a3_right
case _ i' =>
simp only [Var.lc_at] at a1
simp only [Var.openList] at ... | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : bound_ i ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (bound_ i) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : bound_ i ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (bound_ i)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Var.lc_at] | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
x : String
a2 : free_ x ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (free_ x) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
x : String
a2 : free_ x ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (free_ x)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Var.lc_at] | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : bound_ i ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (bound_ i) | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : bound_ i ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : bound_ i ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ Var.lc_at j (bound_ i)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp at a2 | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : bound_ i ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : bound_ i ∈ List.map (Var.openList j (List.map free_ zs)) vs
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | apply Exists.elim a2 | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
⊢ ∀ (a : Var), a ∈ vs ∧ Var.openList j (List.map free_ zs) a = bound_ i → i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | intro z a3 | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
⊢ ∀ (a : Var), a ∈ vs ∧ Var.openList j (List.map free_ zs) a = bound_ i → i < j | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
z : Var
a3 : z ∈ vs ∧ Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
⊢ ∀ (a : Var), a ∈ vs ∧ Var.openList j (List.map free_ zs) a = bound_ i → i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | clear a2 | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
z : Var
a3 : z ∈ vs ∧ Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
a3 : z ∈ vs ∧ Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
a2 : ∃ a ∈ vs, Var.openList j (List.map free_ zs) a = bound_ i
z : Var
a3 : z ∈ vs ∧ Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | cases a3 | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
a3 : z ∈ vs ∧ Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j | case intro
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
left✝ : z ∈ vs
right✝ : Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
a3 : z ∈ vs ∧ Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ a3_left a3_right =>
specialize a1 z a3_left
cases z
case _ x =>
simp only [Var.openList] at a3_right
case _ i' =>
simp only [Var.lc_at] at a1
simp only [Var.openList] at a3_right
split at a3_right
case _ c1 =>
simp at a3_right
subst a3_right
exact c1
case _ c1 =>... | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
a3_left : z ∈ vs
a3_right : Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
a3_left : z ∈ vs
a3_right : Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | specialize a1 z a3_left | X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
a3_left : z ∈ vs
a3_right : Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
z : Var
a3_left : z ∈ vs
a3_right : Var.openList j (List.map free_ zs) z = bound_ i
a1 : Var.lc_at (j + zs.length) z
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
a1 : ∀ v ∈ vs, Var.lc_at (j + zs.length) v
i : ℕ
z : Var
a3_left : z ∈ vs
a3_right : Var.openList j (List.map free_ zs) z = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | cases z | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
z : Var
a3_left : z ∈ vs
a3_right : Var.openList j (List.map free_ zs) z = bound_ i
a1 : Var.lc_at (j + zs.length) z
⊢ i < j | case free_
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
a✝ : String
a3_left : free_ a✝ ∈ vs
a3_right : Var.openList j (List.map free_ zs) (free_ a✝) = bound_ i
a1 : Var.lc_at (j + zs.length) (free_ a✝)
⊢ i < j
case bound_
X : String
vs : List Var
j : ℕ
zs : List String
i a✝ : ℕ
a3_left : bound_ a✝ ∈ vs
a3_rig... | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
z : Var
a3_left : z ∈ vs
a3_right : Var.openList j (List.map free_ zs) z = bound_ i
a1 : Var.lc_at (j + zs.length) z
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ x =>
simp only [Var.openList] at a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
x : String
a3_left : free_ x ∈ vs
a3_right : Var.openList j (List.map free_ zs) (free_ x) = bound_ i
a1 : Var.lc_at (j + zs.length) (free_ x)
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
x : String
a3_left : free_ x ∈ vs
a3_right : Var.openList j (List.map free_ zs) (free_ x) = bound_ i
a1 : Var.lc_at (j + zs.length) (free_ x)
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ i' =>
simp only [Var.lc_at] at a1
simp only [Var.openList] at a3_right
split at a3_right
case _ c1 =>
simp at a3_right
subst a3_right
exact c1
case _ c1 =>
simp at c1
simp at a3_right
split at a3_right
case _ c2 =>
contradiction
case _ c2 =>
exfalso
app... | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a3_right : Var.openList j (List.map free_ zs) (bound_ i') = bound_ i
a1 : Var.lc_at (j + zs.length) (bound_ i')
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a3_right : Var.openList j (List.map free_ zs) (bound_ i') = bound_ i
a1 : Var.lc_at (j + zs.length) (bound_ i')
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Var.openList] at a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
x : String
a3_left : free_ x ∈ vs
a3_right : Var.openList j (List.map free_ zs) (free_ x) = bound_ i
a1 : Var.lc_at (j + zs.length) (free_ x)
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i : ℕ
x : String
a3_left : free_ x ∈ vs
a3_right : Var.openList j (List.map free_ zs) (free_ x) = bound_ i
a1 : Var.lc_at (j + zs.length) (free_ x)
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Var.lc_at] at a1 | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a3_right : Var.openList j (List.map free_ zs) (bound_ i') = bound_ i
a1 : Var.lc_at (j + zs.length) (bound_ i')
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a3_right : Var.openList j (List.map free_ zs) (bound_ i') = bound_ i
a1 : i' < j + zs.length
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a3_right : Var.openList j (List.map free_ zs) (bound_ i') = bound_ i
a1 : Var.lc_at (j + zs.length) (bound_ i')
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Var.openList] at a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a3_right : Var.openList j (List.map free_ zs) (bound_ i') = bound_ i
a1 : i' < j + zs.length
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
a3_right :
(if i' < j then bound_ i'
else
if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).length + j)) =
bound_ i
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a3_right : Var.openList j (List.map free_ zs) (bound_ i') = bound_ i
a1 : i' < j + zs.length
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | split at a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
a3_right :
(if i' < j then bound_ i'
else
if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).length + j)) =
bound_ i
⊢ i < j | case inl
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
h✝ : i' < j
a3_right : bound_ i' = bound_ i
⊢ i < j
case inr
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
h✝ : ¬i' < j
a3_right :
(if x : i' ... | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
a3_right :
(if i' < j then bound_ i'
else
if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' -... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ c1 =>
simp at a3_right
subst a3_right
exact c1 | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
a3_right : bound_ i' = bound_ i
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
a3_right : bound_ i' = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ c1 =>
simp at c1
simp at a3_right
split at a3_right
case _ c2 =>
contradiction
case _ c2 =>
exfalso
apply c2
exact Nat.sub_lt_left_of_lt_add c1 a1 | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : ¬i' < j
a3_right :
(if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).length + j)) =
bound_ i
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : ¬i' < j
a3_right :
(if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).leng... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp at a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
a3_right : bound_ i' = bound_ i
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
a3_right : i' = i
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
a3_right : bound_ i' = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | subst a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
a3_right : i' = i
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
⊢ i' < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
a3_right : i' = i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | exact c1 | X : String
vs : List Var
j : ℕ
zs : List String
i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
⊢ i' < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : i' < j
⊢ i' < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp at c1 | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : ¬i' < j
a3_right :
(if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).length + j)) =
bound_ i
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
a3_right :
(if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).length + j)) =
bound_ i
c1 : j ≤ i'
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : ¬i' < j
a3_right :
(if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).leng... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp at a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
a3_right :
(if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).length + j)) =
bound_ i
c1 : j ≤ i'
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
a3_right : (if h : i' - j < zs.length then free_ (zs.get ⟨i' - j, ⋯⟩) else bound_ (i' - j - zs.length + j)) = bound_ i
⊢ i < j | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
a3_right :
(if x : i' - j < (List.map free_ zs).length then (List.map free_ zs)[i' - j]
else bound_ (i' - j - (List.map free_ zs).length + j)) =
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | split at a3_right | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
a3_right : (if h : i' - j < zs.length then free_ (zs.get ⟨i' - j, ⋯⟩) else bound_ (i' - j - zs.length + j)) = bound_ i
⊢ i < j | case inl
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
h✝ : i' - j < zs.length
a3_right : False
⊢ i < j
case inr
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
h✝ : ¬i' - j < z... | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
a3_right : (if h : i' - j < zs.length then free_ (zs.get ⟨i' - j, ⋯⟩) else bound_ (i' - j - zs.length + j)) = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ c2 =>
contradiction | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : i' - j < zs.length
a3_right : False
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : i' - j < zs.length
a3_right : False
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | case _ c2 =>
exfalso
apply c2
exact Nat.sub_lt_left_of_lt_add c1 a1 | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | contradiction | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : i' - j < zs.length
a3_right : False
⊢ i < j | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : i' - j < zs.length
a3_right : False
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | exfalso | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ i < j | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ False | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ i < j
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | apply c2 | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ False | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ i' - j < zs.length | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ False
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | exact Nat.sub_lt_left_of_lt_add c1 a1 | X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ i' - j < zs.length | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
X : String
vs : List Var
j : ℕ
zs : List String
i i' : ℕ
a3_left : bound_ i' ∈ vs
a1 : i' < j + zs.length
c1 : j ≤ i'
c2 : ¬i' - j < zs.length
a3_right : bound_ (i' - j - zs.length + j) = bound_ i
⊢ i' - j < zs.length
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Formula.openList] | phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi.not_) ↔ Formula.lc_at (j + zs.length) phi.not_ | phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi).not_ ↔ Formula.lc_at (j + zs.length) phi.not_ | Please generate a tactic in lean4 to solve the state.
STATE:
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi.not_) ↔ Formula.lc... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Formula.lc_at] | phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi).not_ ↔ Formula.lc_at (j + zs.length) phi.not_ | phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi | Please generate a tactic in lean4 to solve the state.
STATE:
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi).not_ ↔ Formula.lc... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | apply phi_ih | phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Formula.openList] | phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j : ℕ
zs : List St... | phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j : ℕ
zs : List St... | Please generate a tactic in lean4 to solve the state.
STATE:
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Formula.lc_at] | phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j : ℕ
zs : List St... | phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j : ℕ
zs : List St... | Please generate a tactic in lean4 to solve the state.
STATE:
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | congr! 1 | phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j : ℕ
zs : List St... | case a.h.e'_1.a
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j ... | Please generate a tactic in lean4 to solve the state.
STATE:
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | apply phi_ih | case a.h.e'_1.a
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_1.a
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (L... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | apply psi_ih | case a.h.e'_2.a
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
j ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a.h.e'_2.a
phi psi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
psi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (L... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Formula.openList] | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) (forall_ a✝ phi)) ↔
Formula.lc_at (j + zs.length) (forall_ a✝ phi) | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (forall_ a✝ (Formula.openList (j + 1) (List.map free_ zs) phi)) ↔
Formula.lc_at (j + zs.length) (forall_ a✝... | Please generate a tactic in lean4 to solve the state.
STATE:
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (Formula.openList j (List.map free_ zs) (forall_ a... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [Formula.lc_at] | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (forall_ a✝ (Formula.openList (j + 1) (List.map free_ zs) phi)) ↔
Formula.lc_at (j + zs.length) (forall_ a✝... | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at (j + 1) (Formula.openList (j + 1) (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length + 1) phi | Please generate a tactic in lean4 to solve the state.
STATE:
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at j (forall_ a✝ (Formula.openList (j + 1) (List.map fr... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [phi_ih] | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at (j + 1) (Formula.openList (j + 1) (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length + 1) phi | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at (j + 1 + zs.length) phi ↔ Formula.lc_at (j + zs.length + 1) phi | Please generate a tactic in lean4 to solve the state.
STATE:
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at (j + 1) (Formula.openList (j + 1) (List.map free_ zs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | have s1 : j + 1 + List.length zs = j + List.length zs + 1 | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at (j + 1 + zs.length) phi ↔ Formula.lc_at (j + zs.length + 1) phi | case s1
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ j + 1 + zs.length = j + zs.length + 1
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.l... | Please generate a tactic in lean4 to solve the state.
STATE:
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ Formula.lc_at (j + 1 + zs.length) phi ↔ Formula.lc_at (j + zs.leng... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | linarith | case s1
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ j + 1 + zs.length = j + zs.length + 1
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.l... | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
s1 : j + 1 + zs.length = j + zs.length + 1
⊢ Formula.lc_at (j + 1 + zs.length) phi ↔ Formula.lc_at (j + zs.length + 1) phi | Please generate a tactic in lean4 to solve the state.
STATE:
case s1
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
⊢ j + 1 + zs.length = j + zs.length + 1
a✝ : String
phi : F... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/LN/Paper.lean | LN.lc_at_instantiate | [1259, 1] | [1342, 19] | simp only [s1] | a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
s1 : j + 1 + zs.length = j + zs.length + 1
⊢ Formula.lc_at (j + 1 + zs.length) phi ↔ Formula.lc_at (j + zs.length + 1) phi | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
a✝ : String
phi : Formula
phi_ih :
∀ (j : ℕ) (zs : List String),
Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
j : ℕ
zs : List String
s1 : j + 1 + zs.length = j + zs.length + 1
⊢ Formula.lc_at (j + 1 + ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | induction h1 | Δ : List Formula
F : Formula
h1 : IsDeduct Δ F
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ, Holds D I V E H) → Holds D I V E F | case struct_1_
Δ : List Formula
F : Formula
Δ✝ : List Formula
H✝ phi✝ : Formula
a✝ : IsDeduct Δ✝ phi✝
a_ih✝ :
∀ (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),
(∀ H ∈ H✝ :: Δ✝... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
h1 : IsDeduct Δ F
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ Δ, Holds D I V E H) → Holds D I V E F
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case struct_1_ Δ' H _ _ ih_2 =>
intro D I V E a1
apply ih_2
intro H' a2
simp at a1
cases a1
case _ a1_left a1_right =>
exact a1_right H' a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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),
(∀ H_1 ∈ H :: Δ', Holds D I V E ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : Var... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case struct_2_ Δ' H _ _ ih_2 =>
intro D I V E a1
apply ih_2
intro H' a2
simp at a1
cases a1
case _ a1_left a1_right =>
simp at a2
cases a2
case _ a2 =>
simp only [a2]
exact a1_left
case _ a2 =>
exact a1_right H' a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
⊢ ∀ (D : Type) (... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case struct_3_ Δ_1 Δ_2 H_1 H_2 _ _ ih_2 =>
intro D I V E a1
apply ih_2
intro H' a2
simp at a1
apply a1
simp at a2
tauto | Δ : List Formula
F : Formula
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H) → Holds D I V E phi✝
⊢ ∀ (D : Type) (I : Interpretation D) ... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case assume_ phi =>
intro D I V E a1
simp at a1
exact a1 | Δ : List Formula
F phi : Formula
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [phi], Holds D I V E H) → Holds D I V E phi | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F phi : Formula
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [phi], Holds D I V E H) → Holds D I V E phi
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case prop_0_ =>
intro D I V E _
simp only [Holds] | Δ : List Formula
F : Formula
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (∀ H ∈ [], Holds D I V E H) → Holds D I V E 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), (∀ H ∈ [], Holds D I V E H) → Holds D I V E true_
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case prop_1_ phi psi =>
intro D I V E _
simp only [Holds]
tauto | Δ : 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.imp_ (psi.imp_ phi)) | 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),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E (phi.imp_ (psi.imp_ phi))
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case prop_2_ phi psi chi =>
intro D I V E _
simp only [Holds]
tauto | Δ : List Formula
F phi psi chi : Formula
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E ((phi.imp_ (psi.imp_ chi)).imp_ ((phi.imp_ psi).imp_ (phi.imp_ chi))) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F phi psi chi : Formula
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E ((phi.imp_ (psi.imp_ chi)).imp_ ((phi.imp_ psi).imp_ (phi.imp_ chi)))
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case prop_3_ phi psi =>
intro D I V E _
simp only [Holds]
tauto | Δ : 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.not_.imp_ psi.not_).imp_ (psi.imp_ phi)) | 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),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E ((phi.not_.imp_ psi.not_).imp_ (psi.imp_ phi))
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case pred_1_ v phi psi =>
intro D I V E _
simp only [Holds]
intro a2 a3 d
apply a2 d
exact a3 d | Δ : List Formula
F : Formula
v : VarName
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 ((forall_ v (phi.imp_ psi)).imp_ ((forall_ v phi).imp_ (forall_ v psi))) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
v : VarName
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 ((forall_ v (phi.imp_ psi)).imp_ ((forall_ v phi).imp_ (forall_ v psi)))
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case pred_2_ v t phi =>
intro D I V E _
obtain s1 := FOL.NV.Sub.Var.All.Rec.Fresh.substitution_theorem D I V E (Function.updateITE id v t) freshChar phi
simp only [Holds]
intro a2
simp only [s1]
simp only [Function.updateITE_comp_left]
simp
exact a2 (V t) | Δ : List Formula
F : Formula
v t : 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 ((forall_ v phi).imp_ (Sub.Var.All.Rec.Fresh.sub (Function.updateITE id v t) freshChar phi)) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
v t : 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 ((forall_ v phi).imp_ (Sub.Var.All.Rec.Fresh.sub (Function.updateITE id v t) ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case pred_3_ v phi ih =>
intro D I V E _
simp only [Holds]
intro a2 d
have s1 : Holds D I (Function.updateITE V v d) E phi ↔ Holds D I V E phi
{
apply Holds_coincide_Var
intro v' a1
simp only [Function.updateITE]
split_ifs
case _ c1 =>
subst c1
contradiction
case _ c1 =>
... | Δ : List Formula
F : Formula
v : VarName
phi : Formula
ih : ¬isFreeIn v phi
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E (phi.imp_ (forall_ v phi)) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
v : VarName
phi : Formula
ih : ¬isFreeIn v phi
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E (phi.imp_ (forall_ v phi))
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case gen_ v phi _ ih_2 =>
intro D I V E _
simp only [Holds]
intro d
apply ih_2
simp | Δ : List Formula
F : Formula
v : VarName
phi : 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),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
v : VarName
phi : 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 ... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case eq_1_ v =>
intro D I V E _
simp only [Holds] | Δ : List Formula
F : Formula
v : VarName
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E (eq_ v v) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
v : VarName
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E (eq_ v v)
TACTIC:
|
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case eq_2_eq_ x_0 x_1 y_0 y_1 =>
intro D I V E _
simp only [Holds]
intro a2
cases a2
case _ a2_left a2_right =>
simp only [a2_left]
simp only [a2_right] | Δ : List Formula
F : Formula
x_0 x_1 y_0 y_1 : VarName
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) →
Holds D I V E (((eq_ x_0 y_0).and_ (eq_ x_1 y_1)).imp_ ((eq_ x_0 x_1).iff_ (eq_ y_0 y_1))) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
x_0 x_1 y_0 y_1 : VarName
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) →
Holds D I V E (((eq_ x_0 y_0).and_ (eq_ x_1 y_1)).imp_ ((eq_ x_0 x_1).iff_ (eq_ y_0 y_1)))
TA... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case def_false_ =>
intro D I V E _
simp only [Holds]
tauto | Δ : List Formula
F : Formula
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ [], Holds D I V E H) → Holds D I V E (false_.iff_ true_.not_) | 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),
(∀ 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] | case def_and_ phi psi =>
intro D I V E _
simp only [Holds]
tauto | Δ : 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_) | 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),
(∀ 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] | case def_or_ phi psi =>
intro D I V E _
simp only [Holds]
tauto | Δ : 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)) | 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),
(∀ 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] | case def_iff_ phi psi =>
intro D I V E _
simp only [Holds]
tauto | Δ : 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_ ... | 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),
(∀ 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] | case def_exists_ v phi =>
intro D I V E _
simp only [Holds]
simp | Δ : 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_) | 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),
(∀ 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] | case sub_ Δ' phi τ _ ih_2 =>
intro D I V E a1
simp at a1
obtain s1 := Sub.Pred.All.Rec.Option.Fresh.substitution_theorem D I V E freshChar τ
simp only [← s1] at a1
simp only [← s1]
apply ih_2
exact 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) (... | no goals | 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] | intro D I V E a1 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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),
(∀ H_1 ∈ H :: Δ', Holds D I V E ... | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : ∀ H_1 ∈ H :: Δ', Holds D I V E H_1
⊢ Holds D... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : Var... |
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
H phi✝ : 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 : ∀ H_1 ∈ H :: Δ', Holds D I V E H_1
⊢ Holds D... | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : ∀ H_1 ∈ H :: Δ', Holds D I V E H_1
⊢ ... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : VarAssignmen... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | intro H' a2 | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : ∀ H_1 ∈ H :: Δ', Holds D I V E H_1
⊢ ... | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : ∀ H_1 ∈ H :: Δ', Holds D I V E H_1
H'... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : VarAs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | simp at a1 | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : ∀ H_1 ∈ H :: Δ', Holds D I V E H_1
H'... | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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
H' : Formula
a2 : H' ∈ Δ'
a1 : Holds D I V... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : VarAs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | cases a1 | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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
H' : Formula
a2 : H' ∈ Δ'
a1 : Holds D I V... | case a.intro
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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
H' : Formula
a2 : H' ∈ Δ'
left✝ : Ho... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : VarAs... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case _ a1_left a1_right =>
exact a1_right H' a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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
H' : Formula
a2 : H' ∈ Δ'
a1_left : Holds D I V E... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : VarAssignmen... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | exact a1_right H' a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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
H' : Formula
a2 : H' ∈ Δ'
a1_left : Holds D I V E... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : 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 : VarAssignmen... |
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
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
⊢ ∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀... | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
a1 : ∀ H_1 ∈ H :: Δ... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
⊢ ∀ (D : Type) (... |
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
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
a1 : ∀ H_1 ∈ H :: Δ... | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
a1 : ∀ H_1 ∈... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | intro H' a2 | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
a1 : ∀ H_1 ∈... | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
a1 : ∀ H_1 ∈... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | simp at a1 | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
a1 : ∀ H_1 ∈... | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | cases a1 | case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula... | case a.intro
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : F... | Please generate a tactic in lean4 to solve the state.
STATE:
case a
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case _ a1_left a1_right =>
simp at a2
cases a2
case _ a2 =>
simp only [a2]
exact a1_left
case _ a2 =>
exact a1_right H' a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a2 : H... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | simp at a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a2 : H... | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | cases a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | case inl
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formu... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case _ a2 =>
simp only [a2]
exact a1_left | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | case _ a2 =>
exact a1_right H' a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | simp only [a2] | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | exact a1_left | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
https://github.com/pthomas505/FOL.git | 097a4abea51b641d144539b9a0f7516f3b9d818c | FOL/NV/Program/Backend.lean | FOL.NV.Program.Backend.soundness | [793, 1] | [979, 13] | exact a1_right H' a2 | Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarAssignment D
E : Env
H' : Formula
a1_lef... | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ' : List Formula
H phi✝ : Formula
a✝ : IsDeduct (H :: H :: Δ') phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H_1 ∈ H :: H :: Δ', Holds D I V E H_1) → Holds D I V E phi✝
D : Type
I : Int... |
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
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H) → Holds D I V E phi✝
⊢ ∀ (D : Type) (I : Interpretation D) ... | Δ : List Formula
F : Formula
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarA... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H... |
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
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H) → Holds D I V E phi✝
D : Type
I : Interpretation D
V : VarA... | case a
Δ : List Formula
F : Formula
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H) → Holds D I V E phi✝
D : Type
I : Interpretation D
V... | Please generate a tactic in lean4 to solve the state.
STATE:
Δ : List Formula
F : Formula
Δ_1 Δ_2 : List Formula
H_1 H_2 phi✝ : Formula
a✝ : IsDeduct (Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2) phi✝
ih_2 :
∀ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env),
(∀ H ∈ Δ_1 ++ [H_1] ++ [H_2] ++ Δ_2, Holds D I V E H... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.