proposition: Lemma omega_term_def : forall a n, nf a -> omega_term a n = T1omega ^ a * FS n.
proof: Proof. intros a n H; rewrite phi0_eq; auto. simpl; case a; simpl; unfold omega_term; rewrite <- (plus_n_O n); auto. Qed.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles Wellfounded Bool RelationClasses Operators_Properties ArithRing Logic.Eqdep_dec) hydras(More_Arith Restriction DecPreOrder) hydras(OrdNotations)