Nuprl Lemma : eo-strict-forward-pred
∀[Info:Type]. ∀[eo:EO+(Info)]. ∀[e:E]. ∀[e':E]. pred(e') = pred(e') ∈ E supposing ¬↑first(e')
Proof
Definitions occuring in Statement :
eo-strict-forward: eo>e,
event-ordering+: EO+(Info),
es-first: first(e),
es-pred: pred(e),
es-E: E,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
guard: {T},
prop: ℙ,
top: Top,
not: ¬A,
implies: P ⇒ Q,
and: P ∧ Q,
uiff: uiff(P;Q),
cand: A c∧ B,
es-locl: (e <loc e'),
or: P ∨ Q,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
false: False
Latex:
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e:E]. \mforall{}[e':E]. pred(e') = pred(e') supposing \mneg{}\muparrow{}first(e')
Date html generated:
2016_05_16-PM-01_17_03
Last ObjectModification:
2015_12_29-PM-01_58_26
Theory : event-ordering
Home
Index