Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
iris-coq
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
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
Amin Timany
iris-coq
Commits
72bfb1ea
Commit
72bfb1ea
authored
8 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
More coPset deciders.
parent
6dbe0c27
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
prelude/coPset.v
+16
-1
16 additions, 1 deletion
prelude/coPset.v
with
16 additions
and
1 deletion
prelude/coPset.v
+
16
−
1
View file @
72bfb1ea
...
...
@@ -159,7 +159,6 @@ Instance coPset_difference : Difference coPset := λ X Y,
let
(
t1
,
Ht1
)
:=
X
in
let
(
t2
,
Ht2
)
:=
Y
in
(
t1
∩
coPset_opp_raw
t2
)
↾
coPset_intersection_wf
_
_
Ht1
(
coPset_opp_wf
_)
.
Instance
coPset_elem_of_dec
(
p
:
positive
)
(
X
:
coPset
)
:
Decision
(
p
∈
X
)
:=
_
.
Instance
coPset_collection
:
Collection
positive
coPset
.
Proof
.
split
;
[
split
|
|]
.
...
...
@@ -173,12 +172,28 @@ Proof.
by
rewrite
elem_to_Pset_intersection
,
elem_to_Pset_opp
,
andb_True
,
negb_True
.
Qed
.
Instance
coPset_leibniz
:
LeibnizEquiv
coPset
.
Proof
.
intros
X
Y
;
rewrite
elem_of_equiv
;
intros
HXY
.
apply
(
sig_eq_pi
_),
coPset_eq
;
try
apply
proj2_sig
.
intros
p
;
apply
eq_bool_prop_intro
,
(
HXY
p
)
.
Qed
.
Instance
coPset_elem_of_dec
(
p
:
positive
)
(
X
:
coPset
)
:
Decision
(
p
∈
X
)
:=
_
.
Instance
coPset_equiv_dec
(
X
Y
:
coPset
)
:
Decision
(
X
≡
Y
)
.
Proof
.
refine
(
cast_if
(
decide
(
X
=
Y
)));
abstract
(
by
fold_leibniz
)
.
Defined
.
Instance
mapset_disjoint_dec
(
X
Y
:
coPset
)
:
Decision
(
X
⊥
Y
)
.
Proof
.
refine
(
cast_if
(
decide
(
X
∩
Y
=
∅
)));
abstract
(
by
rewrite
disjoint_intersection_L
)
.
Defined
.
Instance
mapset_subseteq_dec
(
X
Y
:
coPset
)
:
Decision
(
X
⊆
Y
)
.
Proof
.
refine
(
cast_if
(
decide
(
X
∪
Y
=
Y
)));
abstract
(
by
rewrite
subseteq_union_L
)
.
Defined
.
(** * Top *)
Lemma
coPset_top_subseteq
(
X
:
coPset
)
:
X
⊆
⊤
.
Proof
.
done
.
Qed
.
Hint
Resolve
coPset_top_subseteq
.
...
...
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