Nuprl Lemma : es-interface-predecessors-one-one
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e,e':E(X)]. uiff(≤(X)(e') = ≤(X)(e) ∈ (E(X) List);e' = e ∈ E)
Proof
Definitions occuring in Statement :
es-interface-predecessors: ≤(X)(e),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
list: T List,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
top: Top,
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,
prop: ℙ,
es-E-interface: E(X),
subtype_rel: A ⊆r B,
squash: ↓T,
true: True,
all: ∀x:A. B[x],
cand: A c∧ B,
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
guard: {T}
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[e,e':E(X)]. uiff(\mleq{}(X)(e') = \mleq{}(X)(e);e' = e)
Date html generated:
2016_05_17-AM-06_57_25
Last ObjectModification:
2016_01_17-PM-06_33_27
Theory : event-ordering
Home
Index