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
340afa32
Commit
340afa32
authored
1 year ago
by
François Clément
Browse files
Options
Downloads
Patches
Plain Diff
Move stuff around.
Shorten some proofs. Add and prove f_inv_id_{l,r}.
parent
31df78ac
No related branches found
No related tags found
No related merge requests found
Pipeline
#7173
waiting for manual action
Stage: test
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
FEM/Compl/Function_compl.v
+13
-14
13 additions, 14 deletions
FEM/Compl/Function_compl.v
with
13 additions
and
14 deletions
FEM/Compl/Function_compl.v
+
13
−
14
View file @
340afa32
...
...
@@ -530,9 +530,15 @@ Definition f_inv : T2 -> T1 := proj1_sig f_inv_EX.
Lemma
f_inv_correct_l
:
cancel
f
f_inv
.
Proof
.
apply
(
proj2_sig
f_inv_EX
).
Qed
.
Lemma
f_inv_id_l
:
f_inv
\
o
f
=
id
.
Proof
.
apply
can_equiv
,
f_inv_correct_l
.
Qed
.
Lemma
f_inv_correct_r
:
cancel
f_inv
f
.
Proof
.
apply
(
proj2_sig
f_inv_EX
).
Qed
.
Lemma
f_inv_id_r
:
f
\
o
f_inv
=
id
.
Proof
.
apply
can_equiv
,
f_inv_correct_r
.
Qed
.
End
Inverse_Def
.
...
...
@@ -543,15 +549,10 @@ Context {f : T1 -> T2}.
Hypothesis
Hf
:
bijective
f
.
Lemma
f_inv_uniq_l
:
forall
(
g
:
T2
->
T1
),
cancel
f
g
->
g
=
f_inv
Hf
.
Proof
.
intros
;
apply
fun_ext
,
(
bij_can_eq
Hf
);
[
easy
|
apply
f_inv_correct_l
].
Qed
.
Proof
.
move
=>>
H
;
apply
(
bij_can_uniq_r
Hf
H
),
f_inv_correct_l
.
Qed
.
Lemma
f_inv_uniq_r
:
forall
(
g
:
T2
->
T1
),
cancel
g
f
->
g
=
f_inv
Hf
.
Proof
.
move
=>>
Hg
;
apply
:
(
inj_can_uniq_l
_
Hg
);
[
apply
bij_inj
;
easy
|
apply
f_inv_correct_r
].
Qed
.
Proof
.
move
=>>
H
;
apply
(
bij_can_uniq_l
Hf
H
),
f_inv_correct_r
.
Qed
.
Lemma
f_inv_bij
:
bijective
(
f_inv
Hf
).
Proof
.
apply
(
bij_can_bij
Hf
),
f_inv_correct_l
.
Qed
.
...
...
@@ -578,8 +579,12 @@ End Inverse_Facts1.
Section
Inverse_Facts2
.
Context
{
T1
T2
:
Type
}
.
Context
{
f
:
T1
->
T2
}
.
Context
{
f
g
:
T1
->
T2
}
.
Hypothesis
Hf
:
bijective
f
.
Hypothesis
Hg
:
bijective
g
.
Lemma
f_inv_ext
:
same_fun
f
g
->
f_inv
Hf
=
f_inv
Hg
.
Proof
.
move
=>
/
fun_ext_equiv
H
;
subst
;
f_equal
;
apply
proof_irrel
.
Qed
.
Lemma
f_inv_invol
:
forall
(
Hf1
:
bijective
(
f_inv
Hf
)),
f_inv
Hf1
=
f
.
Proof
.
intros
;
apply
eq_sym
,
f_inv_uniq_l
,
f_inv_correct_r
.
Qed
.
...
...
@@ -587,12 +592,6 @@ Proof. intros; apply eq_sym, f_inv_uniq_l, f_inv_correct_r. Qed.
Lemma
f_inv_invol_alt
:
f_inv
(
f_inv_bij
Hf
)
=
f
.
Proof
.
apply
f_inv_invol
.
Qed
.
Context
{
g
:
T1
->
T2
}
.
Hypothesis
Hg
:
bijective
g
.
Lemma
f_inv_ext
:
same_fun
f
g
->
f_inv
Hf
=
f_inv
Hg
.
Proof
.
move
=>
/
fun_ext_equiv
H
;
subst
;
f_equal
;
apply
proof_irrel
.
Qed
.
End
Inverse_Facts2
.
...
...
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