Nuprl Lemma : last-es-hist
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[e1,e2:E]. last(es-hist(es;e1;e2)) ~ info(e2) supposing e1 ≤loc e2
Proof
Definitions occuring in Statement :
es-hist: es-hist(es;e1;e2),
es-info: info(e),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-E: E,
last: last(L),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
es-hist: es-hist(es;e1;e2),
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top,
prop: ℙ,
not: ¬A,
implies: P ⇒ Q,
all: ∀x:A. B[x],
guard: {T},
false: False,
iff: P ⇐⇒ Q,
and: P ∧ Q,
uiff: uiff(P;Q)
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e1,e2:E]. last(es-hist(es;e1;e2)) \msim{} info(e2) supposing e1 \mleq{}loc e2
Date html generated:
2016_05_16-PM-01_19_51
Last ObjectModification:
2015_12_29-PM-01_59_33
Theory : event-ordering
Home
Index