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
Lemmas :
equal_wf,
list_wf,
es-E-interface_wf,
es-interface-predecessors_wf,
subtype_rel_list,
Id_wf,
es-loc_wf,
event-ordering+_subtype,
es-interface-predecessors-iseg,
iseg_weakening2,
es-causle_antisymmetry,
es-causle_weakening_locl
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:
2015_07_21-PM-03_35_18
Last ObjectModification:
2015_01_27-PM-06_33_21
Home
Index