proposition: Lemma suppC1 : (forall L s, suppC L [fset s] = L |> s) * (forall L s b, suppC L [fset (s,b)] = supp L s b).
proof: Proof. split => *; exact: all_fset1. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype)