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
6b6381fe
Commit
6b6381fe
authored
8 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Use rvs in counter_example and integrate with adequacy to obtain False.
parent
bd660383
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
program_logic/counter_examples.v
+12
-9
12 additions, 9 deletions
program_logic/counter_examples.v
with
12 additions
and
9 deletions
program_logic/counter_examples.v
+
12
−
9
View file @
6b6381fe
...
...
@@ -2,8 +2,7 @@ From iris.algebra Require Import upred.
From
iris
.
proofmode
Require
Import
tactics
.
(** This proves that we need the ▷ in a "Saved Proposition" construction with
name-dependend allocation. *)
(** We fork in [uPred M] for any M, but the proof would work in any BI. *)
name-dependend allocation. *)
Section
savedprop
.
Context
(
M
:
ucmraT
)
.
Notation
iProp
:=
(
uPred
M
)
.
...
...
@@ -11,11 +10,10 @@ Section savedprop.
Implicit
Types
P
:
iProp
.
(* Saved Propositions and view shifts. *)
Context
(
sprop
:
Type
)
(
saved
:
sprop
→
iProp
→
iProp
)
(
pvs
:
iProp
→
iProp
)
.
Hypothesis
pvs_mono
:
∀
P
Q
,
(
P
⊢
Q
)
→
pvs
P
⊢
pvs
Q
.
Context
(
sprop
:
Type
)
(
saved
:
sprop
→
iProp
→
iProp
)
.
Hypothesis
sprop_persistent
:
∀
i
P
,
PersistentP
(
saved
i
P
)
.
Hypothesis
sprop_alloc_dep
:
∀
(
P
:
sprop
→
iProp
),
True
⊢
pvs
(
∃
i
,
saved
i
(
P
i
))
.
∀
(
P
:
sprop
→
iProp
),
True
=
r
=>
(
∃
i
,
saved
i
(
P
i
))
.
Hypothesis
sprop_agree
:
∀
i
P
Q
,
saved
i
P
∧
saved
i
Q
⊢
P
↔
Q
.
(* Self-contradicting assertions are inconsistent *)
...
...
@@ -44,14 +42,19 @@ Section savedprop.
Proof
.
iIntros
"#HQ !"
.
by
iApply
(
saved_is_A
i
(
¬
A
i
))
.
Qed
.
(* We can obtain such a [Q i]. *)
Lemma
make_Q
:
True
⊢
pvs
(
∃
i
,
Q
i
)
.
Lemma
make_Q
:
True
=
r
=>
∃
i
,
Q
i
.
Proof
.
apply
sprop_alloc_dep
.
Qed
.
(* Put together all the pieces to derive a contradiction. *)
(* TODO: Have a lemma in upred.v that says that we cannot view shift to False. *)
Lemma
contradiction
:
True
⊢
pvs
False
.
Lemma
rvs_false
:
(
True
:
uPred
M
)
=
r
=>
False
.
Proof
.
rewrite
make_Q
.
apply
p
vs_mono
.
iDestruct
1
as
(
i
)
"HQ"
.
rewrite
make_Q
.
apply
uPred
.
r
vs_mono
.
iDestruct
1
as
(
i
)
"HQ"
.
iApply
(
no_self_contradiction
(
A
i
))
.
by
iApply
Q_self_contradiction
.
Qed
.
Lemma
contradiction
:
False
.
Proof
.
apply
(
@
uPred
.
adequacy
M
False
1
);
simpl
.
rewrite
-
uPred
.
later_intro
.
apply
rvs_false
.
Qed
.
End
savedprop
.
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