val singleton  : #a:Type -> x:a -> Tot (set a)
let singleton #a x     = F.on_dom a #(fun _ -> prop) (fun y -> y == x)
val singleton  : #a:Type -> x:a -> Tot (set a)
let singleton #a x =
F.on_dom a #(fun _ -> prop) (fun y -> y == x)
FStar.TSet.fst.checked
prims.fst.checked FStar.StrongExcludedMiddle.fst.checked FStar.Squash.fsti.checked FStar.Set.fsti.checked FStar.PropositionalExtensionality.fst.checked FStar.PredicateExtensionality.fst.checked FStar.Pervasives.fsti.checked FStar.FunctionalExtensionality.fsti.checked
FStar.TSet.fst
FStar.FunctionalExtensionality.on_dom Prims.prop Prims.eq2 FStar.TSet.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.
*)
(** Propositional sets (on any types): membership is a predicate *)
module FStar.TSet

#set-options "--initial_fuel 0 --max_fuel 0 --initial_ifuel 0 --max_ifuel 0"
module P = FStar.PropositionalExtensionality
module F = FStar.FunctionalExtensionality

(*
 * AR: mark it must_erase_for_extraction temporarily until CMI comes in
 *)
let set a = F.restricted_t a (fun _ -> prop)

let equal #_ s1 s2 = forall x. s1 x <==> s2 x

let mem x s = s x
val singleton  : #a:Type -> x:a -> Tot (set a)
x: a -> FStar.TSet.set a