proposition: Lemma randomPerm_wf : forall ls b0, (forall x, ls#x = None -> exists r, inRange ls r = false /\ In r (getSupport RndR)) -> well_formed_comp (randomPerm (ls, b0)).
proof: Proof. intuition. unfold randomPerm. case_eq (ls#b0); intuition; wftac. edestruct H; eauto. intuition. wftac. Qed.
imports: Crypto Permutation CompFold Array FCF State