Nuprl Lemma : lnk-decl-dom-single
∀[l:IdLnk]. ∀[k:Knd]. ∀[tg:Id]. ∀[v:Top]. (k ∈ dom(lnk-decl(l;tg : v)) ~ rcv(l,tg) = k)
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-single: x : v,
fpf-dom: x ∈ dom(f),
eq_knd: a = b,
Kind-deq: KindDeq,
rcv: rcv(l,tg),
Knd: Knd,
IdLnk: IdLnk,
Id: Id,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
fpf-single: x : v,
lnk-decl: lnk-decl(l;dt),
fpf-dom: x ∈ dom(f),
pi1: fst(t),
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
eq_knd: a = b,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
bor: p ∨bq,
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False
Latex:
\mforall{}[l:IdLnk]. \mforall{}[k:Knd]. \mforall{}[tg:Id]. \mforall{}[v:Top]. (k \mmember{} dom(lnk-decl(l;tg : v)) \msim{} rcv(l,tg) = k)
Date html generated:
2016_05_16-AM-11_34_57
Last ObjectModification:
2015_12_29-AM-09_29_23
Theory : event-ordering
Home
Index