Nuprl Lemma : es-dt_wf

[l:IdLnk]. ∀[da:k:Knd fp-> Type].  (dt(l;da) ∈ tg:Id fp-> Type)


Proof




Definitions occuring in Statement :  es-dt: dt(l;da) fpf: a:A fp-> B[a] Knd: Knd IdLnk: IdLnk Id: Id uall: [x:A]. B[x] member: t ∈ T universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T es-dt: dt(l;da) so_lambda: λ2x.t[x] so_apply: x[s] all: x:A. B[x] implies:  Q exposed-bfalse: exposed-bfalse bool: 𝔹 unit: Unit it: btrue: tt ifthenelse: if then else fi  uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False not: ¬A isl: isl(x) outl: outl(x) Knd: Knd lnk: lnk(k) isrcv: isrcv(k) tagof: tag(k) rcv: rcv(l,tg) pi1: fst(t) pi2: snd(t) IdLnk: IdLnk Id: Id

Latex:
\mforall{}[l:IdLnk].  \mforall{}[da:k:Knd  fp->  Type].    (dt(l;da)  \mmember{}  tg:Id  fp->  Type)



Date html generated: 2016_05_16-AM-11_39_35
Last ObjectModification: 2015_12_29-AM-09_35_22

Theory : event-ordering


Home Index