Nuprl Lemma : map-sig-map-squash

[Key,Value:Type]. ∀[m:map-sig{i:l}(Key;Value)].  (↓map-sig-map(m))


Proof




Definitions occuring in Statement :  map-sig-map: map-sig-map(m) map-sig: map-sig{i:l}(Key;Value) uall: [x:A]. B[x] squash: T universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T map-sig: map-sig{i:l}(Key;Value) record+: record+ record-select: r.x subtype_rel: A ⊆B eq_atom: =a y ifthenelse: if then else fi  btrue: tt uimplies: supposing a guard: {T} so_lambda: λ2x.t[x] so_apply: x[s] iff: ⇐⇒ Q all: x:A. B[x] rev_implies:  Q implies:  Q and: P ∧ Q prop: deq: EqDecider(T) bool: 𝔹 unit: Unit it: uiff: uiff(P;Q) bfalse: ff exists: x:A. B[x] or: P ∨ Q sq_type: SQType(T) bnot: ¬bb assert: b false: False band: p ∧b q not: ¬A cand: c∧ B exposed-bfalse: exposed-bfalse map-sig-map: map-sig-map(m) squash: T

Latex:
\mforall{}[Key,Value:Type].  \mforall{}[m:map-sig\{i:l\}(Key;Value)].    (\mdownarrow{}map-sig-map(m))



Date html generated: 2016_05_17-PM-01_46_46
Last ObjectModification: 2016_01_17-AM-11_37_08

Theory : datatype-signatures


Home Index