{ [Info:Type]. eo:EO+(Info). e:E. a,b:E.  (a loc b ~ a loc b) }

{ Proof }



Definitions occuring in Statement :  eo-forward: eo.e event-ordering+: EO+(Info) es-ble: e loc e' es-E: E uall: [x:A]. B[x] all: x:A. B[x] universe: Type sqequal: s ~ t
Definitions :  atom: Atom apply: f a top: Top es-base-E: es-base-E(es) token: "$token" ifthenelse: if b then t else f fi  void: Void false: False lt_int: i <z j le_int: i z j bfalse: ff es-locl: (e <loc e') or: P  Q limited-type: LimitedType btrue: tt prop: es-le: e loc e'  iff: P  Q bimplies: p  q band: p  q bor: p q bnot: b int: unit: Unit union: left + right subtype: S  T pair: <a, b> fpf: a:A fp-B[a] strong-subtype: strong-subtype(A;B) record-select: r.x assert: b eq_atom: x =a y eq_atom: eq_atom$n(x;y) set: {x:A| B[x]}  dep-isect: Error :dep-isect,  record+: record+ le: A  B ge: i  j  not: A less_than: a < b product: x:A  B[x] and: P  Q uiff: uiff(P;Q) guard: {T} implies: P  Q equal: s = t sq_type: SQType(T) uimplies: b supposing a bool: subtype_rel: A r B uall: [x:A]. B[x] isect: x:A. B[x] universe: Type sqequal: s ~ t all: x:A. B[x] function: x:A  B[x] member: t  T lambda: x.A[x] es-E: E event_ordering: EO event-ordering+: EO+(Info) es-ble: e loc e' MaAuto: Error :MaAuto,  CollapseTHENA: Error :CollapseTHENA,  CollapseTHEN: Error :CollapseTHEN,  eo-forward: eo.e Auto: Error :Auto,  tactic: Error :tactic
Lemmas :  bool_wf es-le_wf eo-forward_wf not_wf bnot_wf assert_wf assert-es-ble not_functionality_wrt_iff assert_of_bnot iff_weakening_uiff iff_transitivity eqff_to_assert eqtt_to_assert eo-forward-E-subtype event-ordering+_wf event-ordering+_inc es-E_wf es-ble_wf bool_subtype_base subtype_base_sq btrue_wf bfalse_wf eo-forward-le es-base-E_wf subtype_rel_self

\mforall{}[Info:Type].  \mforall{}eo:EO+(Info).  \mforall{}e:E.  \mforall{}a,b:E.    (a  \mleq{}loc  b  \msim{}  a  \mleq{}loc  b)


Date html generated: 2011_08_16-AM-11_23_19
Last ObjectModification: 2010_12_21-PM-03_22_23

Home Index