val equal_elim (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value)
    : Lemma (requires (equal m1 m2)) (ensures (m1 == m2)) [SMTPat (equal m1 m2)]
let equal_elim (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value) =
  F.extensionality key value m1.mappings m2.mappings
val equal_elim (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value)
    : Lemma (requires (equal m1 m2)) (ensures (m1 == m2)) [SMTPat (equal m1 m2)]
let equal_elim (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value) =
F.extensionality key value m1.mappings m2.mappings
FStar.DependentMap.fst.checked
prims.fst.checked FStar.Pervasives.fsti.checked FStar.FunctionalExtensionality.fsti.checked
FStar.DependentMap.fst
Prims.eqtype FStar.DependentMap.t FStar.FunctionalExtensionality.extensionality FStar.DependentMap.__proj__Mkt__item__mappings Prims.unit
(*
   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.DependentMap

module F = FStar.FunctionalExtensionality
noeq
type t (key: eqtype) (value: (key -> Type)) = { mappings:F.restricted_t key value }

let create (#key: eqtype) (#value: (key -> Tot Type)) (f: (k: key -> Tot (value k)))
    : Tot (t key value) = { mappings = F.on_domain key f }

let sel (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value) (k: key) : Tot (value k) =
  m.mappings k

let sel_create (#key: eqtype) (#value: (key -> Tot Type)) (f: (k: key -> Tot (value k))) (k: key)
    : Lemma (requires True)
      (ensures (sel #key #value (create f) k == f k))
      [SMTPat (sel #key #value (create f) k)] = ()

let upd (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value) (k: key) (v: value k)
    : Tot (t key value) =
  { mappings = F.on_domain key (fun k' -> if k' = k then v else m.mappings k') }

let sel_upd_same (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value) (k: key) (v: value k) =
  ()

let sel_upd_other
      (#key: eqtype)
      (#value: (key -> Tot Type))
      (m: t key value)
      (k: key)
      (v: value k)
      (k': key)
     = ()

let equal (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value) =
  forall k. sel m1 k == sel m2 k

let equal_intro (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value) = ()

let equal_refl (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value) = ()
val equal_elim (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value)
    : Lemma (requires (equal m1 m2)) (ensures (m1 == m2)) [SMTPat (equal m1 m2)]
m1: FStar.DependentMap.t key value -> m2: FStar.DependentMap.t key value
  -> FStar.Pervasives.Lemma (requires FStar.DependentMap.equal m1 m2)
      (ensures m1 == m2)
      [SMTPat (FStar.DependentMap.equal m1 m2)]