Nuprl Lemma : lnk-decl-cap
∀[l:IdLnk]. ∀[dt:tg:Id fp-> Type]. ∀[tg:Id]. ∀[T:Type]. (lnk-decl(l;dt)(rcv(l,tg))?T ~ dt(tg)?T)
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,
rcv: rcv(l,tg),
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
uall: ∀[x:A]. B[x],
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],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
prop: ℙ,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
fpf-cap: f(x)?z,
fpf-ap: f(x),
rcv: rcv(l,tg),
lnk-decl: lnk-decl(l;dt),
pi2: snd(t),
outl: outl(x),
not: ¬A,
false: False,
fpf: a:A fp-> B[a],
fpf-dom: x ∈ dom(f),
pi1: fst(t),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
exists: ∃x:A. B[x],
Id: Id,
sq_type: SQType(T),
guard: {T}
Latex:
\mforall{}[l:IdLnk]. \mforall{}[dt:tg:Id fp-> Type]. \mforall{}[tg:Id]. \mforall{}[T:Type]. (lnk-decl(l;dt)(rcv(l,tg))?T \msim{} dt(tg)?T)
Date html generated:
2016_05_16-AM-11_34_42
Last ObjectModification:
2015_12_29-AM-09_29_42
Theory : event-ordering
Home
Index