Nuprl Lemma : lnk-decl-ap
∀[k:Knd]. ∀[l:IdLnk]. ∀[dt:x:Id fp-> Type]. lnk-decl(l;dt)(k) ~ dt(tag(k)) supposing ↑k ∈ dom(lnk-decl(l;dt))
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-ap: f(x),
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
tagof: tag(k),
Knd: Knd,
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
Knd: Knd,
rcv: rcv(l,tg),
tagof: tag(k),
outl: outl(x),
pi2: snd(t),
locl: locl(a),
member: t ∈ T,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
IdLnk: IdLnk,
Id: Id,
sq_type: SQType(T),
implies: P ⇒ Q,
guard: {T},
fpf-cap: f(x)?z,
not: ¬A,
false: False,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
assert: ↑b
Latex:
\mforall{}[k:Knd]. \mforall{}[l:IdLnk]. \mforall{}[dt:x:Id fp-> Type].
lnk-decl(l;dt)(k) \msim{} dt(tag(k)) supposing \muparrow{}k \mmember{} dom(lnk-decl(l;dt))
Date html generated:
2016_05_16-AM-11_35_36
Last ObjectModification:
2015_12_29-AM-09_30_16
Theory : event-ordering
Home
Index