Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Joshua Yanovski
iris-coq
Commits
e5bb24e7
Commit
e5bb24e7
authored
Apr 05, 2017
by
Jacques-Henri Jourdan
Browse files
Typos.
parent
0495154c
Changes
1
Hide whitespace changes
Inline
Side-by-side
theories/base_logic/upred.v
View file @
e5bb24e7
...
...
@@ -18,16 +18,17 @@ Record uPred (M : ucmraT) : Type := IProp {
otherwise
this
condition
is
no
longer
limit
preserving
,
and
uPred
does
no
longer
form
a
COFE
(
i
.
e
.,
[
uPred_compl
]
breaks
).
This
is
because
the
distance
and
equivalence
on
this
cofe
ignores
the
truth
val
id
on
invalid
elements
.
This
,
in
turn
s
,
is
required
by
truth
val
ue
on
invalid
elements
.
This
,
in
turn
,
is
required
by
the
fact
that
entailment
has
to
ignore
invalid
elements
,
which
is
itself
essential
for
proving
[
ownM_valid
].
We
could
,
actually
,
make
the
following
condition
true
even
for
invalid
elements
:
we
have
proved
that
uPred
is
isomorphic
to
a
sub
-
COFE
of
the
COFE
of
predicates
that
are
monotonous
both
with
respect
to
the
step
index
and
with
respect
to
x
.
However
,
that
would
essentially
require
changing
(
by
making
more
complicated
)
the
model
of
many
connectives
of
the
logic
,
which
we
don
'
t
want
.
*
)
We
could
,
actually
,
remove
this
restriction
and
make
this
condition
apply
even
to
invalid
elements
:
we
have
proved
that
uPred
is
isomorphic
to
a
sub
-
COFE
of
the
COFE
of
predicates
that
are
monotonous
both
with
respect
to
the
step
index
and
with
respect
to
x
.
However
,
that
would
essentially
require
changing
(
by
making
it
more
complicated
)
the
model
of
many
connectives
of
the
logic
,
which
we
don
'
t
want
.
*
)
uPred_closed
n1
n2
x
:
uPred_holds
n1
x
→
n2
≤
n1
→
✓
{
n2
}
x
→
uPred_holds
n2
x
}
.
Arguments
uPred_holds
{
_
}
_
_
_
:
simpl
never
.
...
...
Write
Preview
Supports
Markdown
0%
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!
Cancel
Please
register
or
sign in
to comment