proposition: Lemma L_ge_id alpha : forall i, (i <= L_ alpha i)%N.
proof: Proof. move => i; rewrite /L_. apply /leP ; apply L_alpha.L_ge_id. Qed.
imports: mathcomp(all_ssreflect zify) Coq(Logic.Eqdep_dec) hydras(DecPreOrder) hydras(T1 E0) hydras(L_alpha) gaia_hydras(T1Bridge GCanon GPaths GHprime)