Nuprl Lemma : es-bless-not-ble
∀[es:EO]. ∀[e,e':E]. e <loc e' ~ ¬be' ≤loc e supposing loc(e) = loc(e') ∈ Id
Proof
Definitions occuring in Statement :
es-ble: e ≤loc e',
es-bless: e <loc e',
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
bnot: ¬bb,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
sqequal: s ~ t,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
not: ¬A,
false: False,
all: ∀x:A. B[x],
guard: {T},
prop: ℙ,
rev_implies: P ⇐ Q,
decidable: Dec(P),
or: P ∨ Q,
sq_type: SQType(T)
Latex:
\mforall{}[es:EO]. \mforall{}[e,e':E]. e <loc e' \msim{} \mneg{}\msubb{}e' \mleq{}loc e supposing loc(e) = loc(e')
Date html generated:
2016_05_16-AM-09_29_17
Last ObjectModification:
2015_12_28-PM-09_49_51
Theory : new!event-ordering
Home
Index