Nuprl Lemma : es-init_wf

[es:EO]. ∀[e:E].  (es-init(es;e) ∈ E)


Proof




Definitions occuring in Statement :  es-init: es-init(es;e) es-E: E event_ordering: EO uall: [x:A]. B[x] member: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T es-init: es-init(es;e) bfalse: ff all: x:A. B[x] implies:  Q exposed-bfalse: exposed-bfalse bool: 𝔹 unit: Unit it: btrue: tt ifthenelse: if then else fi  uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a top: Top exists: x:A. B[x] prop: or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False so_lambda: λ2x.t[x] so_apply: x[s1;s2] so_lambda: λ2y.t[x; y] p-graph: p-graph(A;f) cand: c∧ B rel_implies: R1 => R2 infix_ap: y do-apply: do-apply(f;x) can-apply: can-apply(f;x) isl: isl(x) outl: outl(x)

Latex:
\mforall{}[es:EO].  \mforall{}[e:E].    (es-init(es;e)  \mmember{}  E)



Date html generated: 2016_05_16-AM-09_39_17
Last ObjectModification: 2015_12_28-PM-09_44_19

Theory : new!event-ordering


Home Index