proposition: Lemma canon_limit_strong lambda : nf lambda -> T1limit lambda -> forall beta, beta t1< lambda -> {i:nat | beta t1< canon lambda i}.
proof: Proof. intros H H0 beta H1; destruct (canonS_limit_strong H H0 H1) as [x Hx]; exists (S x);auto. Defined.
imports: hydras.Prelude(DecPreOrder)