Nuprl Lemma : mk-map-int-decr_wf
∀[Value:Type]. (mk-map-int-decr(Value) ∈ map-sig{i:l}(ℤ;Value))
Proof
Definitions occuring in Statement :
mk-map-int-decr: mk-map-int-decr(Value),
map-sig: map-sig{i:l}(Key;Value),
uall: ∀[x:A]. B[x],
member: t ∈ T,
int: ℤ,
universe: Type
Definitions unfolded in proof :
mk-map-int-decr: mk-map-int-decr(Value),
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
int-decr-map-type: int-decr-map-type(Value),
so_lambda: λ2x.t[x],
so_lambda: λ2x y.t[x; y],
pi1: fst(t),
so_apply: x[s1;s2],
so_apply: x[s],
implies: P ⇒ Q,
all: ∀x:A. B[x],
valueall-type: valueall-type(T),
has-value: (a)↓,
prop: ℙ,
deq: EqDecider(T),
iff: P ⇐⇒ Q,
and: P ∧ Q,
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q),
rev_implies: P ⇐ Q,
isl: isl(x),
int-decr-map-find: int-decr-map-find(k;m),
find-combine: find-combine(cmp;l),
list_ind: list_ind,
int-decr-map-inDom: int-decr-map-inDom(k;m),
subtype_rel: A ⊆r B,
top: Top,
not: ¬A,
false: False,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
band: p ∧b q,
exposed-bfalse: exposed-bfalse
Latex:
\mforall{}[Value:Type]. (mk-map-int-decr(Value) \mmember{} map-sig\{i:l\}(\mBbbZ{};Value))
Date html generated:
2016_05_17-PM-01_50_31
Last ObjectModification:
2016_01_08-AM-00_26_31
Theory : datatype-signatures
Home
Index