left; auto with arith pts.
red in |- *; intros.
apply univ_inv with Sprop (Stype n); intros; auto with arith pts.
inversion_clear H0.
red in |- *; intros.
apply univ_inv with (Stype n) Sprop; intros; auto with arith pts.
inversion_clear H0.
case (le_gt_dec n n'); [ left | right ].
auto with pts.
red in |- *; intros.
apply univ_inv with (Stype n) (Stype n'); intros; auto with arith pts.
inversion_clear H0.
absurd (n <= n'); auto with arith pts.
Qed.
(* Inference des axiomes et regles *)

Lemma ecc_inf_axiom :
forall s : srt_ecc, {sp : srt_ecc | ppal (axiom_ecc s) univ sp}.