Nuprl Lemma : lnk-decl-dom-not

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


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 locl: locl(a) IdLnk: IdLnk Id: Id bfalse: ff 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] lnk-decl: lnk-decl(l;dt) fpf-dom: x ∈ dom(f) 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 assert: b ifthenelse: if then else fi  bfalse: ff exists: x:A. B[x] prop: rev_implies:  Q not: ¬A false: False

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



Date html generated: 2016_05_16-AM-11_35_14
Last ObjectModification: 2015_12_29-AM-09_29_56

Theory : event-ordering


Home Index