Nuprl Lemma : es-before_wf2
∀[the_es:EO]. ∀[e:E]. (before(e) ∈ {e':E| loc(e') = loc(e) ∈ Id} List)
Proof
Definitions occuring in Statement :
es-before: before(e),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
subtype_rel: A ⊆r B,
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
es-before: before(e),
es-E: E,
es-base-E: es-base-E(es),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[the$_{es}$:EO]. \mforall{}[e:E]. (before(e) \mmember{} \{e':E| loc(e') = loc(e)\} List)
Date html generated:
2016_05_16-AM-09_29_54
Last ObjectModification:
2016_01_17-PM-01_30_53
Theory : new!event-ordering
Home
Index