val step: Prims.unit -> Tac unit
let step () : Tac unit =
    apply_lemma (`lem_iff_trans)
val step: Prims.unit -> Tac unit
let step () : Tac unit =
apply_lemma (`lem_iff_trans)
FStar.Tactics.Simplifier.fst.checked
prims.fst.checked FStar.Tactics.V2.fst.checked FStar.Tactics.Effect.fsti.checked FStar.Reflection.V2.Formula.fst.checked FStar.Reflection.Const.fst.checked FStar.Pervasives.fsti.checked
FStar.Tactics.Simplifier.fst
Prims.unit FStar.Tactics.V2.Derived.apply_lemma
(*
   Copyright 2008-2018 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.Tactics.Simplifier

open FStar.Tactics.V2
open FStar.Reflection.V2.Formula
open FStar.Reflection.Const

(* A correct-by-construction logical simplifier
 *
 * No calling `norm [simpl]`, that's cheating!
 *)

val lem_iff_refl : #a:Type -> Lemma (a <==> a)
let lem_iff_refl #a = ()

val lem_iff_trans : #a:Type -> #b:Type -> #c:Type -> squash (a <==> b) -> squash (b <==> c)
                                                            -> Lemma (a <==> c)
let lem_iff_trans #a #b #c _ _ = ()

let tiff () : Tac unit =
    apply_lemma (`lem_iff_refl)
val step: Prims.unit -> Tac unit
_: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit