proposition: Lemma setI_setT_neut {U} (s : set U) : (s :&: setT) <--> s.
proof: Proof. firstorder. Qed.
imports: mathcomp.ssreflect.ssreflect Classes.RelationClasses Classes.Morphisms List Tactics mathcomp(ssrfun ssrbool ssrnat seq)