proposition: Lemma Random_total : forall n : nat, mu (Random n) (fone nat) == 1.
proof: Proof. intros; simpl mu;unfold fone; rewrite random_simpl. apply Oeq_trans with (sigma (fnth n) (S n)). apply sigma_eq_compat. intros; repeat Usimpl; auto. auto. Qed.
imports: ALEA(Monads) ALEA(Utheory)