Nuprl Lemma : es-le-before-pred
∀[es:EO]. ∀[e:E]. ≤loc(pred(e)) ~ before(e) supposing ¬↑first(e)
Proof
Definitions occuring in Statement :
es-le-before: ≤loc(e),
es-before: before(e),
es-first: first(e),
es-pred: pred(e),
es-E: E,
event_ordering: EO,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-before: before(e),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
not: ¬A,
false: False,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
es-le-before: ≤loc(e)
Latex:
\mforall{}[es:EO]. \mforall{}[e:E]. \mleq{}loc(pred(e)) \msim{} before(e) supposing \mneg{}\muparrow{}first(e)
Date html generated:
2016_05_16-AM-09_30_56
Last ObjectModification:
2015_12_28-PM-09_49_05
Theory : new!event-ordering
Home
Index