Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
Iris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
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
Abel Nieto
Iris
Commits
9e8c1030
Commit
9e8c1030
authored
6 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
New lemma `later_own γ a : ▷ own γ a -∗ ◇ (∃ b, own γ b ∧ ▷ (a ≡ b))`.
This lemma is similar to `later_ownM`.
parent
6010b7c4
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theories/base_logic/lib/own.v
+30
-0
30 additions, 0 deletions
theories/base_logic/lib/own.v
with
30 additions
and
0 deletions
theories/base_logic/lib/own.v
+
30
−
0
View file @
9e8c1030
...
@@ -110,6 +110,36 @@ Proof. rewrite !own_eq /own_def; apply _. Qed.
...
@@ -110,6 +110,36 @@ Proof. rewrite !own_eq /own_def; apply _. Qed.
Global
Instance
own_core_persistent
γ
a
:
CoreId
a
→
Persistent
(
own
γ
a
)
.
Global
Instance
own_core_persistent
γ
a
:
CoreId
a
→
Persistent
(
own
γ
a
)
.
Proof
.
rewrite
!
own_eq
/
own_def
;
apply
_
.
Qed
.
Proof
.
rewrite
!
own_eq
/
own_def
;
apply
_
.
Qed
.
Lemma
later_own
γ
a
:
▷
own
γ
a
-∗
◇
(
∃
b
,
own
γ
b
∧
▷
(
a
≡
b
))
.
Proof
.
rewrite
own_eq
/
own_def
later_ownM
.
apply
exist_elim
=>
r
.
assert
(
NonExpansive
(
λ
r
:
iResUR
Σ
,
r
(
inG_id
H
)
!!
γ
))
.
{
intros
n
r1
r2
Hr
.
f_equiv
.
by
specialize
(
Hr
(
inG_id
_))
.
}
rewrite
(
f_equiv
(
λ
r
:
iResUR
Σ
,
r
(
inG_id
H
)
!!
γ
)
_
r
)
.
rewrite
{
1
}
/
iRes_singleton
ofe_fun_lookup_singleton
lookup_singleton
.
rewrite
option_equivI
.
case
Hb
:
(
r
(
inG_id
_)
!!
γ
)=>
[
b
|];
last
first
.
{
by
rewrite
and_elim_r
/
sbi_except_0
-
or_intro_l
.
}
rewrite
-
except_0_intro
-
(
exist_intro
(
cmra_transport
(
eq_sym
inG_prf
)
b
))
.
apply
and_mono
.
-
rewrite
/
iRes_singleton
.
assert
(
∀
{
A
A'
:
cmraT
}
(
Heq
:
A'
=
A
)
(
a
:
A
),
cmra_transport
Heq
(
cmra_transport
(
eq_sym
Heq
)
a
)
=
a
)
as
->
by
(
by
intros
??
->
)
.
apply
ownM_mono
=>
/=.
exists
(
ofe_fun_insert
(
inG_id
_)
(
delete
γ
(
r
(
inG_id
H
)))
r
)
.
intros
i'
.
rewrite
ofe_fun_lookup_op
.
destruct
(
decide
(
i'
=
inG_id
_))
as
[
->
|?]
.
+
rewrite
ofe_fun_lookup_insert
ofe_fun_lookup_singleton
.
intros
γ'
.
rewrite
lookup_op
.
destruct
(
decide
(
γ'
=
γ
))
as
[
->
|?]
.
*
by
rewrite
lookup_singleton
lookup_delete
Hb
.
*
by
rewrite
lookup_singleton_ne
//
lookup_delete_ne
//
left_id
.
+
rewrite
ofe_fun_lookup_insert_ne
//.
by
rewrite
ofe_fun_lookup_singleton_ne
//
left_id
.
-
apply
later_mono
.
by
assert
(
∀
{
A
A'
:
cmraT
}
(
Heq
:
A'
=
A
)
(
a'
:
A'
)
(
a
:
A
),
cmra_transport
Heq
a'
≡
a
⊢@
{
iPropI
Σ
}
a'
≡
cmra_transport
(
eq_sym
Heq
)
a
)
as
->
by
(
by
intros
??
->
)
.
Qed
.
(** ** Allocation *)
(** ** Allocation *)
(* TODO: This also holds if we just have ✓ a at the current step-idx, as Iris
(* TODO: This also holds if we just have ✓ a at the current step-idx, as Iris
assertion. However, the map_updateP_alloc does not suffice to show this. *)
assertion. However, the map_updateP_alloc does not suffice to show this. *)
...
...
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