{ [Info,A,B:Type]. [F:bag(A)  bag(B)  bag(B)]. [X:EClass(A)].
    (x,s.F[x;s]|X, Prior(self)|  EClass(B)) }

{ Proof }



Definitions occuring in Statement :  rec-combined-class1: x,s.F[x; s]|X, Prior(self)| eclass: EClass(A[eo; e]) uall: [x:A]. B[x] so_apply: x[s1;s2] member: t  T function: x:A  B[x] universe: Type bag: bag(T)
Definitions :  CollapseTHENA: Error :CollapseTHENA,  natural_number: $n lambda: x.A[x] Auto: Error :Auto,  BHyp: Error :BHyp,  CollapseTHEN: Error :CollapseTHEN,  member: t  T equal: s = t isect: x:A. B[x] eclass: EClass(A[eo; e]) so_lambda: x y.t[x; y] uall: [x:A]. B[x] function: x:A  B[x] bag: bag(T) universe: Type rec-combined-class1: x,s.F[x; s]|X, Prior(self)| so_apply: x[s1;s2] apply: f a axiom: Ax all: x:A. B[x] event-ordering+: EO+(Info) es-E: E event_ordering: EO record+: record+ dep-isect: Error :dep-isect,  record-select: r.x ifthenelse: if b then t else f fi  eq_atom: x =a y token: "$token" es-base-E: es-base-E(es) top: Top atom: Atom eq_atom: eq_atom$n(x;y) subtype_rel: A r B subtype: S  T bool: rec-combined-class: f|X,(self)'| nil: [] cons: [car / cdr] select: l[i] uimplies: b supposing a fpf: a:A fp-B[a] uiff: uiff(P;Q) and: P  Q product: x:A  B[x] less_than: a < b not: A ge: i  j  le: A  B strong-subtype: strong-subtype(A;B) int: nat: rationals: real: set: {x:A| B[x]}  false: False implies: P  Q void: Void prop: p-outcome: Outcome int_seg: {i..j} list: type List length: ||as|| label: ...$L... t lelt: i  j < k quotient: x,y:A//B[x; y]
Lemmas :  top_wf length_wf1 non_neg_length length_cons length_nil length_wf_nat select_wf int_seg_wf nat_wf false_wf not_wf le_wf rec-combined-class_wf es-E_wf es-base-E_wf subtype_rel_self event-ordering+_inc event-ordering+_wf bag_wf member_wf eclass_wf

\mforall{}[Info,A,B:Type].  \mforall{}[F:bag(A)  {}\mrightarrow{}  bag(B)  {}\mrightarrow{}  bag(B)].  \mforall{}[X:EClass(A)].
    (x,s.F[x;s]|X,  Prior(self)|  \mmember{}  EClass(B))


Date html generated: 2011_08_16-PM-04_58_08
Last ObjectModification: 2011_06_21-PM-02_05_05

Home Index