val gt : {| _: LeftistHeap.ordered t |} -> a: t -> b: t -> Prims.bool
let gt (#t: eqtype) {| _ : ordered t |} (a b: t) =
  leq b a && a <> b
(*
   Copyright 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 LeftistHeap

// -----------------------------------------------------------------
// Elimination rules for the ordered type class, and instantiations
// -----------------------------------------------------------------
/
prims.fst.checked FStar.Tactics.Typeclasses.fsti.checked FStar.Pervasives.Native.fst.checked FStar.Pervasives.fsti.checked FStar.Classical.Sugar.fsti.checked FStar.Calc.fsti.checked
LeftistHeap.fst
{| _: LeftistHeap.ordered t |} -> a: t -> b: t -> Prims.bool
Prims.eqtype LeftistHeap.ordered Prims.op_AmpAmp LeftistHeap.leq Prims.op_disEquality Prims.bool
let gt (#t: eqtype) {| _: ordered t |} (a b: t) =
  
leq b a && a <> b