From 4bd5dcfeb558f826d90123357a3e5336f96b2213 Mon Sep 17 00:00:00 2001
From: Hugo Herbelin
Date: Tue, 22 Sep 2015 18:45:27 +0200
Subject: Adding an amazing property of Prop.

---
 doc/stdlib/index-list.html.template |  1 +
 theories/Logic/PropFacts.v          | 50 +++++++++++++++++++++++++++++++++++++
 2 files changed, 51 insertions(+)
 create mode 100644 theories/Logic/PropFacts.v

diff --git a/doc/stdlib/index-list.html.template b/doc/stdlib/index-list.html.template
index 866193ffb4..33de399c0d 100644
--- a/doc/stdlib/index-list.html.template
+++ b/doc/stdlib/index-list.html.template
@@ -59,6 +59,7 @@ through the <tt>Require Import</tt> command.</p>
     theories/Logic/WeakFan.v
     theories/Logic/WKL.v
     theories/Logic/FinFun.v
+    theories/Logic/PropFacts.v
   </dd>
 
   <dt> <b>Structures</b>:
diff --git a/theories/Logic/PropFacts.v b/theories/Logic/PropFacts.v
new file mode 100644
index 0000000000..309539e5ca
--- /dev/null
+++ b/theories/Logic/PropFacts.v
@@ -0,0 +1,50 @@
+(************************************************************************)
+(*  v      *   The Coq Proof Assistant  /  The Coq Development Team     *)
+(* <O___,, *   INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2015     *)
+(*   \VV/  **************************************************************)
+(*    //   *      This file is distributed under the terms of the       *)
+(*         *       GNU Lesser General Public License Version 2.1        *)
+(************************************************************************)
+
+(** * Basic facts about Prop as a type *)
+
+(** An intuitionistic theorem from topos theory [[LambekScott]]
+
+References:
+
+[[LambekScott]] Jim Lambek, Phil J. Scott, Introduction to higher
+order categorical logic, Cambridge Studies in Advanced Mathematics
+(Book 7), 1988.
+
+*)
+
+Theorem injection_is_involution_in_Prop
+  (f : Prop -> Prop)
+  (inj : forall A B, (f A <-> f B) -> (A <-> B))
+  (ext : forall A B, A <-> B -> f A <-> f B)
+  : forall A, f (f A) <-> A.
+Proof.
+intros.
+enough (f (f (f A)) <-> f A) by (apply inj; assumption).
+split; intro H.
+- now_show (f A).
+  enough (f A <-> True) by firstorder.
+  enough (f (f A) <-> f True) by (apply inj; assumption).
+  split; intro H'.
+  + now_show (f True).
+    enough (f (f (f A)) <-> f True) by firstorder.
+    apply ext; firstorder.
+  + now_show (f (f A)).
+    enough (f (f A) <-> True) by firstorder.
+    apply inj; firstorder.
+- now_show (f (f (f A))).
+  enough (f A <-> f (f (f A))) by firstorder.
+  apply ext.
+  split; intro H'.
+  + now_show (f (f A)).
+    enough (f A <-> f (f A)) by firstorder.
+    apply ext; firstorder.
+  + now_show A.
+    enough (f A <-> A) by firstorder.
+    apply inj; firstorder.
+Defined.
-- 
cgit v1.2.3