Nuprl Lemma : assert-es-bless
∀es:EO. ∀e,e':E. (↑e <loc e' ⇐⇒ (e <loc e'))
Proof
Definitions occuring in Statement :
es-bless: e <loc e',
es-locl: (e <loc e'),
es-E: E,
event_ordering: EO,
assert: ↑b,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
es-locl: (e <loc e'),
es-bless: e <loc e',
es-blocl: es-blocl(es;e1;e2),
member: t ∈ T,
uall: ∀[x:A]. B[x],
prop: ℙ,
and: P ∧ Q,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
uiff: uiff(P;Q),
uimplies: b supposing a,
decidable: Dec(P),
or: P ∨ Q,
not: ¬A,
false: False,
es-E: E,
es-base-E: es-base-E(es)
Latex:
\mforall{}es:EO. \mforall{}e,e':E. (\muparrow{}e <loc e' \mLeftarrow{}{}\mRightarrow{} (e <loc e'))
Date html generated:
2016_05_16-AM-09_28_24
Last ObjectModification:
2015_12_28-PM-09_51_11
Theory : new!event-ordering
Home
Index