{ [l:IdLnk]. [dt:tg:Id fp-Type].
    (lnk-decl(l;dt)  k:{k:Knd| hasloc(k;destination(l))}  fp-Type) }

{ Proof }



Definitions occuring in Statement :  lnk-decl: lnk-decl(l;dt) fpf: a:A fp-B[a] hasloc: hasloc(k;i) ldst: destination(l) Knd: Knd IdLnk: IdLnk Id: Id assert: b uall: [x:A]. B[x] member: t  T set: {x:A| B[x]}  universe: Type
Definitions :  uall: [x:A]. B[x] fpf: a:A fp-B[a] member: t  T lnk-decl: lnk-decl(l;dt) prop: top: Top all: x:A. B[x] subtype: S  T hasloc: hasloc(k;i) band: p  q btrue: tt ifthenelse: if b then t else f fi  not: A implies: P  Q IdLnk: IdLnk Id: Id Knd: Knd so_lambda: x.t[x] rcv: rcv(l,tg) fpf-ap: f(x) pi2: snd(t) outl: outl(x) false: False rev_implies: P  Q iff: P  Q and: P  Q exists: x:A. B[x] sq_type: SQType(T) uimplies: b supposing a so_apply: x[s] guard: {T}
Lemmas :  map_wf Id_wf Knd_wf assert_wf hasloc_wf ldst_wf pi1_wf_top l_member_wf IdLnk_wf rcv_wf bnot_wf eq_id_wf not_wf member_wf iff_weakening_uiff uiff_transitivity assert_of_bnot not_functionality_wrt_uiff assert-eq-id member_map subtype_base_sq set_subtype_base union_subtype_base product_subtype_base atom2_subtype_base pi2_wf

\mforall{}[l:IdLnk].  \mforall{}[dt:tg:Id  fp->  Type].    (lnk-decl(l;dt)  \mmember{}  k:\{k:Knd|  \muparrow{}hasloc(k;destination(l))\}    fp->  Typ\000Ce)


Date html generated: 2011_08_10-AM-08_10_07
Last ObjectModification: 2011_06_18-AM-08_26_13

Home Index