Nuprl Lemma : es-interface-predecessors-loc
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e:E]. (∀a∈≤(X)(e).loc(a) = loc(e) ∈ Id)
Proof
Definitions occuring in Statement :
es-interface-predecessors: ≤(X)(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
es-E: E,
Id: Id,
l_all: (∀x∈L.P[x]),
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,
all: ∀x:A. B[x],
l_all: (∀x∈L.P[x]),
subtype_rel: A ⊆r B,
es-E-interface: E(X),
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
and: P ∧ Q,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ,
less_than: a < b,
squash: ↓T,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[e:E]. (\mforall{}a\mmember{}\mleq{}(X)(e).loc(a) = loc(e))
Date html generated:
2016_05_17-AM-06_52_38
Last ObjectModification:
2016_01_17-PM-06_33_07
Theory : event-ordering
Home
Index