Nuprl Lemma : cut-subset-cut
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:sys-antecedent(es;X)]. ∀[s,s':fset(E(X))].
cut(X;f;s) ⊆ cut(X;f;s') supposing s ⊆ cut(X;f;s')
Proof
Definitions occuring in Statement :
cut-of: cut(X;f;s),
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-eq: es-eq(es),
f-subset: xs ⊆ ys,
fset: fset(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type
Definitions unfolded in proof :
so_apply: x[s1;s2],
so_lambda: λ2x y.t[x; y],
prop: ℙ,
implies: P ⇒ Q,
es-cut: Cut(X;f),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
f-subset: xs ⊆ ys,
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
uall: ∀[x:A]. B[x]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[s,s':fset(E(X))].
cut(X;f;s) \msubseteq{} cut(X;f;s') supposing s \msubseteq{} cut(X;f;s')
Date html generated:
2016_05_17-AM-07_32_41
Last ObjectModification:
2015_12_28-PM-11_44_21
Theory : event-ordering
Home
Index