{ 
[Info,T,A,B:Type]. [f:A 
bag(T)]. [g:B bag(T)]. [X:EClass(A)].
[Y:EClass(B)].
f[X] = g[Y]
supposing es:EO+(Info). e:E.
((
e 
X 
e Y)
((e X) (e Y) ((f X(e)) = (g Y(e))))) }
{ Proof }
Definitions occuring in Statement :
es-filter-image: f[X],
eclass-val: X(e),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
all: x:A. B[x],
iff: P Q,
implies: P Q,
and: P Q,
apply: f a,
function: x:A B[x],
universe: Type,
equal: s = t,
bag: bag(T)
Definitions :
cand: A c B,
atom: Atom,
es-base-E: es-base-E(es),
token: "$token",
bool: 
,
Knd: Knd,
IdLnk: IdLnk,
Id: Id,
rationals: 
,
sq_stable: SqStable(P),
so_apply: x[s],
union: left + right,
or: P 
Q,
guard: {T},
eq_knd: a = b,
list: type List,
l_member: (x l),
fpf-dom: x dom(f),
so_lambda: 
x.t[x],
record-select: r.x,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
set: {x:A| B[x]} ,
dep-isect: Error :dep-isect,
record+: record+,
lambda: x.A[x],
es-E-interface: E(X),
eclass-val: X(e),
apply: f a,
limited-type: LimitedType,
in-eclass: e X,
subtype: S 
T,
top: Top,
pair: <a, b>,
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
rev_implies: P Q,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
ifthenelse: if b then t else f fi ,
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uiff: uiff(P;Q),
subtype_rel: A r B,
axiom: Ax,
es-filter-image: f[X],
prop: 
,
event-ordering+: EO+(Info),
event_ordering: EO,
es-E: E,
iff: P Q,
assert: b,
implies: P Q,
product: x:A 
B[x],
and: P Q,
all: x:A. B[x],
so_lambda: x y.t[x; y],
eclass: EClass(A[eo; e]),
uimplies: b supposing a,
equal: s = t,
universe: Type,
uall: [x:A]. B[x],
member: t T,
function: x:A B[x],
bag: bag(T),
isect: 
x:A. B[x],
Unfold: Error :Unfold,
MaAuto: Error :MaAuto,
CollapseTHEN: Error :CollapseTHEN,
Auto: Error :Auto,
Try: Error :Try,
RepeatFor: Error :RepeatFor,
void: Void,
empty-bag: {},
false: False,
bfalse: ff,
btrue: tt,
eq_bool: p =b q,
lt_int: i <z j,
le_int: i z j,
eq_int: (i =
j),
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,
int: 
,
eclass-compose1: f o X,
unit: Unit,
true: True
Lemmas :
false_wf,
true_wf,
bool_wf,
assert_of_bnot,
eqff_to_assert,
uiff_transitivity,
not_wf,
eqtt_to_assert,
bnot_wf,
ifthenelse_wf,
empty-bag_wf,
eclass_wf,
event-ordering+_wf,
es-E_wf,
iff_wf,
assert_wf,
bag_wf,
es-filter-image_wf,
event-ordering+_inc,
in-eclass_wf,
eclass-val_wf,
member_wf,
subtype_rel_wf,
es-interface-top,
uall_wf,
es-base-E_wf,
subtype_rel_self
\mforall{}[Info,T,A,B:Type]. \mforall{}[f:A {}\mrightarrow{} bag(T)]. \mforall{}[g:B {}\mrightarrow{} bag(T)]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)].
f[X] = g[Y]
supposing \mforall{}es:EO+(Info). \mforall{}e:E.
((\muparrow{}e \mmember{}\msubb{} X \mLeftarrow{}{}\mRightarrow{} \muparrow{}e \mmember{}\msubb{} Y) \mwedge{} ((\muparrow{}e \mmember{}\msubb{} X) {}\mRightarrow{} (\muparrow{}e \mmember{}\msubb{} Y) {}\mRightarrow{} ((f X(e)) = (g Y(e)))))
Date html generated:
2011_08_16-PM-04_15_55
Last ObjectModification:
2011_06_20-AM-00_44_56
Home
Index