Nuprl Lemma : eo-strict-forward-before
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[e,b:E]. before(e) = (b, e) ∈ (E List) supposing (b <loc e)
Proof
Definitions occuring in Statement :
eo-strict-forward: eo>e,
event-ordering+: EO+(Info),
es-open-interval: (e, e'),
es-before: before(e),
es-locl: (e <loc e'),
es-E: E,
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
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),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
es-locl: (e <loc e'),
deq: EqDecider(T),
cand: A c∧ B,
rev_uimplies: rev_uimplies(P;Q),
es-eq-E: e = e',
es-open-interval: (e, e'),
es-le-before: ≤loc(e),
so_apply: x[s],
so_lambda: λ2x.t[x],
es-E: E,
es-base-E: es-base-E(es)
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e,b:E]. before(e) = (b, e) supposing (b <loc e)
Date html generated:
2016_05_16-PM-01_18_23
Last ObjectModification:
2016_01_17-PM-08_01_17
Theory : event-ordering
Home
Index