{ [Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [e:E].
    ((X)(e) ~ if e  X then if first(e) then [e] else (X)(pred(e)) @ [e] fi 
    if first(e) then []
    else (X)(pred(e))
    fi ) }

{ Proof }



Definitions occuring in Statement :  es-interface-predecessors: (X)(e) in-eclass: e  X eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-pred: pred(e) es-first: first(e) es-E: E append: as @ bs ifthenelse: if b then t else f fi  uall: [x:A]. B[x] top: Top cons: [car / cdr] nil: [] universe: Type sqequal: s ~ t
Definitions :  member: t  T so_lambda: x y.t[x; y] es-interface-predecessors: (X)(e) append: as @ bs eclass-events: eclass-events(es;X;L) es-le-before: loc(e) filter: filter(P;l) es-before: before(e) ycomb: Y prop: reduce: reduce(f;k;as) ifthenelse: if b then t else f fi  all: x:A. B[x] implies: P  Q btrue: tt bfalse: ff top: Top uall: [x:A]. B[x] so_apply: x[s1;s2] bool: unit: Unit iff: P  Q and: P  Q uimplies: b supposing a subtype: S  T it:
Lemmas :  es-E_wf event-ordering+_inc eclass_wf top_wf event-ordering+_wf es-first_wf bool_wf assert_wf not_wf bnot_wf iff_weakening_uiff eqtt_to_assert uiff_transitivity eqff_to_assert assert_of_bnot in-eclass_wf append_wf es-before_wf es-pred_wf append-nil filter_wf_top l_member_wf ifthenelse_wf filter_append_sq

\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[X:EClass(Top)].  \mforall{}[e:E].
    (\mleq{}(X)(e)  \msim{}  if  e  \mmember{}\msubb{}  X  then  if  first(e)  then  [e]  else  \mleq{}(X)(pred(e))  @  [e]  fi 
    if  first(e)  then  []
    else  \mleq{}(X)(pred(e))
    fi  )


Date html generated: 2011_08_16-PM-04_33_20
Last ObjectModification: 2011_06_20-AM-00_55_04

Home Index