-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcid.v
33 lines (28 loc) · 752 Bytes
/
cid.v
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
Section hilbert_cid.
Definition hilbert := forall X, inhabited X -> X.
Definition cid := forall X (P : X -> Prop), (exists x, P x) -> { x | P x }.
Fact hilbert_cid : hilbert -> cid.
Proof.
intros H X P HP.
apply H.
destruct HP as (x & Hx).
exists.
exists x; auto.
Qed.
Fact cid_hilbert : cid -> hilbert.
Proof.
intros H X HX.
set (P (_ : X) := True).
assert (exists x, P x) as H1.
destruct HX as [ x ].
exists x; red; auto.
apply H in H1.
destruct H1 as (x & _); exact x.
Qed.
Fact hilbert_or_plus : hilbert -> forall A B : Prop, A \/ B -> { A } + { B }.
Proof.
intros H A B H1.
apply H.
destruct H1; exists; [ left | right ]; auto.
Qed.
End hilbert_cid.