val is_permutation (#a:Type) (s0:seq a) (s1:seq a) (f:index_fun s0) : prop
let is_permutation (#a:Type) (s0:seq a) (s1:seq a) (f:index_fun s0) =
  Seq.length s0 == Seq.length s1 /\
  (forall x y. // {:pattern f x; f y}
  x <> y ==> f x <> f y) /\
  (forall (i:nat{i < Seq.length s0}). // {:pattern (Seq.index s1 (f i))}
      Seq.index s0 i == Seq.index s1 (f i))
val is_permutation (#a:Type) (s0:seq a) (s1:seq a) (f:index_fun s0) : prop
let is_permutation (#a: Type) (s0 s1: seq a) (f: index_fun s0) =
Seq.length s0 == Seq.length s1 /\ (forall x y. x <> y ==> f x <> f y) /\
(forall (i: nat{i < Seq.length s0}). Seq.index s0 i == Seq.index s1 (f i))
FStar.Seq.Permutation.fst.checked
prims.fst.checked FStar.Seq.Equiv.fsti.checked FStar.Seq.fst.checked FStar.Pervasives.Native.fst.checked FStar.Pervasives.fsti.checked FStar.Classical.Sugar.fsti.checked FStar.Classical.fsti.checked FStar.Calc.fsti.checked FStar.Algebra.CommMonoid.Equiv.fst.checked
FStar.Seq.Permutation.fst
FStar.Seq.Base.seq FStar.Seq.Permutation.index_fun Prims.l_and Prims.eq2 Prims.nat FStar.Seq.Base.length Prims.l_Forall FStar.IntegerIntervals.under Prims.l_imp Prims.b2t Prims.op_disEquality Prims.op_LessThan FStar.Seq.Base.index Prims.prop
(*
   Copyright 2021-2022 Microsoft Research

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.

   Authors: N. Swamy, A. Rastogi, A. Rozanov
*)
module FStar.Seq.Permutation
open FStar.Seq
open FStar.Calc

[@@"opaque_to_smt"]
val is_permutation (#a:Type) (s0:seq a) (s1:seq a) (f:index_fun s0) : prop
s0: FStar.Seq.Base.seq a -> s1: FStar.Seq.Base.seq a -> f: FStar.Seq.Permutation.index_fun s0
  -> Prims.prop