Nuprl Lemma : eo-forward-interval
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[e1,e2,e:E]. ([e1, e2] = [e1, e2] ∈ (E List)) supposing (e1 ≤loc e2 and e ≤loc e1 )
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-interval: [e, e'],
es-le: e ≤loc e' ,
es-E: E,
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
es-interval: [e, e'],
top: Top,
member: t ∈ T,
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
prop: ℙ,
squash: ↓T,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
iff: P ⇐⇒ Q,
ifthenelse: if b then t else f fi ,
guard: {T},
rev_implies: P ⇐ Q,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
true: True
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e1,e2,e:E].
([e1, e2] = [e1, e2]) supposing (e1 \mleq{}loc e2 and e \mleq{}loc e1 )
Date html generated:
2016_05_16-PM-01_12_12
Last ObjectModification:
2016_01_17-PM-07_58_50
Theory : event-ordering
Home
Index