Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
N
Numerical Analysis in Coq
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
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
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Micaela Mayero
Numerical Analysis in Coq
Commits
466ef8fa
Commit
466ef8fa
authored
2 years ago
by
François Clément
Browse files
Options
Downloads
Patches
Plain Diff
Add Lift_Trace (+ proof).
WIP: Lift_Trace_equiv.
parent
210f3f84
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
Lebesgue/Set_theory/Set_system/Set_system_base_base.v
+22
-4
22 additions, 4 deletions
Lebesgue/Set_theory/Set_system/Set_system_base_base.v
with
22 additions
and
4 deletions
Lebesgue/Set_theory/Set_system/Set_system_base_base.v
+
22
−
4
View file @
466ef8fa
...
...
@@ -341,20 +341,38 @@ Section Subset_Lift_Trace_Facts.
Context
{
U
:
Type
}
.
Variable
A
:
set
U
.
Lemma
Lift_Lift_full
:
forall
(
PA
:
subset_system
A
),
Incl
(
Lift
A
PA
)
(
Lift_full
A
PA
).
Lemma
Lift_Lift_full
:
forall
(
PA
:
subset_system
A
),
Incl
(
Lift
A
PA
)
(
Lift_full
A
PA
).
Proof
.
intros
PA
B
[
BA
HBA
];
unfold
Lift_full
;
rewrite
<-
(
compose_eq
(
trace
_
)),
trace_lift
;
easy
.
Qed
.
Lemma
Lift_Trace
:
compose
(
Lift
A
)
(
Trace
A
)
=
interp_map_any_r
A
.
Proof
.
unfold
Lift
,
Trace
;
setp_any_unfold
.
rewrite
<-
lift_trace
,
image_compose
;
easy
.
Qed
.
Lemma
Lift_Trace_equiv
:
forall
(
P
:
set_system
U
),
P
A
<->
Lift
A
(
Trace
A
P
)
=
Subset
A
P
.
forall
(
P
:
set_system
U
),
Inter
P
->
P
A
<->
compose
(
Lift
A
)
(
Trace
A
)
P
=
Subset
A
P
.
Proof
.
intros
P
;
split
;
intros
HP
.
intros
P
HP1
;
rewrite
Lift_Trace
;
setp_any_unfold
;
split
;
intros
HP
2
.
(
*
*
)
apply
Ext_equiv
;
split
;
intros
B
HB
.
apply
Sub
.
(
*
.
*
)
induction
HB
as
[
B
HB
];
apply
Sub
.
apply
HP1
;
easy
.
apply
inter_lb_l
.
(
*
.
*
)
induction
HB
as
[
P
B
HB1
HB2
].
apply
inter_right
in
HB2
;
rewrite
<-
HB2
;
easy
.
(
*
*
)
apply
Ext_equiv
in
HP2
.
Search
inter
incl
.
Admitted
.
...
...
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