{ [Info,A:Type]. [X:EClass(A)].  (x.x'X = X) }

{ Proof }



Definitions occuring in Statement :  es-interface-image: f'Ia eclass: EClass(A[eo; e]) uall: [x:A]. B[x] lambda: x.A[x] universe: Type equal: s = t
Definitions :  record-select: r.x set: {x:A| B[x]}  decide: case b of inl(x) =s[x] | inr(y) =t[y] ifthenelse: if b then t else f fi  assert: b apply: f a bag-map: bag-map(f;bs) eq_atom: x =a y eq_atom: eq_atom$n(x;y) dep-isect: Error :dep-isect,  record+: record+ bag: bag(T) eclass-compose1: f o X subtype: S  T event_ordering: EO es-E: E event-ordering+: EO+(Info) top: Top pair: <a, b> fpf: a:A fp-B[a] strong-subtype: strong-subtype(A;B) le: A  B ge: i  j  not: A less_than: a < b uimplies: b supposing a product: x:A  B[x] and: P  Q uiff: uiff(P;Q) subtype_rel: A r B function: x:A  B[x] all: x:A. B[x] es-interface-image: f'Ia lambda: x.A[x] axiom: Ax universe: Type equal: s = t uall: [x:A]. B[x] so_lambda: x y.t[x; y] eclass: EClass(A[eo; e]) member: t  T isect: x:A. B[x] Auto: Error :Auto,  CollapseTHEN: Error :CollapseTHEN,  RepeatFor: Error :RepeatFor,  Unfold: Error :Unfold,  RepUR: Error :RepUR,  tactic: Error :tactic,  iff: P  Q implies: P  Q rev_implies: P  Q
Lemmas :  iff_wf rev_implies_wf bag-map-trivial es-interface-image_wf eclass_wf event-ordering+_wf event-ordering+_inc es-E_wf bag_wf bag-map_wf

\mforall{}[Info,A:Type].  \mforall{}[X:EClass(A)].    (\mlambda{}x.x'X  =  X)


Date html generated: 2011_08_16-PM-04_09_54
Last ObjectModification: 2011_06_20-AM-00_43_02

Home Index