Nuprl Lemma : equal-eo-forward-E
∀[eo:EO]. ∀[e:E]. ∀[e1,e2:E]. uiff(e1 = e2 ∈ E;e1 = e2 ∈ E)
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
es-E: E,
event_ordering: EO,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
prop: ℙ,
subtype_rel: A ⊆r B,
es-E: E,
es-base-E: es-base-E(es),
es-dom: es-dom(es),
top: Top,
guard: {T},
implies: P ⇒ Q,
sq_type: SQType(T),
all: ∀x:A. B[x],
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True
Latex:
\mforall{}[eo:EO]. \mforall{}[e:E]. \mforall{}[e1,e2:E]. uiff(e1 = e2;e1 = e2)
Date html generated:
2016_05_16-PM-01_05_37
Last ObjectModification:
2015_12_29-PM-01_47_35
Theory : event-ordering
Home
Index