proposition: Lemma sum_atoms n: \sup_(i<pow2 pred) g_atom n i ≡ 1.
proof: Proof. rewrite <- teval_one. unfold g_one', g_prd'. rewrite sup_map. apply sup_weq. reflexivity. induction seq. reflexivity. now apply (cup_weq [_] [_])%list. Qed.
imports: Coq.PArith.BinPosDef denum lset sums normalisation kat ka_completeness untyping regex gregex lsyntax syntax lang glang boolean atoms