{ [Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:sys-antecedent(es;X)].
  [s:FSet{E(X)}].
    (cut(X;f;s)  Cut(X;f)) }

{ Proof }



Definitions occuring in Statement :  cut-of: cut(X;f;s) 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) uall: [x:A]. B[x] top: Top member: t  T universe: Type fset: FSet{s}
Definitions :  filter: filter(P;l) strong-subtype: strong-subtype(A;B) le: A  B ge: i  j  not: A less_than: a < b product: x:A  B[x] and: P  Q uiff: uiff(P;Q) fpf: a:A fp-B[a] uimplies: b supposing a set-equal: set-equal(T;x;y) list: type List fset-closed: (s closed under fs) quotient: x,y:A//B[x; y] axiom: Ax cut-of: cut(X;f;s) es-cut: Cut(X;f) set: {x:A| B[x]}  es-E-interface: E(X) fset: FSet{T} union: left + right sys-antecedent: sys-antecedent(es;Sys) subtype: S  T subtype_rel: A r B atom: Atom apply: f a es-base-E: es-base-E(es) token: "$token" ifthenelse: if b then t else f fi  record-select: r.x top: Top event_ordering: EO es-E: E lambda: x.A[x] dep-isect: Error :dep-isect,  eq_atom: x =a y eq_atom: eq_atom$n(x;y) record+: record+ all: x:A. B[x] function: x:A  B[x] isect: x:A. B[x] uall: [x:A]. B[x] eclass: EClass(A[eo; e]) so_lambda: x y.t[x; y] universe: Type member: t  T event-ordering+: EO+(Info) equal: s = t void: Void pi1: fst(t) es-eq: es-eq(es) limited-type: LimitedType implies: P  Q prop: f-subset: xs  ys so_lambda: x.t[x] exists: x:A. B[x] es-cut-exists
Lemmas :  f-subset_wf uall_wf es-eq_wf-interface es-cut-exists pi1_wf_top es-E-interface_wf member_wf fset_wf set-equal_wf fset-closed_wf es-cut_wf sys-antecedent_wf event-ordering+_wf event-ordering+_inc subtype_rel_self es-base-E_wf es-E_wf top_wf eclass_wf

\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[X:EClass(Top)].  \mforall{}[f:sys-antecedent(es;X)].  \mforall{}[s:FSet\{E(X)\}].
    (cut(X;f;s)  \mmember{}  Cut(X;f))


Date html generated: 2011_08_16-PM-05_49_14
Last ObjectModification: 2011_06_20-AM-01_35_25

Home Index