val forall_intro: Prims.unit -> Tac binder
let forall_intro () : Tac binder =
    apply_lemma (`fa_intro_lem);
    intro ()
val forall_intro: Prims.unit -> Tac binder
let forall_intro () : Tac binder =
apply_lemma (`fa_intro_lem);
intro ()
FStar.Tactics.V1.Logic.fst.checked
prims.fst.checked FStar.Tactics.V1.Derived.fst.checked FStar.Tactics.V1.Builtins.fsti.checked FStar.Tactics.Util.fst.checked FStar.Tactics.Effect.fsti.checked FStar.Squash.fsti.checked FStar.Reflection.V1.Formula.fst.checked FStar.Reflection.V1.fst.checked FStar.Pervasives.Native.fst.checked FStar.Pervasives.fsti.checked FStar.IndefiniteDescription.fsti.checked FStar.Classical.fsti.checked
FStar.Tactics.V1.Logic.fst
Prims.unit FStar.Tactics.V1.Builtins.intro FStar.Reflection.Types.binder FStar.Tactics.V1.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.V1.Logic

open FStar.Tactics.Effect
open FStar.Tactics.V1.Builtins
open FStar.Tactics.V1.Derived
open FStar.Tactics.Util
open FStar.Reflection.V1
open FStar.Reflection.V1.Formula

(** Returns the current goal as a [formula]. *)
let cur_formula () : Tac formula = term_as_formula (cur_goal ())

private val revert_squash : (#a:Type) -> (#b : (a -> Type)) ->
                            (squash (forall (x:a). b x)) ->
                            x:a -> squash (b x)
let revert_squash #a #b s x = let x : (_:unit{forall x. b x}) = s in ()

(** Revert an introduced binder as a forall. *)
let l_revert () : Tac unit =
    revert ();
    apply (`revert_squash)

(** Repeated [l_revert]. *)
let rec l_revert_all (bs:binders) : Tac unit =
    match bs with
    | []    -> ()
    | _::tl -> begin l_revert (); l_revert_all tl end

private let fa_intro_lem (#a:Type) (#p:a -> Type) (f:(x:a -> squash (p x))) : Lemma (forall (x:a). p x) =
  FStar.Classical.lemma_forall_intro_gtot
    ((fun x -> FStar.IndefiniteDescription.elim_squash (f x)) <: (x:a -> GTot (p x)))

(** Introduce a forall. *)
val forall_intro: Prims.unit -> Tac binder
_: Prims.unit -> FStar.Tactics.Effect.Tac FStar.Reflection.Types.binder