fact: Fixpoint bounded_aux n : Pol_type n -> Type:= match n as m return Pol_type m -> Type with | 0 => fun a => Ale A0 a | S n => fun P1 => forall x1, (A0<=x1) -> bounded_aux n (P1 x1) end.
imports: Coq(List ZArith Lia) CoLoR(weaved_relation equational_theory term_spec terminaison)