+(* relations *)
+
+definition confluent1: ∀A. relation A → predicate A ≝ λA,R,a0.
+ ∀a1. R a0 a1 → ∀a2. R a0 a2 →
+ ∃∃a. R a1 a & R a2 a.
+
+(* Note: confluent1 would be redundant if \Pi-reduction where enabled *)
+definition confluent: ∀A. predicate (relation A) ≝ λA,R.
+ ∀a0. confluent1 … R a0.
+
+(* booleans *)
+
+definition is_false: predicate bool ≝ λb.
+ false = b.
+
+(* arithmetics *)
+