Nuprl Lemma : eo-forward-forward
∀[Info:Type]. ∀[eo:EO+(Info)]. ∀[e1,e2:E]. eo.e1.e2 = eo.e2 ∈ EO+(Info) supposing e1 ≤loc e2
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-E: E,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ,
subtype_rel: A ⊆r B,
es-dom: es-dom(es),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
es-E: E,
es-base-E: es-base-E(es),
bfalse: ff,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
bor: p ∨bq,
not: ¬A,
false: False,
guard: {T},
assert: ↑b,
sq_type: SQType(T),
top: Top,
record-select: r.x,
eo-forward: eo.e,
eo-restrict: eo-restrict(eo;P),
record-update: r[x := v],
eq_atom: x =a y,
bnot: ¬bb,
exists: ∃x:A. B[x],
or: P ∨ Q,
label: ...$L... t,
eo-reset-dom: eo-reset-dom(es;d)
Latex:
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e1,e2:E]. eo.e1.e2 = eo.e2 supposing e1 \mleq{}loc e2
Date html generated:
2016_05_16-PM-01_10_09
Last ObjectModification:
2015_12_29-PM-02_03_01
Theory : event-ordering
Home
Index