Nuprl Lemma : assert-hasloc
∀[i:Id]. ∀[k:Knd]. uiff(↑hasloc(k;i);destination(lnk(k)) = i ∈ Id supposing ↑isrcv(k))
Proof
Definitions occuring in Statement :
hasloc: hasloc(k;i),
ldst: destination(l),
lnk: lnk(k),
isrcv: isrcv(k),
Knd: Knd,
Id: Id,
assert: ↑b,
uiff: uiff(P;Q),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
Knd: Knd,
IdLnk: IdLnk,
isrcv: isrcv(k),
isl: isl(x),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
hasloc: hasloc(k;i),
lnk: lnk(k),
ldst: destination(l),
outl: outl(x),
band: p ∧b q,
pi1: fst(t),
pi2: snd(t),
bfalse: ff,
bnot: ¬bb,
false: False,
prop: ℙ,
true: True,
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
iff: P ⇐⇒ Q,
not: ¬A,
rev_implies: P ⇐ Q,
decidable: Dec(P),
or: P ∨ Q
Latex:
\mforall{}[i:Id]. \mforall{}[k:Knd]. uiff(\muparrow{}hasloc(k;i);destination(lnk(k)) = i supposing \muparrow{}isrcv(k))
Date html generated:
2016_05_16-AM-11_00_09
Last ObjectModification:
2015_12_29-AM-09_10_50
Theory : event-ordering
Home
Index