Nuprl Lemma : es-interface-predecessors-sorted-by-le

[Info:Type]. ∀es:EO+(Info). ∀X:EClass(Top). ∀e:E.  sorted-by(λx,y. x ≤loc ;≤(X)(e))


Proof




Definitions occuring in Statement :  es-interface-predecessors: (X)(e) eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-le: e ≤loc e'  es-E: E sorted-by: sorted-by(R;L) uall: [x:A]. B[x] top: Top all: x:A. B[x] lambda: λx.A[x] universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T all: x:A. B[x] subtype_rel: A ⊆B so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] sorted-by: sorted-by(R;L) es-le: e ≤loc e'  or: P ∨ Q es-locl: (e <loc e') and: P ∧ Q prop: int_seg: {i..j-} es-E-interface: E(X) guard: {T}

Latex:
\mforall{}[Info:Type].  \mforall{}es:EO+(Info).  \mforall{}X:EClass(Top).  \mforall{}e:E.    sorted-by(\mlambda{}x,y.  x  \mleq{}loc  y  ;\mleq{}(X)(e))



Date html generated: 2016_05_17-AM-06_58_17
Last ObjectModification: 2015_12_29-AM-00_16_01

Theory : event-ordering


Home Index