Nuprl Lemma : es-tags-dt-cap
∀[l:IdLnk]. ∀[tgs:Id List]. ∀[da:k:Knd fp-> Type]. ∀[T:Top]. ∀[tg:Id].
dt(l;tgs;da)(tg)?T ~ da(rcv(l,tg))?Void supposing (tg ∈ tgs)
Proof
Definitions occuring in Statement :
es-tags-dt: dt(l;tgs;da),
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
rcv: rcv(l,tg),
Knd: Knd,
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
l_member: (x ∈ l),
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
void: Void,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
fpf-cap: f(x)?z,
es-tags-dt: dt(l;tgs;da),
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
fpf-dom: x ∈ dom(f),
mk_fpf: mk_fpf(L;f),
pi1: fst(t),
uall: ∀[x:A]. B[x],
prop: ℙ,
not: ¬A,
implies: P ⇒ Q,
false: False,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff
Latex:
\mforall{}[l:IdLnk]. \mforall{}[tgs:Id List]. \mforall{}[da:k:Knd fp-> Type]. \mforall{}[T:Top]. \mforall{}[tg:Id].
dt(l;tgs;da)(tg)?T \msim{} da(rcv(l,tg))?Void supposing (tg \mmember{} tgs)
Date html generated:
2016_05_16-AM-11_39_20
Last ObjectModification:
2015_12_29-AM-09_34_07
Theory : event-ordering
Home
Index