{ [Info,A,B:Type]. [f:A  bag(B)]. [X:EClass(A)].  (f[X]  EClass(B)) }

{ Proof }



Definitions occuring in Statement :  es-filter-image: f[X] eclass: EClass(A[eo; e]) uall: [x:A]. B[x] member: t  T function: x:A  B[x] universe: Type bag: bag(T)
Definitions :  void: Void IdLnk: IdLnk Id: Id rationals: append: as @ bs locl: locl(a) Knd: Knd false: False lt_int: i <z j le_int: i z j limited-type: LimitedType bfalse: ff btrue: tt prop: null: null(as) set_blt: a < b grp_blt: a < b infix_ap: x f y dcdr-to-bool: [d] bl-all: (xL.P[x])_b bl-exists: (xL.P[x])_b b-exists: (i<n.P[i])_b eq_type: eq_type(T;T') qeq: qeq(r;s) q_less: q_less(r;s) q_le: q_le(r;s) deq-member: deq-member(eq;x;L) deq-disjoint: deq-disjoint(eq;as;bs) deq-all-disjoint: deq-all-disjoint(eq;ass;bs) eq_id: a = b eq_lnk: a = b es-eq-E: e = e' es-bless: e <loc e' es-ble: e loc e' bimplies: p  q band: p  q bor: p q bnot: b unit: Unit permutation: permutation(T;L1;L2) list: type List so_apply: x[s] implies: P  Q union: left + right or: P  Q guard: {T} l_member: (x  l) assert: b strong-subtype: strong-subtype(A;B) le: A  B ge: i  j  not: A less_than: a < b and: P  Q uiff: uiff(P;Q) empty-bag: {} fpf: a:A fp-B[a] product: x:A  B[x] pair: <a, b> quotient: x,y:A//B[x; y] uimplies: b supposing a bag-only: only(bs) natural_number: $n set: {x:A| B[x]}  real: grp_car: |g| int: nat: bag-size: bag-size(bs) eq_int: (i = j) eclass-compose1: f o X bool: subtype: S  T subtype_rel: A r B eq_atom: eq_atom$n(x;y) atom: Atom apply: f a top: Top es-base-E: es-base-E(es) token: "$token" eq_atom: x =a y ifthenelse: if b then t else f fi  record-select: r.x dep-isect: Error :dep-isect,  record+: record+ event_ordering: EO es-E: E event-ordering+: EO+(Info) lambda: x.A[x] all: x:A. B[x] axiom: Ax es-filter-image: f[X] universe: Type bag: bag(T) function: x:A  B[x] uall: [x:A]. B[x] so_lambda: x y.t[x; y] eclass: EClass(A[eo; e]) isect: x:A. B[x] member: t  T equal: s = t tactic: Error :tactic
Lemmas :  bag_wf bag-size_wf empty-bag_wf bag-only_wf nat_wf eq_int_wf ifthenelse_wf eclass-compose1_wf event-ordering+_wf event-ordering+_inc subtype_rel_self es-base-E_wf es-E_wf eclass_wf member_wf subtype_rel_wf es-interface-top permutation_wf bool_wf uiff_transitivity eqtt_to_assert assert_of_eq_int assert_wf not_wf eqff_to_assert assert_of_bnot not_functionality_wrt_uiff bnot_wf

\mforall{}[Info,A,B:Type].  \mforall{}[f:A  {}\mrightarrow{}  bag(B)].  \mforall{}[X:EClass(A)].    (f[X]  \mmember{}  EClass(B))


Date html generated: 2011_08_16-AM-11_40_24
Last ObjectModification: 2011_06_20-AM-00_31_42

Home Index