---

{ [l:IdLnk]. [k:Knd]. [dt1,dt2:tg:Id fp-> Type].
    (k  dom(lnk-decl(l;dt1  dt2)) ~ k  dom(lnk-decl(l;dt1))
    k  dom(lnk-decl(l;dt2))) }

{ Proof }

---

Definitions occuring in Statement :  lnk-decl: lnk-decl(l;dt),  fpf-join: f  g,  fpf-dom: x  dom(f),  fpf: a:A fp-> B[a],  Kind-deq: KindDeq,  id-deq: IdDeq,  Knd: Knd,  IdLnk: IdLnk,  Id: Id,  bor: p q,  uall: [x:A]. B[x],  universe: Type,  sqequal: s ~ t
Definitions :  uall: [x:A]. B[x],  fpf-dom: x  dom(f),  lnk-decl: lnk-decl(l;dt),  member: t  T,  so_lambda: x.t[x],  pi1: fst(t),  iff: P  Q,  fpf-join: f  g,  prop: ,  or: P  Q,  top: Top,  all: x:A. B[x],  subtype: S  T,  exists: x:A. B[x],  and: P  Q,  cand: A c B,  implies: P  Q,  rev_implies: P  Q,  guard: {T},  not: A,  sq_type: SQType(T),  uimplies: b supposing a,  so_apply: x[s],  fpf: a:A fp-> B[a],  decidable: Dec(P),  false: False,  mapfilter: mapfilter(f;P;L)
Lemmas :  subtype_base_sq,  bool_wf,  bool_subtype_base,  iff_imp_equal_bool,  fpf-dom_wf,  Kind-deq_wf,  lnk-decl_wf,  fpf-join_wf,  id-deq_wf,  fpf-trivial-subtype-top,  Knd_wf,  fpf_wf,  top_wf,  bor_wf,  Id_wf,  IdLnk_wf,  assert_wf,  deq-member_wf,  map_wf,  append_wf,  filter_wf,  bnot_wf,  rcv_wf,  l_member_wf,  map_append_sq,  mapfilter_wf,  not_wf,  decidable__l_member,  decidable__equal_Kind,  iff_functionality_wrt_iff,  assert-deq-member,  iff_transitivity,  iff_weakening_uiff,  assert_of_bor,  or_functionality_wrt_iff,  member_append,  member_map_filter,  exists_functionality_wrt_iff,  and_functionality_wrt_iff,  cand_functionality_wrt_iff,  assert_of_bnot,  not_functionality_wrt_iff,  member_map

---

\mforall{}[l:IdLnk].  \mforall{}[k:Knd].  \mforall{}[dt1,dt2:tg:Id  fp->  Type].
    (k  \mmember{}  dom(lnk-decl(l;dt1  \moplus{}  dt2))  \msim{}  k  \mmember{}  dom(lnk-decl(l;dt1))  \mvee{}\msubb{}k  \mmember{}  dom(lnk-decl(l;dt2)))


Date html generated: 2011_08_10-AM-08_10_26
Last ObjectModification: 2011_06_18-AM-08_26_23

Home Index