{ [Info:Type]. [es:EO+(Info)]. [A:Type]. [P:{L:A List| 0 < ||L||}   ].
  [num:A  ]. [X:EClass(A)]. [e:E]. [n:].
    (collect-event(es;X;n;v.num[v];L.P[L];e)  ) }

{ Proof }



Definitions occuring in Statement :  collect-event: collect-event(es;X;n;v.num[v];L.P[L];e) eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-E: E length: ||as|| bool: nat: uall: [x:A]. B[x] prop: so_apply: x[s] member: t  T less_than: a < b set: {x:A| B[x]}  function: x:A  B[x] list: type List natural_number: $n int: universe: Type
Definitions :  uall: [x:A]. B[x] member: t  T prop: collect-event: collect-event(es;X;n;v.num[v];L.P[L];e) so_apply: x[s] and: P  Q assert: b cand: A c B so_lambda: x y.t[x; y] all: x:A. B[x] btrue: tt ifthenelse: if b then t else f fi  true: True subtype: S  T so_lambda: x.t[x] l_exists: (xL. P[x]) es-E-interface: E(X) exists: x:A. B[x] length: ||as|| implies: P  Q top: Top ycomb: Y nat: so_apply: x[s1;s2] uimplies: b supposing a sq_type: SQType(T) guard: {T} rev_implies: P  Q iff: P  Q not: A false: False
Lemmas :  assert_wf in-eclass_wf es-interface-top eclass-val_wf es-E_wf event-ordering+_inc event-ordering+_wf nat_wf mapfilter_wf es-E-interface_wf Id_wf es-loc_wf es-interface-predecessors_wf eq_int_wf subtype_base_sq bool_wf bool_subtype_base es-interface-val_wf2 length_wf1 eclass_wf assert_elim mapfilter-not-nil l_member_wf property-from-l_member sq_stable__equal es-interface-predecessors-member iff_weakening_uiff assert_of_eq_int not_wf non_neg_length length_wf_nat top_wf

\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[A:Type].  \mforall{}[P:\{L:A  List|  0  <  ||L||\}    {}\mrightarrow{}  \mBbbB{}].  \mforall{}[num:A  {}\mrightarrow{}  \mBbbN{}].
\mforall{}[X:EClass(A)].  \mforall{}[e:E].  \mforall{}[n:\mBbbZ{}].
    (collect-event(es;X;n;v.num[v];L.P[L];e)  \mmember{}  \mBbbP{})


Date html generated: 2011_08_16-PM-05_24_52
Last ObjectModification: 2011_06_20-AM-01_23_27

Home Index