val eq_instance_of_eqtype (#a: eqtype) {| _: Raw.deq a |} : deq a
let eq_instance_of_eqtype (#a:eqtype) {| Raw.deq a |} : deq a = {
  raw = Raw.eq_instance_of_eqtype #a;
  eq_dec = ();
}
val eq_instance_of_eqtype (#a: eqtype) {| _: Raw.deq a |} : deq a
let eq_instance_of_eqtype (#a: eqtype) {| _: Raw.deq a |} : deq a =
{ raw = Raw.eq_instance_of_eqtype #a; eq_dec = () }
FStar.Class.Eq.fst.checked
prims.fst.checked FStar.Tactics.Typeclasses.fsti.checked FStar.Pervasives.Native.fst.checked FStar.Pervasives.fsti.checked FStar.Classical.fsti.checked FStar.Class.Eq.Raw.fst.checked
FStar.Class.Eq.fst
Prims.eqtype FStar.Class.Eq.Raw.deq FStar.Class.Eq.Mkdeq FStar.Class.Eq.Raw.eq_instance_of_eqtype FStar.Class.Eq.deq
(*
   Copyright 2008-2023 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.
*)
module FStar.Class.Eq

open FStar.Tactics.Typeclasses
module Raw = FStar.Class.Eq.Raw

let decides_eq (#a:Type) (f : a -> a -> bool) : prop =
  forall x y. f x y <==> x == y

class deq a = {
  raw : Raw.deq a;
  eq_dec : squash (decides_eq raw.eq);
}

(* Superclass *)
instance deq_raw_deq (a:Type) (d:deq a) : Raw.deq a = d.raw

let eq (#a:Type) {| d : deq a |} (x y : a) : bool =
  d.raw.eq x y
val eq_instance_of_eqtype (#a: eqtype) {| _: Raw.deq a |} : deq a
{| _: FStar.Class.Eq.Raw.deq a |} -> FStar.Class.Eq.deq a