{ 
[Info:Type]. [es:EO+(Info)]. [f:Top]. [X:EClass(Top)]. [e:E].
(f[v] where v from X)(e) ~ f[X(e)] supposing 
e 
(f[v] where v from X) }
{ Proof }
Definitions occuring in Statement :
map-class: (f[v] where v from 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],
top: Top,
so_apply: x[s],
universe: Type,
sqequal: s ~ t
Definitions :
empty-bag: {},
bag: bag(T),
bag-only: only(bs),
true: True,
bag_size_empty: bag_size_empty{bag_size_empty_compseq_tag_def:o},
bag_only_single: bag_only_single{bag_only_single_compseq_tag_def:o}(x),
bag_size_single: bag_size_single{bag_size_single_compseq_tag_def:o}(x),
false: False,
lt_int: i <z j,
le_int: i 
z j,
bfalse: ff,
set: {x:A| B[x]} ,
real: 
,
grp_car: |g|,
nat: 
,
limited-type: LimitedType,
btrue: tt,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
eq_atom: x =a y,
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'),
not: 
A,
eq_atom: eq_atom$n(x;y),
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,
natural_number: $n,
bag-size: bag-size(bs),
eq_int: (i =
j),
bnot: b,
int: 
,
unit: Unit,
union: left + right,
bool: 
,
eclass-val: X(e),
eclass-compose1: f o X,
es-filter-image: f[X],
implies: P Q,
subtype: S 
T,
void: Void,
lambda: 
x.A[x],
apply: f a,
so_apply: x[s],
so_lambda: 
x.t[x],
map-class: (f[v] where v from X),
function: x:A 
B[x],
all: x:A. B[x],
in-eclass: e X,
equal: s = t,
prop: 
,
universe: Type,
sqequal: s ~ t,
top: Top,
so_lambda: x y.t[x; y],
eclass: EClass(A[eo; e]),
uall: [x:A]. B[x],
event-ordering+: EO+(Info),
event_ordering: EO,
es-E: E,
uimplies: b supposing a,
isect: 
x:A. B[x],
member: t T,
assert: b,
RepUR: Error :RepUR,
CollapseTHEN: Error :CollapseTHEN,
Unfold: Error :Unfold,
Auto: Error :Auto,
CollapseTHENA: Error :CollapseTHENA,
tactic: Error :tactic
Lemmas :
true_wf,
bool_wf,
nat_wf,
bag-size_wf,
top_wf,
eq_int_wf,
assert_wf,
not_wf,
bnot_wf,
assert_of_eq_int,
not_functionality_wrt_uiff,
assert_of_bnot,
uiff_transitivity,
eqff_to_assert,
eqtt_to_assert,
event-ordering+_wf,
event-ordering+_inc,
es-E_wf,
eclass_wf,
map-class_wf,
in-eclass_wf,
false_wf
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[f:Top]. \mforall{}[X:EClass(Top)]. \mforall{}[e:E].
(f[v] where v from X)(e) \msim{} f[X(e)] supposing \muparrow{}e \mmember{}\msubb{} (f[v] where v from X)
Date html generated:
2011_08_16-PM-04_15_23
Last ObjectModification:
2011_06_20-AM-00_44_42
Home
Index