Nuprl Lemma : es-cut-locl-closed
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:sys-antecedent(es;X)]. ∀[c:Cut(X;f)]. ∀[a,e:E(X)].
(e ∈ c) supposing ((e <loc a) and a ∈ c)
Proof
Definitions occuring in Statement :
es-cut: Cut(X;f),
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-locl: (e <loc e'),
es-eq: es-eq(es),
fset-member: a ∈ s,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type
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},
es-cut: Cut(X;f),
es-E-interface: E(X),
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,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
cand: A c∧ B,
sq_type: SQType(T),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
es-locl: (e <loc e'),
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q)
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[c:Cut(X;f)].
\mforall{}[a,e:E(X)].
(e \mmember{} c) supposing ((e <loc a) and a \mmember{} c)
Date html generated:
2016_05_17-AM-07_28_25
Last ObjectModification:
2016_01_17-PM-02_56_47
Theory : event-ordering
Home
Index