Nuprl Lemma : equal-eo-strict-forward-E
∀[Info:Type]. ∀[eo:EO+(Info)]. ∀[e:E]. ∀[e1,e2:E]. uiff(e1 = e2 ∈ E;e1 = e2 ∈ E)
Proof
Definitions occuring in Statement :
eo-strict-forward: eo>e,
event-ordering+: EO+(Info),
es-E: E,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
universe: Type,
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,
subtype_rel: A ⊆r B,
guard: {T},
implies: P ⇒ Q,
prop: ℙ,
all: ∀x:A. B[x]
Latex:
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e:E]. \mforall{}[e1,e2:E]. uiff(e1 = e2;e1 = e2)
Date html generated:
2016_05_16-PM-01_15_41
Last ObjectModification:
2015_12_29-PM-01_56_20
Theory : event-ordering
Home
Index