Kindelia/Kind2
1
1
Fork 0
mirror of https://github.com/Kindelia/Kind2.git synced 2024-09-11 07:15:45 +03:00
Code Issues Projects Releases Wiki Activity

fix some missing lets

Browse Source
This commit is contained in:
rheidner 2021-10-22 11:07:15 -03:00
parent f1c4446bcb
commit cd2dce428e
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
base/User/rigille/List/Monotone/exists.kind
View File

@ -29,7 +29,7 @@ User.rigille.List.Monotone.exists<A: Type>(after: A -> A -> Type, O: User.rigill
def ret = ext.fst & tail_call.fst
// prove return value is a permutation
let ret_perm = (lem_left = User.rigille.List.Perm.refl<A>(xs.head & xs.tail)
let ret_perm = (let lem_left = User.rigille.List.Perm.refl<A>(xs.head & xs.tail)
// Perm(min_split.fst ++ [ext.fst] ++ min_split.snd.fst, xs.head & xs.tail)
let lem_right = lem_left :: rewrite X in Perm(X, _) with min_split.snd.snd
// Perm([ext.fst] ++ min_split.fst, min_split.fst ++ [ext.fst])
@ -54,10 +54,10 @@ User.rigille.List.Monotone.exists<A: Type>(after: A -> A -> Type, O: User.rigill
let ret_monotone = case tail_call.fst
with tail_call.snd.snd
ret_perm {
nil: qed = unit :: User.rigille.List.Monotone<A, after, O>(ext.fst & [])
nil: let qed = unit :: User.rigille.List.Monotone<A, after, O>(ext.fst & [])
qed
cons: in_tail_call = right(left(refl)) :: User.rigille.List.In<A>(ext.fst & tail_call.fst.head & tail_call.fst.tail, tail_call.fst.head)
cons: let in_tail_call = right(left(refl)) :: User.rigille.List.In<A>(ext.fst & tail_call.fst.head & tail_call.fst.tail, tail_call.fst.head)
let in_param = User.rigille.List.Perm.In<A>(_, _, _,
in_tail_call, User.rigille.List.Perm.symm<A>(_, _, ret_perm))
let qed = ext.snd.snd(_, in_param)

4
base/User/rigille/List/Perm/cat_comm.kind
View File

@ -4,11 +4,11 @@ User.rigille.List.Perm.cat_comm<A: Type>(
): User.rigille.List.Perm<A>(ys ++ xs, xs ++ ys)
def Perm = User.rigille.List.Perm<A>
case xs {
nil: lem = User.rigille.List.Perm.refl<A>(ys)
nil: let lem = User.rigille.List.Perm.refl<A>(ys)
let calc = User.rigille.List.cat_l_nil!(ys)
let qed = lem :: rewrite X in (Perm(X, ys)) with calc
qed
cons: ind = User.rigille.List.Perm.cat_comm<A>(xs.tail, ys)
cons: let ind = User.rigille.List.Perm.cat_comm<A>(xs.tail, ys)
let lem_right = User.rigille.List.Perm.skip<A>(xs.head, _, _, ind)
let lem_left = User.rigille.List.Perm.front_to_back<A>(xs.head, ys)
let lem_left = User.rigille.List.Perm.push_tail<A>(_, _, xs.tail, lem_left)