Nuprl Lemma : lnk-decl-cap2
∀[l1,l2:IdLnk]. ∀[dt:tg:Id fp-> Type]. ∀[tg:Id]. ∀[T:Type].
(lnk-decl(l1;dt)(rcv(l2,tg))?T ~ if l1 = l2 then dt(tg)?T else T fi )
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
eq_lnk: a = b,
rcv: rcv(l,tg),
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
ifthenelse: if b then t else f fi ,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
member: t ∈ T,
uall: ∀[x:A]. B[x],
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
bfalse: ff,
iff: P ⇐⇒ Q,
not: ¬A,
rev_implies: P ⇐ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
IdLnk: IdLnk,
Id: Id,
sq_type: SQType(T),
guard: {T},
subtype_rel: A ⊆r B,
top: Top,
fpf-cap: f(x)?z,
false: False
Latex:
\mforall{}[l1,l2:IdLnk]. \mforall{}[dt:tg:Id fp-> Type]. \mforall{}[tg:Id]. \mforall{}[T:Type].
(lnk-decl(l1;dt)(rcv(l2,tg))?T \msim{} if l1 = l2 then dt(tg)?T else T fi )
Date html generated:
2016_05_16-AM-11_35_26
Last ObjectModification:
2015_12_29-AM-09_30_22
Theory : event-ordering
Home
Index