Nuprl Lemma : lnk-decl-dom

[l:IdLnk]. ∀[dt:tg:Id fp-> Type]. ∀[tg:Id].  (rcv(l,tg) ∈ dom(lnk-decl(l;dt)) tg ∈ dom(dt))


Proof




Definitions occuring in Statement :  lnk-decl: lnk-decl(l;dt) fpf-dom: x ∈ dom(f) fpf: a:A fp-> B[a] Kind-deq: KindDeq rcv: rcv(l,tg) IdLnk: IdLnk id-deq: IdDeq Id: Id uall: [x:A]. B[x] universe: Type sqequal: t
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T fpf: a:A fp-> B[a] fpf-dom: x ∈ dom(f) lnk-decl: lnk-decl(l;dt) pi1: fst(t) uimplies: supposing a sq_type: SQType(T) all: x:A. B[x] implies:  Q guard: {T} so_lambda: λ2x.t[x] so_apply: x[s] iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q exists: x:A. B[x] prop: Id: Id

Latex:
\mforall{}[l:IdLnk].  \mforall{}[dt:tg:Id  fp->  Type].  \mforall{}[tg:Id].    (rcv(l,tg)  \mmember{}  dom(lnk-decl(l;dt))  \msim{}  tg  \mmember{}  dom(dt))



Date html generated: 2016_05_16-AM-11_34_49
Last ObjectModification: 2015_12_29-AM-09_30_49

Theory : event-ordering


Home Index