Nuprl Lemma : es-cut-closed-prior
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:sys-antecedent(es;X)]. ∀[c:Cut(X;f)]. ∀[a:E(X)].
(prior(X)(a) ∈ c) supposing ((↑a ∈b prior(X)) and a ∈ c)
Proof
Definitions occuring in Statement :
es-cut: Cut(X;f),
es-prior-interface: prior(X),
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-eq: es-eq(es),
fset-member: a ∈ s,
assert: ↑b,
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,
es-E-interface: E(X),
es-cut: Cut(X;f),
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
all: ∀x:A. B[x],
top: Top,
es-interface-pred: X-pred,
not: ¬A,
false: False,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
sq_stable: SqStable(P),
squash: ↓T,
fset-closed: (s closed under fs),
so_lambda: λ2x.t[x],
sys-antecedent: sys-antecedent(es;Sys),
so_apply: x[s],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
guard: {T},
or: 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(X)].
(prior(X)(a) \mmember{} c) supposing ((\muparrow{}a \mmember{}\msubb{} prior(X)) and a \mmember{} c)
Date html generated:
2016_05_17-AM-07_28_02
Last ObjectModification:
2016_01_17-PM-02_57_40
Theory : event-ordering
Home
Index