Nuprl Lemma : locknd_functionality_isrcv

[i,j:Id]. ∀[k1,k2:Knd].  (locknd(i;k1) locknd(j;k2) ∈ LocKnd) supposing ((k1 k2 ∈ Knd) and (↑isrcv(k1)))


Proof




Definitions occuring in Statement :  locknd: locknd(i;k) LocKnd: LocKnd isrcv: isrcv(k) Knd: Knd Id: Id assert: b uimplies: supposing a uall: [x:A]. B[x] equal: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a Knd: Knd so_lambda: λ2x.t[x] so_apply: x[s] IdLnk: IdLnk Id: Id all: x:A. B[x] sq_type: SQType(T) implies:  Q guard: {T} prop: lnk: lnk(k) rcv: rcv(l,tg) locknd: locknd(i;k) kindcase: kindcase(k;a.f[a];l,t.g[l; t]) islocal: islocal(k) isl: isl(x) outl: outl(x) bnot: ¬bb ifthenelse: if then else fi  btrue: tt pi1: fst(t) bfalse: ff LocKnd: LocKnd iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q squash: T true: True

Latex:
\mforall{}[i,j:Id].  \mforall{}[k1,k2:Knd].    (locknd(i;k1)  =  locknd(j;k2))  supposing  ((k1  =  k2)  and  (\muparrow{}isrcv(k1)))



Date html generated: 2016_05_16-AM-11_00_59
Last ObjectModification: 2016_01_17-PM-03_47_27

Theory : event-ordering


Home Index