proposition: Lemma is_finite_finite : forall alpha, is_finite alpha -> {n : nat | alpha = F n}.
proof: Proof. destruct 1. exists 0;simpl;auto with T2. exists (S n);simpl;auto with T2. Qed.
imports: EPSILON0 Arith List Omega Compare_dec Relations Wellfounded Max Tools More_nat AccP not_decreasing EPSILON0 More_nat Gamma0_prelude Gamma0_length term rpo