Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
stdpp
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
Adam
stdpp
Commits
370c0cf4
Commit
370c0cf4
authored
4 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Fix compatibility with old Coq versions.
parent
2f5854bd
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theories/finite.v
+2
-2
2 additions, 2 deletions
theories/finite.v
with
2 additions
and
2 deletions
theories/finite.v
+
2
−
2
View file @
370c0cf4
...
@@ -154,7 +154,7 @@ Lemma finite_bijective A `{Finite A} B `{Finite B} :
...
@@ -154,7 +154,7 @@ Lemma finite_bijective A `{Finite A} B `{Finite B} :
Proof
.
Proof
.
split
.
split
.
-
intros
;
destruct
(
proj1
(
finite_inj
A
B
))
as
[
f
?];
auto
with
lia
.
-
intros
;
destruct
(
proj1
(
finite_inj
A
B
))
as
[
f
?];
auto
with
lia
.
exists
f
;
eauto
using
finite_inj_surj
.
exists
f
;
split
;
[
done
|]
.
by
apply
finite_inj_surj
.
-
intros
(
f
&
?
&
?)
.
apply
(
anti_symm
(
≤
));
apply
finite_inj
.
-
intros
(
f
&
?
&
?)
.
apply
(
anti_symm
(
≤
));
apply
finite_inj
.
+
by
exists
f
.
+
by
exists
f
.
+
destruct
(
surj_cancel
f
)
as
(
g
&
?)
.
exists
g
.
apply
cancel_inj
.
+
destruct
(
surj_cancel
f
)
as
(
g
&
?)
.
exists
g
.
apply
cancel_inj
.
...
@@ -274,7 +274,7 @@ Next Obligation.
...
@@ -274,7 +274,7 @@ Next Obligation.
Qed
.
Qed
.
Next
Obligation
.
Next
Obligation
.
intros
??????
[
x
|
y
];
rewrite
elem_of_app
,
!
elem_of_list_fmap
;
intros
??????
[
x
|
y
];
rewrite
elem_of_app
,
!
elem_of_list_fmap
;
eauto
using
elem_of_enum
.
[
left
|
right
];
(
eexists
;
split
;
[
done
|
apply
elem_of_enum
])
.
Qed
.
Qed
.
Lemma
sum_card
`{
Finite
A
,
Finite
B
}
:
card
(
A
+
B
)
=
card
A
+
card
B
.
Lemma
sum_card
`{
Finite
A
,
Finite
B
}
:
card
(
A
+
B
)
=
card
A
+
card
B
.
Proof
.
unfold
card
.
simpl
.
by
rewrite
app_length
,
!
fmap_length
.
Qed
.
Proof
.
unfold
card
.
simpl
.
by
rewrite
app_length
,
!
fmap_length
.
Qed
.
...
...
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