diff --git a/README.org b/README.org
new file mode 100644
index 0000000..69c5993
--- /dev/null
+++ b/README.org
@@ -0,0 +1,42 @@
+* Church Rosser, surjective pairing, and strong normalization
+This repository contains a mechanized proof that the lambda calculus
+with beta and eta rules for functions and pairs is in fact confluent
+for the subset of terms that are "strongly $\beta$-normalizing".
+
+Our notion of $\beta$-strong normalization, based on Abel's POPLMark
+Reloaded survey, is inductively defined
+and captures a strict subset of the usual notion of strong
+normalization in the sense that ill-formed terms such as $\pi_1
+\lambda x . x$ are rejected.
+
+* Joinability: A transitive equational relation
+The joinability relation $a \Leftrightarrow b$, which is true exactly
+when $\exists c, a \leadsto_{\beta\eta} c \wedge b
+\leadsto_{\beta\eta} c$, is transitive on the set of strongly
+normalizing terms thanks to the Church-Rosser theorem proven in this
+repository.
+
+** Joinability and logical predicates
+
+When building a logical predicate where adequacy ensures beta strong
+normalization, we can then show that two types $A \Leftrightarrow B$
+share the same meaning if both are semantically well-formed. The
+strong normalization constraint can be extracted from adequacy so we
+have transitivity of $A \Leftrightarrow B$ available in the proof that
+the logical predicate is functional over joinable terms.
+
+** Joinability and typed equality
+
+For systems with a type-directed equality, the same joinability
+relation can be used to model the equality. The fundamental theorem
+for the judgmental equality would take the following form: $\vdash a
+\equiv b \in A$ implies $\vDash a, b \in A$ and $a \Leftrightarrow b$.
+
+Note that such a result does not immediately give us the decidability
+of type conversion because the algorithm of beta-eta normalization
+may identify more terms when eta is not type-preserving. However, I
+believe Coquand's algorithm can be proven correct using the method
+described in [[https://www.researchgate.net/publication/226663076_Justifying_Algorithms_for_be-Conversion][Goguen 2005]]. We have all the ingredients needed:
+- Strong normalization of beta (needed for the termination metric)
+- Church-Rosser for $\beta$-SN terms (the disciplined expansion of
+  Coquand's algorithm preserves both SN and typing)
diff --git a/theories/fp_red.v b/theories/fp_red.v
index 670ce12..062f9a6 100644
--- a/theories/fp_red.v
+++ b/theories/fp_red.v
@@ -1434,6 +1434,7 @@ Module EReds.
       apply PairCong; eauto using ProjCong.
       apply ERed.PairEta.
   Qed.
+
 End EReds.
 
 #[export]Hint Constructors ERed.R RRed.R EPar.R : red.
@@ -1519,6 +1520,35 @@ Module REReds.
     rtc RERed.R a b.
   Proof. induction 1; hauto lq:on ctrs:rtc use:RERed.FromEta. Qed.
 
+  #[local]Ltac solve_s_rec :=
+  move => *; eapply rtc_l; eauto;
+         hauto lq:on ctrs:RERed.R.
+
+  #[local]Ltac solve_s :=
+    repeat (induction 1; last by solve_s_rec); apply rtc_refl.
+
+  Lemma AbsCong n (a b : PTm (S n)) :
+    rtc RERed.R a b ->
+    rtc RERed.R (PAbs a) (PAbs b).
+  Proof. solve_s. Qed.
+
+  Lemma AppCong n (a0 a1 b0 b1 : PTm n) :
+    rtc RERed.R a0 a1 ->
+    rtc RERed.R b0 b1 ->
+    rtc RERed.R (PApp a0 b0) (PApp a1 b1).
+  Proof. solve_s. Qed.
+
+  Lemma PairCong n (a0 a1 b0 b1 : PTm n) :
+    rtc RERed.R a0 a1 ->
+    rtc RERed.R b0 b1 ->
+    rtc RERed.R (PPair a0 b0) (PPair a1 b1).
+  Proof. solve_s. Qed.
+
+  Lemma ProjCong n p (a0 a1  : PTm n) :
+    rtc RERed.R a0 a1 ->
+    rtc RERed.R (PProj p a0) (PProj p a1).
+  Proof. solve_s. Qed.
+
 End REReds.
 
 Module LoRed.
@@ -1861,4 +1891,27 @@ Module DJoin.
     move => [v [h0 h1]].
     exists v. sfirstorder use:@relations.rtc_transitive.
   Qed.
+
+  Lemma AbsCong n (a b : PTm (S n)) :
+    R a b ->
+    R (PAbs a) (PAbs b).
+  Proof. hauto lq:on use:REReds.AbsCong unfold:R. Qed.
+
+  Lemma AppCong n (a0 a1 b0 b1 : PTm n) :
+    R a0 a1 ->
+    R b0 b1 ->
+    R (PApp a0 b0) (PApp a1 b1).
+  Proof. hauto lq:on use:REReds.AppCong unfold:R. Qed.
+
+  Lemma PairCong n (a0 a1 b0 b1 : PTm n) :
+    R a0 a1 ->
+    R b0 b1 ->
+    R (PPair a0 b0) (PPair a1 b1).
+  Proof. hauto q:on use:REReds.PairCong. Qed.
+
+  Lemma ProjCong n p (a0 a1  : PTm n) :
+    R a0 a1 ->
+    R (PProj p a0) (PProj p a1).
+  Proof. hauto q:on use:REReds.ProjCong. Qed.
+
 End DJoin.