val singleton  : #a:Type -> a -> Tot (set a)
let singleton #a x     = F.on_dom_g a #(fun _ -> bool) (fun y -> StrongExcludedMiddle.strong_excluded_middle (y == x))
val singleton  : #a:Type -> a -> Tot (set a)
let singleton #a x =
F.on_dom_g a #(fun _ -> bool) (fun y -> StrongExcludedMiddle.strong_excluded_middle (y == x))
FStar.GSet.fst.checked
prims.fst.checked FStar.StrongExcludedMiddle.fst.checked FStar.Set.fsti.checked FStar.Pervasives.fsti.checked FStar.FunctionalExtensionality.fsti.checked
FStar.GSet.fst
FStar.FunctionalExtensionality.on_dom_g Prims.bool FStar.StrongExcludedMiddle.strong_excluded_middle Prims.eq2 FStar.GSet.set
(*
   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.GSet
(** Computational sets (on Types): membership is a boolean function *)
#set-options "--initial_fuel 0 --max_fuel 0 --initial_ifuel 0 --max_ifuel 0"
open FStar.FunctionalExtensionality
module F = FStar.FunctionalExtensionality

let set (a: Type) : Tot Type = F.restricted_g_t a (fun _ -> bool)

type equal (#a:Type) (s1:set a) (s2:set a) = F.feq_g s1 s2

(* destructors *)
let mem #a x s = s x

(* constructors *)
val singleton  : #a:Type -> a -> Tot (set a)
x: a -> FStar.GSet.set a