Nuprl Lemma : lnk-decl-dom2

[l,l2:IdLnk]. ∀[dt:tg:Id fp-> Type]. ∀[tg:Id].  l2 l ∈ IdLnk supposing ↑rcv(l2,tg) ∈ dom(lnk-decl(l;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: Id assert: b uimplies: supposing a uall: [x:A]. B[x] universe: Type equal: t ∈ T
Definitions unfolded in proof :  fpf: a:A fp-> B[a] lnk-decl: lnk-decl(l;dt) fpf-dom: x ∈ dom(f) pi1: fst(t) uall: [x:A]. B[x] member: t ∈ T all: x:A. B[x] iff: ⇐⇒ Q and: P ∧ Q implies:  Q exists: x:A. B[x] uimplies: supposing a guard: {T} subtype_rel: A ⊆B prop: so_lambda: λ2x.t[x] so_apply: x[s] top: Top

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



Date html generated: 2016_05_16-AM-11_35_20
Last ObjectModification: 2015_12_29-AM-09_30_41

Theory : event-ordering


Home Index