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
e9ff46e2
Commit
e9ff46e2
authored
2 years ago
by
François Clément
Browse files
Options
Downloads
Patches
Plain Diff
Simplify proof of is_Basisp_is_Basisf_equiv.
WIP: is_Basisp_equiv.
parent
0479369d
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_any.v
+34
-17
34 additions, 17 deletions
Lebesgue/Set_theory/Set_system/Set_system_any.v
with
34 additions
and
17 deletions
Lebesgue/Set_theory/Set_system/Set_system_any.v
+
34
−
17
View file @
e9ff46e2
...
...
@@ -389,16 +389,17 @@ End Trace_Facts.
Section
Basis_Facts1
.
Context
{
U
Idx
:
Type
}
.
Context
{
U
:
Type
}
.
(
**
Correctness
results
.
*
)
Variable
T
:
set_system
U
.
Lemma
is_Basisf_is_Basisp_equiv
:
forall
(
fB
:
Idx
->
set
U
),
is_Basisf
T
fB
<->
is_Basisp
T
(
unskolem
fB
).
forall
{
Idx
:
Type
}
(
fB
:
Idx
->
set
U
),
is_Basisf
T
fB
<->
is_Basisp
T
(
unskolem
fB
).
Proof
.
intros
fB
;
split
;
intros
[
HfB1
HfB2
];
split
.
intros
Idx
fB
;
split
;
intros
[
HfB1
HfB2
];
split
.
(
*
*
)
intros
B
[
i
];
easy
.
intros
A
HA
;
rewrite
(
HfB2
A
HA
)
at
1
;
apply
set_ext_equiv
;
split
;
intros
x
.
...
...
@@ -414,19 +415,32 @@ Qed.
Lemma
is_Basisp_is_Basisf_equiv
:
forall
(
PB
:
set_system
U
),
is_Basisp
T
PB
<->
is_Basisf
T
(
skolem
PB
).
Proof
.
intros
PB
;
split
;
intros
[
HPB1
HPB2
];
split
.
(
*
*
)
intros
[
B
HB
];
auto
.
intros
A
HA
;
rewrite
(
HPB2
A
HA
)
at
1
;
apply
set_ext_equiv
;
split
;
intros
x
.
intros
[
B
[[
HB1
HB2
]
Hx
]];
exists
(
exist
_
_
HB2
);
easy
.
intros
[[
B
HB
]
[
Hx1
Hx2
]];
exists
B
;
easy
.
(
*
*
)
intros
B
HB
;
apply
(
HPB1
(
exist
_
_
HB
)).
intros
A
HA
;
rewrite
(
HPB2
A
HA
)
at
1
;
apply
set_ext_equiv
;
split
;
intros
x
.
intros
[[
B
HB
]
[
Hx1
Hx2
]];
exists
B
;
easy
.
intros
[
B
[[
HB1
HB2
]
Hx
]];
exists
(
exist
_
_
HB2
);
easy
.
intros
PB
;
rewrite
<-
(
unskolem_skolem
PB
)
at
1.
apply
iff_sym
,
is_Basisf_is_Basisp_equiv
.
Qed
.
End
Basis_Facts1
.
Section
Basis_Facts2
.
Context
{
U
:
Type
}
.
Variable
T
:
set_system
U
.
Lemma
is_Basisp_equiv
:
forall
(
PB
:
set_system
U
),
is_Basisp
T
PB
<->
(
forall
A
x
,
T
A
->
A
x
->
exists
B
,
PB
B
/
\
incl
B
A
/
\
B
x
).
Proof
.
intros
PB
;
split
.
(
*
*
)
intros
[
HPB1
HPB2
]
A
x
HA
Hx
.
Admitted
.
Variable
P
:
set_system
U
.
Lemma
is_Basisp_Union_any_closure
:
is_Basisp
(
Union_any_closure
P
)
P
.
...
...
@@ -442,10 +456,10 @@ intros y Hy; exists B; easy.
destruct
HB
as
[
HB1
HB2
];
auto
.
Qed
.
End
Basis_Facts
1
.
End
Basis_Facts
2
.
Section
Basis_Facts
2
.
Section
Basis_Facts
3
.
Context
{
U
:
Type
}
.
Variable
genU
:
set_system
U
.
...
...
@@ -475,13 +489,16 @@ admit.
(
*
.
*
)
intros
x
[
i
Hx
].
eexists
;
repeat
split
.
admit
.
admit
.
admit
.
(
*
*
)
intros
x
[
B
[[
HB1
HB2
]
HB3
]];
auto
.
Admitted
.
End
Basis_Facts
2
.
End
Basis_Facts
3
.
Section
Open_Prod_Facts1
.
...
...
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