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
Model registry
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
Iris
stdpp
Commits
bcebd707
Commit
bcebd707
authored
4 years ago
by
Ralf Jung
Browse files
Options
Downloads
Plain Diff
Merge branch 'ralf/pred_infinite_surj' into 'master'
add pred_infinite_surj See merge request
!225
parents
58c0e8cb
5728445c
No related branches found
Branches containing commit
No related tags found
Tags containing commit
1 merge request
!225
add pred_infinite_surj
Pipeline
#41245
passed
4 years ago
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theories/sets.v
+12
-0
12 additions, 0 deletions
theories/sets.v
with
12 additions
and
0 deletions
theories/sets.v
+
12
−
0
View file @
bcebd707
...
@@ -1044,6 +1044,18 @@ Section pred_finite_infinite.
...
@@ -1044,6 +1044,18 @@ Section pred_finite_infinite.
pred_infinite
P
→
(
∀
x
,
P
x
→
Q
x
)
→
pred_infinite
Q
.
pred_infinite
P
→
(
∀
x
,
P
x
→
Q
x
)
→
pred_infinite
Q
.
Proof
.
unfold
pred_infinite
.
set_solver
.
Qed
.
Proof
.
unfold
pred_infinite
.
set_solver
.
Qed
.
(** If [f] is surjective onto [P], then pre-composing with [f] preserves
infinity. *)
Lemma
pred_infinite_surj
{
A
B
}
(
P
:
B
→
Prop
)
(
f
:
A
→
B
)
:
(
∀
x
,
P
x
→
∃
y
,
f
y
=
x
)
→
pred_infinite
P
→
pred_infinite
(
P
∘
f
)
.
Proof
.
intros
Hf
HP
xs
.
destruct
(
HP
(
f
<$>
xs
))
as
[
x
[
HPx
Hx
]]
.
destruct
(
Hf
_
HPx
)
as
[
y
Hf'
]
.
exists
y
.
split
.
-
simpl
.
rewrite
Hf'
.
done
.
-
intros
Hy
.
apply
Hx
.
apply
elem_of_list_fmap
.
eauto
.
Qed
.
Lemma
pred_not_infinite_finite
{
A
}
(
P
:
A
→
Prop
)
:
Lemma
pred_not_infinite_finite
{
A
}
(
P
:
A
→
Prop
)
:
pred_infinite
P
→
pred_finite
P
→
False
.
pred_infinite
P
→
pred_finite
P
→
False
.
Proof
.
intros
Hinf
[
xs
?]
.
destruct
(
Hinf
xs
)
.
set_solver
.
Qed
.
Proof
.
intros
Hinf
[
xs
?]
.
destruct
(
Hinf
xs
)
.
set_solver
.
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