Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
S
stdpp
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
37
Issues
37
List
Boards
Labels
Milestones
Merge Requests
2
Merge Requests
2
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Iris
stdpp
Commits
f6e466d1
Commit
f6e466d1
authored
Jul 21, 2020
by
Robbert Krebbers
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add lemma `tc_finite_sn`.
parent
ee76981d
Pipeline
#31760
passed with stage
in 12 minutes and 1 second
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
17 additions
and
1 deletion
+17
-1
theories/relations.v
theories/relations.v
+17
-1
No files found.
theories/relations.v
View file @
f6e466d1
...
...
@@ -2,7 +2,7 @@
These are particularly useful as we define the operational semantics as a
small step semantics. *)
From
Coq
Require
Import
Wf_nat
.
From
stdpp
Require
Export
tactics
base
.
From
stdpp
Require
Export
sets
.
Set
Default
Proof
Using
"Type"
.
(** * Definitions *)
...
...
@@ -280,6 +280,22 @@ Section properties.
Lemma
wn_step_rtc
x
y
:
wn
R
y
→
rtc
R
x
y
→
wn
R
x
.
Proof
.
induction
2
;
eauto
using
wn_step
.
Qed
.
(** An acyclic relation that can only take finitely many steps is strongly
normalizing *)
Lemma
tc_finite_sn
x
:
Irreflexive
(
tc
R
)
→
pred_finite
(
tc
R
x
)
→
sn
R
x
.
Proof
.
intros
Hirr
[
xs
Hfin
].
remember
(
length
xs
)
as
n
eqn
:
Hn
.
revert
x
xs
Hn
Hfin
.
induction
(
lt_wf
n
)
as
[
n
_
IH
]
;
intros
x
xs
->
Hfin
.
constructor
;
simpl
;
intros
x'
Hxx'
.
assert
(
x'
∈
xs
)
as
(
xs1
&
xs2
&->)%
elem_of_list_split
by
eauto
using
tc_once
.
refine
(
IH
(
length
xs1
+
length
xs2
)
_
_
(
xs1
++
xs2
)
_
_
)
;
[
rewrite
app_length
;
simpl
;
lia
..|].
intros
x''
Hx'x''
.
feed
pose
proof
(
Hfin
x''
)
as
Hx''
;
[
by
econstructor
|].
cut
(
x'
≠
x''
)
;
[
set_solver
|].
intros
->.
by
apply
(
Hirr
x''
).
Qed
.
(** The following theorem requires that [red R] is decidable. The intuition
for this requirement is that [wn R] is a very "positive" statement as it
points out a particular trace. In contrast, [sn R] just says "this also holds
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment