{ [es:EO]. [e2,e1:E].  last([e1, e2]) ~ e2 supposing e1 loc e2  }

{ Proof }



Definitions occuring in Statement :  es-interval: [e, e'] es-le: e loc e'  es-E: E event_ordering: EO uimplies: b supposing a uall: [x:A]. B[x] sqequal: s ~ t last: last(L)
Definitions :  function: x:A  B[x] all: x:A. B[x] equal: s = t event_ordering: EO prop: es-le: e loc e'  sqequal: s ~ t uall: [x:A]. B[x] es-E: E uimplies: b supposing a isect: x:A. B[x] member: t  T CollapseTHENA: Error :CollapseTHENA,  tactic: Error :tactic,  universe: Type subtype: S  T es-locl: (e <loc e') list: type List es-interval: [e, e'] last: last(L) filter: filter(P;l) void: Void es-before: before(e) top: Top set: {x:A| B[x]}  CollapseTHEN: Error :CollapseTHEN,  limited-type: LimitedType le: A  B ge: i  j  apply: f a record: record(x.T[x]) so_lambda: x.t[x] sq_type: SQType(T) lt_int: i <z j le_int: i z j bfalse: ff btrue: tt iff: P  Q bimplies: p  q band: p  q bor: p q bnot: b int: unit: Unit bool: strong-subtype: strong-subtype(A;B) eq_atom: x =a y eq_atom: eq_atom$n(x;y) record-select: r.x infix_ap: x f y tl: tl(l) hd: hd(l) union: left + right or: P  Q dep-isect: Error :dep-isect,  record+: record+ less_than: a < b product: x:A  B[x] and: P  Q uiff: uiff(P;Q) subtype_rel: A r B assert: b implies: P  Q false: False not: A nil: [] cons: [car / cdr] es-ble: e loc e' l_member: (x  l) lambda: x.A[x] Complete: Error :Complete,  Try: Error :Try
Lemmas :  not_wf assert_wf iff_transitivity eqff_to_assert iff_weakening_uiff bool_wf assert-es-ble eqtt_to_assert set_subtype_base subtype_base_sq last_wf filter_wf not_functionality_wrt_iff assert_of_bnot pos_length2 false_wf l_member_wf es-ble_wf filter_wf_top es-before_wf last_append bnot_wf filter_append_sq es-before_wf3 member_wf top_wf es-locl_wf es-le_wf es-E_wf event_ordering_wf

\mforall{}[es:EO].  \mforall{}[e2,e1:E].    last([e1,  e2])  \msim{}  e2  supposing  e1  \mleq{}loc  e2 


Date html generated: 2011_08_16-AM-10_39_57
Last ObjectModification: 2011_06_18-AM-09_18_30

Home Index