Nuprl Lemma : prior-val-first

[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e:E].  (X)' es {} supposing ↑first(e)


Proof




Definitions occuring in Statement :  es-prior-val: (X)' eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-first: first(e) es-E: E assert: b uimplies: supposing a uall: [x:A]. B[x] top: Top apply: a universe: Type sqequal: t empty-bag: {}
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T subtype_rel: A ⊆B all: x:A. B[x] implies:  Q bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a ifthenelse: if then else fi  bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False so_lambda: λ2y.t[x; y] so_apply: x[s1;s2]

Latex:
\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[X:EClass(Top)].  \mforall{}[e:E].    (X)'  es  e  \msim{}  \{\}  supposing  \muparrow{}first(e)



Date html generated: 2016_05_17-AM-06_33_47
Last ObjectModification: 2015_12_29-AM-00_32_58

Theory : event-ordering


Home Index