Nuprl Lemma : es-interface-predecessors-no_repeats2
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e:E]. no_repeats({a:E(X)| loc(a) = loc(e) ∈ Id} ;≤(X)(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-loc: loc(e),
es-E: E,
Id: Id,
no_repeats: no_repeats(T;l),
uall: ∀[x:A]. B[x],
top: Top,
set: {x:A| B[x]} ,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
no_repeats: no_repeats(T;l),
uimplies: b supposing a,
not: ¬A,
implies: P ⇒ Q,
false: False,
subtype_rel: A ⊆r B,
es-E-interface: E(X),
nat: ℕ,
ge: i ≥ j ,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
and: P ∧ Q,
prop: ℙ,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
guard: {T}
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[e:E]. no\_repeats(\{a:E(X)| loc(a) = loc(e)\} ;\mleq{}(X)\000C(e))
Date html generated:
2016_05_17-AM-06_59_02
Last ObjectModification:
2016_01_17-PM-06_34_06
Theory : event-ordering
Home
Index