{ [A:Type]. [B:A  Type]. [eq:EqDecider(A)]. [f,g:a:A fp-B[a]].
    {f  f  g  g  f  g} supposing f || g }

{ Proof }



Definitions occuring in Statement :  fpf-join: f  g fpf-compatible: f || g fpf-sub: f  g fpf: a:A fp-B[a] uimplies: b supposing a uall: [x:A]. B[x] guard: {T} so_apply: x[s] and: P  Q function: x:A  B[x] universe: Type deq: EqDecider(T)
Definitions :  uall: [x:A]. B[x] so_apply: x[s] uimplies: b supposing a guard: {T} and: P  Q fpf-sub: f  g member: t  T so_lambda: x.t[x] all: x:A. B[x] implies: P  Q cand: A c B prop:
Lemmas :  fpf-sub-join-right pair_wf assert_wf fpf-dom_wf fpf-join_wf top_wf fpf-trivial-subtype-top assert_witness fpf-compatible_wf fpf_wf deq_wf fpf-sub-join-left

\mforall{}[A:Type].  \mforall{}[B:A  {}\mrightarrow{}  Type].  \mforall{}[eq:EqDecider(A)].  \mforall{}[f,g:a:A  fp->  B[a]].
    \{f  \msubseteq{}  f  \moplus{}  g  \mwedge{}  g  \msubseteq{}  f  \moplus{}  g\}  supposing  f  ||  g


Date html generated: 2011_08_10-AM-08_00_36
Last ObjectModification: 2011_06_18-AM-08_19_33

Home Index