Nuprl Lemma : es-init-le

es:EO. ∀e:E.  (es-init(es;e) ≤loc e  ⇐⇒ True)


Proof




Definitions occuring in Statement :  es-init: es-init(es;e) es-le: e ≤loc e'  es-E: E event_ordering: EO all: x:A. B[x] iff: ⇐⇒ Q true: True
Definitions unfolded in proof :  member: t ∈ T uall: [x:A]. B[x] es-init: es-init(es;e) final-iterate: final-iterate(f;x) do-apply: do-apply(f;x) can-apply: can-apply(f;x) 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 isl: isl(x) outl: outl(x) iff: ⇐⇒ Q true: True prop: rev_implies:  Q exists: x:A. B[x] or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False so_lambda: λ2x.t[x] so_apply: x[s] wellfounded: WellFnd{i}(A;x,y.R[x; y])

Latex:
\mforall{}es:EO.  \mforall{}e:E.    (es-init(es;e)  \mleq{}loc  e    \mLeftarrow{}{}\mRightarrow{}  True)



Date html generated: 2016_05_16-AM-09_39_24
Last ObjectModification: 2015_12_28-PM-09_43_12

Theory : new!event-ordering


Home Index