Nuprl Lemma : es-dt-cap
∀[da:k:Knd fp-> Type]. ∀[l:IdLnk]. ∀[tg:Id]. ∀[T:Top]. (dt(l;da)(tg)?T ~ da(rcv(l,tg))?T)
Proof
Definitions occuring in Statement :
es-dt: dt(l;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,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
fpf-cap: f(x)?z,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
uiff: uiff(P;Q),
prop: ℙ,
rev_implies: P ⇐ Q,
rev_uimplies: rev_uimplies(P;Q),
sq_type: SQType(T),
guard: {T},
fpf: a:A fp-> B[a],
fpf-ap: f(x),
es-dt: dt(l;da),
pi2: snd(t),
compose-fpf: compose-fpf(a;b;f),
compose: f o g
Latex:
\mforall{}[da:k:Knd fp-> Type]. \mforall{}[l:IdLnk]. \mforall{}[tg:Id]. \mforall{}[T:Top]. (dt(l;da)(tg)?T \msim{} da(rcv(l,tg))?T)
Date html generated:
2016_05_16-AM-11_40_02
Last ObjectModification:
2015_12_29-AM-09_34_01
Theory : event-ordering
Home
Index