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
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
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
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 free_ zs).length a1 : Var.lc_at j (bound_ (i - j - (List.map free_ zs).length + j)) ⊒ i < j + zs.length
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
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
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
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
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
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
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
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✝ : β„• a2 : bound_ a✝ ∈ List.map (Var.openList j (List.map free_ zs)) vs ⊒ Var.lc_at j (bound_ a✝)
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
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 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 apply c2 exact Nat.sub_lt_left_of_lt_add c1 a1
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
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
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
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
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
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
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
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
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 => 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 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
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
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_right : Var.openList j (List.map free_ zs) (bound_ a✝) = bound_ i a1 : Var.lc_at (j + zs.length) (bound_ a✝) ⊒ i < j
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
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 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 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
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
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
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
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' - 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
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
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
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
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
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
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
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
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 < zs.length a3_right : bound_ (i' - j - zs.length + j) = bound_ i ⊒ i < j
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
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
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
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
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
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
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_
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
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
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 String ⊒ Formula.lc_at j (Formula.openList j (List.map free_ zs) (phi.imp_ psi)) ↔ Formula.lc_at (j + zs.length) (phi.imp_ psi)
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 String ⊒ Formula.lc_at j ((Formula.openList j (List.map free_ zs) phi).imp_ (Formula.openList j (List.map free_ zs) psi)) ↔ Formula.lc_at (j + zs.length) (phi.imp_ psi)
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 String ⊒ Formula.lc_at j ((Formula.openList j (List.map free_ zs) phi).imp_ (Formula.openList j (List.map free_ zs) psi)) ↔ Formula.lc_at (j + zs.length) (phi.imp_ psi)
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 String ⊒ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ∧ Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) phi ∧ Formula.lc_at (j + zs.length) psi
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 String ⊒ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ∧ Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) phi ∧ Formula.lc_at (j + zs.length) psi
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 : β„• zs : List String ⊒ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi 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 : β„• zs : List String ⊒ Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
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 : β„• zs : List String ⊒ Formula.lc_at j (Formula.openList j (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length) phi
no goals
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 : β„• zs : List String ⊒ Formula.lc_at j (Formula.openList j (List.map free_ zs) psi) ↔ Formula.lc_at (j + zs.length) psi
no goals
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✝ phi)
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✝ 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) (Formula.openList (j + 1) (List.map free_ zs) phi) ↔ Formula.lc_at (j + zs.length + 1) phi
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
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.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
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.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
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
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
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✝ :: Ξ”βœ, Holds D I V E H) β†’ Holds D I V E phi✝ case struct_2_ Ξ” : List Formula F : Formula Ξ”βœ : List Formula H✝ phi✝ : Formula a✝ : IsDeduct (H✝ :: H✝ :: Ξ”βœ) phi✝ a_ih✝ : βˆ€ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (βˆ€ H ∈ H✝ :: 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✝ :: Ξ”βœ, Holds D I V E H) β†’ Holds D I V E phi✝ case struct_3_ Ξ” : List Formula F : Formula Ξ”_1✝ Ξ”_2✝ : List Formula H_1✝ H_2✝ phi✝ : Formula a✝ : IsDeduct (Ξ”_1✝ ++ [H_1✝] ++ [H_2✝] ++ Ξ”_2✝) phi✝ a_ih✝ : βˆ€ (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 : VarAssignment D) (E : Env), (βˆ€ H ∈ Ξ”_1✝ ++ [H_2✝] ++ [H_1✝] ++ Ξ”_2✝, Holds D I V E H) β†’ Holds D I V E phi✝ case assume_ Ξ” : 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✝ case prop_0_ Ξ” : 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_ case prop_1_ Ξ” : 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✝)) case prop_2_ Ξ” : 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✝))) case prop_3_ Ξ” : 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✝)) case mp_ Ξ” : List Formula F : Formula Ξ”βœ : List Formula phi✝ psi✝ : Formula a✝¹ : IsDeduct Ξ”βœ (phi✝.imp_ psi✝) 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✝.imp_ psi✝) 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 ∈ Ξ”βœ, Holds D I V E H) β†’ Holds D I V E psi✝ case dt_ Ξ” : List Formula F : Formula Ξ”βœ : List Formula H✝ phi✝ : Formula a✝ : IsDeduct (H✝ :: Ξ”βœ) phi✝ a_ih✝ : βˆ€ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (βˆ€ H ∈ 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 (H✝.imp_ phi✝) case pred_1_ Ξ” : 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✝))) case pred_2_ Ξ” : 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✝)) case pred_3_ Ξ” : List Formula F : Formula v✝ : VarName phi✝ : Formula a✝ : Β¬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✝)) case gen_ Ξ” : List Formula F : Formula v✝ : VarName 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 ∈ [], Holds D I V E H) β†’ Holds D I V E (forall_ v✝ phi✝) case eq_1_ Ξ” : 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✝) case eq_2_pred_var_ Ξ” : List Formula F : Formula name✝ : PredName xs✝ ys✝ : List VarName a✝ : xs✝.length = ys✝.length ⊒ βˆ€ (D : Type) (I : Interpretation D) (V : VarAssignment D) (E : Env), (βˆ€ H ∈ [], Holds D I V E H) β†’ Holds D I V E ((List.foldr and_ true_ (List.zipWith eq_ xs✝ ys✝)).imp_ ((pred_var_ name✝ xs✝).iff_ (pred_var_ name✝ ys✝))) case eq_2_eq_ Ξ” : 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✝))) case def_false_ Ξ” : 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_) case def_and_ Ξ” : 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_) case def_or_ Ξ” : 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✝)) case def_iff_ Ξ” : 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_ psi✝)).not_).not_ case def_exists_ Ξ” : 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_) case sub_ Ξ” : List Formula F : Formula Ξ”βœ : List Formula phi✝ : Formula Ο„βœ : PredName β†’ β„• β†’ Option (List VarName Γ— 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 ∈ List.map (Sub.Pred.All.Rec.Option.Fresh.sub freshChar Ο„βœ) Ξ”βœ, Holds D I V E H) β†’ Holds D I V E (Sub.Pred.All.Rec.Option.Fresh.sub freshChar Ο„βœ phi✝)
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 H_1) β†’ Holds D I V E phi✝
no goals
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), (βˆ€ H_1 ∈ H :: Ξ”', Holds D I V E H_1) β†’ Holds D I V E phi✝
no goals
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) (V : VarAssignment D) (E : Env), (βˆ€ H ∈ Ξ”_1 ++ [H_2] ++ [H_1] ++ Ξ”_2, Holds D I V E H) β†’ Holds D I V E phi✝
no goals
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
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
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
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
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
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
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
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 => rfl } simp only [s1] exact a2
Ξ” : 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
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 (forall_ v phi)
no goals
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
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
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
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
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
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_ psi)).not_).not_
no goals
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
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) (E : Env), (βˆ€ H ∈ List.map (Sub.Pred.All.Rec.Option.Fresh.sub freshChar Ο„) Ξ”', Holds D I V E H) β†’ Holds D I V E (Sub.Pred.All.Rec.Option.Fresh.sub freshChar Ο„ phi)
no goals
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 H_1) β†’ Holds D I V E phi✝
Ξ” : 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 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 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 I V E phi✝
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 ∈ Ξ”', 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]
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 ⊒ βˆ€ H ∈ Ξ”', Holds D I V E 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 a1 : βˆ€ H_1 ∈ H :: Ξ”', Holds D I V E H_1 H' : Formula a2 : H' ∈ Ξ”' ⊒ 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]
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' : Formula a2 : H' ∈ Ξ”' ⊒ Holds D I V E 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 E H ∧ βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ 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]
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 E H ∧ βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ Holds D I V E H'
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✝ : Holds D I V E H right✝ : βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ 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 _ 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 H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ Holds D I V E H'
no goals
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 H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ Holds D I V E H'
no goals
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), (βˆ€ H_1 ∈ H :: Ξ”', Holds D I V E H_1) β†’ Holds D I V E phi✝
Ξ” : 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 :: Ξ”', Holds D I V E H_1 ⊒ 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 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 :: Ξ”', Holds D I V E H_1 ⊒ Holds D I V E phi✝
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 ∈ H :: Ξ”', Holds D I V E H_1 ⊒ βˆ€ H_1 ∈ H :: H :: Ξ”', Holds D I V E H_1
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 ∈ H :: Ξ”', Holds D I V E H_1 ⊒ βˆ€ H_1 ∈ H :: H :: Ξ”', Holds D I V E 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 ∈ H :: Ξ”', Holds D I V E H_1 H' : Formula a2 : H' ∈ H :: H :: Ξ”' ⊒ 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]
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 ∈ H :: Ξ”', Holds D I V E H_1 H' : Formula a2 : H' ∈ H :: H :: Ξ”' ⊒ Holds D I V E 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 H' : Formula a2 : H' ∈ H :: H :: Ξ”' a1 : Holds D I V E H ∧ βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ 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]
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 a2 : H' ∈ H :: H :: Ξ”' a1 : Holds D I V E H ∧ βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ Holds D I V E H'
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' : Formula a2 : H' ∈ H :: H :: Ξ”' left✝ : Holds D I V E H right✝ : βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ 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 _ 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' ∈ H :: H :: Ξ”' a1_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ Holds D I V E H'
no goals
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' ∈ H :: H :: Ξ”' a1_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a ⊒ Holds D I V E 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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' = H ∨ H' ∈ Ξ”' ⊒ 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]
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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' = H ∨ H' ∈ Ξ”' ⊒ Holds D I V E H'
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' : Formula a1_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a h✝ : H' = H ⊒ Holds D I V E H' case inr Ξ” : 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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a h✝ : H' ∈ Ξ”' ⊒ 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 _ 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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' = H ⊒ Holds D I V E H'
no goals
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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' ∈ Ξ”' ⊒ Holds D I V E H'
no goals
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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' = H ⊒ Holds D I V E 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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' = H ⊒ 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]
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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' = H ⊒ Holds D I V E H
no goals
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_left : Holds D I V E H a1_right : βˆ€ a ∈ Ξ”', Holds D I V E a a2 : H' ∈ Ξ”' ⊒ Holds D I V E H'
no goals
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) (V : VarAssignment D) (E : Env), (βˆ€ H ∈ Ξ”_1 ++ [H_2] ++ [H_1] ++ Ξ”_2, Holds D I V E H) β†’ Holds D I V E phi✝
Ξ” : 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 : VarAssignment D E : Env a1 : βˆ€ H ∈ Ξ”_1 ++ [H_2] ++ [H_1] ++ Ξ”_2, 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 Ξ”_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 : VarAssignment D E : Env a1 : βˆ€ H ∈ Ξ”_1 ++ [H_2] ++ [H_1] ++ Ξ”_2, Holds D I V E H ⊒ Holds D I V E phi✝
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 : VarAssignment D E : Env a1 : βˆ€ H ∈ Ξ”_1 ++ [H_2] ++ [H_1] ++ Ξ”_2, Holds D I V E H ⊒ βˆ€ H ∈ Ξ”_1 ++ [H_1] ++ [H_2] ++ Ξ”_2, Holds D I V E H