let subset (#a:eqtype) (s1:set a) (s2:set a) =
  forall x. mem x s1 ==> mem x s2
let subset (#a: eqtype) (s1 s2: set a) =
forall x. mem x s1 ==> mem x s2
FStar.Set.fsti.checked
prims.fst.checked FStar.Pervasives.fsti.checked
FStar.Set.fsti
Prims.eqtype FStar.Set.set Prims.l_Forall Prims.l_imp Prims.b2t FStar.Set.mem Prims.logical
(*
   Copyright 2008-2014 Nikhil Swamy, Aseem Rastogi,
                       Microsoft Research, University of Maryland

   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.
*)

module FStar.Set
(** Computational sets (on eqtypes): membership is a boolean function *)
#set-options "--initial_fuel 0 --max_fuel 0 --initial_ifuel 0 --max_ifuel 0"

val set (a:eqtype)
  : Type0

val equal (#a:eqtype) (s1:set a) (s2:set a)
  : Type0

(* destructors *)

val mem (#a:eqtype) (x:a) (s:set a)
  : Tot bool

(* constructors *)
val empty (#a:eqtype)
  : Tot (set a)

val singleton (#a:eqtype) (x:a)
  : Tot (set a)

val union      : #a:eqtype -> set a -> set a -> Tot (set a)
val intersect  : #a:eqtype -> set a -> set a -> Tot (set a)
val complement : #a:eqtype -> set a -> Tot (set a)
val intension  : #a:eqtype -> (a -> Tot bool) -> GTot (set a)

(* Derived functions *)

let disjoint (#a:eqtype) (s1: set a) (s2: set a) =
  equal (intersect s1 s2) empty
val subset : s1: FStar.Set.set a -> s2: FStar.Set.set a -> Prims.logical
s1: FStar.Set.set a -> s2: FStar.Set.set a -> Prims.logical