Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Iris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Terraform modules
Monitor
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Simcha van Collem
Iris
Commits
20de7e7c
Commit
20de7e7c
authored
8 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Strengthen some gmap lemmas by using Leibniz equality.
parent
72a05023
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
algebra/gmap.v
+8
-11
8 additions, 11 deletions
algebra/gmap.v
with
8 additions
and
11 deletions
algebra/gmap.v
+
8
−
11
View file @
20de7e7c
...
@@ -205,15 +205,12 @@ Qed.
...
@@ -205,15 +205,12 @@ Qed.
Lemma
singleton_valid
i
x
:
✓
({[
i
:=
x
]}
:
gmap
K
A
)
↔
✓
x
.
Lemma
singleton_valid
i
x
:
✓
({[
i
:=
x
]}
:
gmap
K
A
)
↔
✓
x
.
Proof
.
rewrite
!
cmra_valid_validN
.
by
setoid_rewrite
singleton_validN
.
Qed
.
Proof
.
rewrite
!
cmra_valid_validN
.
by
setoid_rewrite
singleton_validN
.
Qed
.
Lemma
insert_singleton_opN
n
m
i
x
:
Lemma
insert_singleton_op
m
i
x
:
m
!!
i
=
None
→
<
[
i
:=
x
]
>
m
=
{[
i
:=
x
]}
⋅
m
.
m
!!
i
=
None
→
<
[
i
:=
x
]
>
m
≡
{
n
}
≡
{[
i
:=
x
]}
⋅
m
.
Proof
.
Proof
.
intros
Hi
j
;
destruct
(
decide
(
i
=
j
))
as
[
->
|]
.
intros
Hi
;
apply
map_eq
=>
j
;
destruct
(
decide
(
i
=
j
))
as
[
->
|]
.
-
by
rewrite
lookup_op
lookup_insert
lookup_singleton
Hi
right_id
.
-
by
rewrite
lookup_op
lookup_insert
lookup_singleton
Hi
right_id
_L
.
-
by
rewrite
lookup_op
lookup_insert_ne
//
lookup_singleton_ne
//
left_id
.
-
by
rewrite
lookup_op
lookup_insert_ne
//
lookup_singleton_ne
//
left_id
_L
.
Qed
.
Qed
.
Lemma
insert_singleton_op
m
i
x
:
m
!!
i
=
None
→
<
[
i
:=
x
]
>
m
≡
{[
i
:=
x
]}
⋅
m
.
Proof
.
rewrite
!
equiv_dist
;
naive_solver
eauto
using
insert_singleton_opN
.
Qed
.
Lemma
core_singleton
(
i
:
K
)
(
x
:
A
)
cx
:
Lemma
core_singleton
(
i
:
K
)
(
x
:
A
)
cx
:
pcore
x
=
Some
cx
→
core
({[
i
:=
x
]}
:
gmap
K
A
)
=
{[
i
:=
cx
]}
.
pcore
x
=
Some
cx
→
core
({[
i
:=
x
]}
:
gmap
K
A
)
=
{[
i
:=
cx
]}
.
...
@@ -252,9 +249,9 @@ Proof.
...
@@ -252,9 +249,9 @@ Proof.
*
by
rewrite
Hi
lookup_op
lookup_singleton
lookup_delete
.
*
by
rewrite
Hi
lookup_op
lookup_singleton
lookup_delete
.
*
by
rewrite
lookup_op
lookup_singleton_ne
//
lookup_delete_ne
//
left_id
.
*
by
rewrite
lookup_op
lookup_singleton_ne
//
lookup_delete_ne
//
left_id
.
Qed
.
Qed
.
Lemma
dom_op
m1
m2
:
dom
(
gset
K
)
(
m1
⋅
m2
)
≡
dom
_
m1
∪
dom
_
m2
.
Lemma
dom_op
m1
m2
:
dom
(
gset
K
)
(
m1
⋅
m2
)
=
dom
_
m1
∪
dom
_
m2
.
Proof
.
Proof
.
apply
elem_of_equiv
;
intros
i
;
rewrite
elem_of_union
!
elem_of_dom
.
apply
elem_of_equiv
_L
=>
i
;
rewrite
elem_of_union
!
elem_of_dom
.
unfold
is_Some
;
setoid_rewrite
lookup_op
.
unfold
is_Some
;
setoid_rewrite
lookup_op
.
destruct
(
m1
!!
i
),
(
m2
!!
i
);
naive_solver
.
destruct
(
m1
!!
i
),
(
m2
!!
i
);
naive_solver
.
Qed
.
Qed
.
...
@@ -303,8 +300,8 @@ Section freshness.
...
@@ -303,8 +300,8 @@ Section freshness.
{
rewrite
-
not_elem_of_union
-
dom_op
-
not_elem_of_union
;
apply
is_fresh
.
}
{
rewrite
-
not_elem_of_union
-
dom_op
-
not_elem_of_union
;
apply
is_fresh
.
}
exists
(
<
[
i
:=
x
]
>
m
);
split
.
exists
(
<
[
i
:=
x
]
>
m
);
split
.
{
by
apply
HQ
;
last
done
;
apply
not_elem_of_dom
.
}
{
by
apply
HQ
;
last
done
;
apply
not_elem_of_dom
.
}
rewrite
insert_singleton_op
N
;
last
by
apply
not_elem_of_dom
.
rewrite
insert_singleton_op
;
last
by
apply
not_elem_of_dom
.
rewrite
-
assoc
-
insert_singleton_op
N
;
rewrite
-
assoc
-
insert_singleton_op
;
last
by
apply
not_elem_of_dom
;
rewrite
dom_op
not_elem_of_union
.
last
by
apply
not_elem_of_dom
;
rewrite
dom_op
not_elem_of_union
.
by
apply
insert_validN
;
[
apply
cmra_valid_validN
|]
.
by
apply
insert_validN
;
[
apply
cmra_valid_validN
|]
.
Qed
.
Qed
.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment