proposition: Lemma below_t : forall t, Below_T t with below_r : forall r, Below_R r.
proof: Proof. intros [|x]. exact I. exact (Hr x (below_r x), below_r x). intros [|t rs]. exact I. exact ((Ht t (below_t t), below_t t), (Hr rs (below_r rs), below_r rs)). Defined.
imports: Equations(Equations) Below