{ EO r event_ordering{i':l} }

{ Proof }



Definitions occuring in Statement :  event_ordering: EO subtype_rel: A r B
Definitions :  list: type List set: {x:A| B[x]}  real: grp_car: |g| subtype: S  T int: limited-type: LimitedType strong-subtype: strong-subtype(A;B) le: A  B ge: i  j  and: P  Q uiff: uiff(P;Q) intensional-universe: IType fpf: a:A fp-B[a] nat: not: A eq_atom: eq_atom$n(x;y) eq_atom: x =a y ifthenelse: if b then t else f fi  dep-isect: Error :dep-isect,  token: "$token" atom: Atom lambda: x.A[x] member: t  T top: Top bool: universe: Type prop: Id: Id less_than: a < b event_ordering: EO uall: [x:A]. B[x] subtype_rel: A r B uimplies: b supposing a isect: x:A. B[x] or: P  Q union: left + right equal: s = t so_lambda: x.t[x] exists: x:A. B[x] product: x:A  B[x] all: x:A. B[x] implies: P  Q function: x:A  B[x] l_member: (x  l) infix_ap: x f y apply: f a record: record(x.T[x]) record+: record+ record-select: r.x THENL_cons: Error :THENL_nil,  Auto: Error :Auto,  tactic: Error :tactic,  THENL_cons: Error :THENL_cons,  MaAuto: Error :MaAuto,  CollapseTHEN: Error :CollapseTHEN,  THENL_v2: Error :THENL,  RepeatFor: Error :RepeatFor,  fpf-cap: f(x)?z Complete: Error :Complete,  Try: Error :Try,  tag-by: zT rev_implies: P  Q iff: P  Q fset: FSet{T} isect2: T1  T2 b-union: A  B true: True fpf-sub: f  g deq: EqDecider(T) ma-state: State(ds) fpf-dom: x  dom(f) false: False guard: {T} pair: <a, b> D: Error :D,  CollapseTHENA: Error :CollapseTHENA
Lemmas :  subtype_rel_function record-select_wf2 subtype_rel_record+ record+_wf l_member_wf subtype_rel_self not_wf nat_wf Id_wf bool_wf top_wf record_wf subtype_rel_record+_easy record-select_wf member_wf subtype_rel_wf intensional-universe_wf

EO  \msubseteq{}r  event\_ordering\{i':l\}


Date html generated: 2011_08_16-AM-10_28_50
Last ObjectModification: 2010_11_22-PM-10_10_13

Home Index