proposition: Lemma rst_eta : forall rst : RandomSeedTree, rst = RstNode (root_rst rst) (left_rst rst) (right_rst rst).
proof: Proof. destruct rst. reflexivity. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool ssrnat eqtype) ZArith LazyList Tactics