{ 
[Info:Type]. [es:EO+(Info)]. [A,B:Type]. [X:EClass(A)]. [Y:EClass(B)].
[e:E].
X;Y(e) ~ <(X)'(e), Y(e)> supposing 
e 
X;Y }
{ Proof }
Definitions occuring in Statement :
es-interface-pair-prior: X;Y,
es-prior-val: (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],
pair: <a, b>,
universe: Type,
sqequal: s ~ t
Definitions :
implies: P 
Q,
filter: filter(P;l),
pair: <a, b>,
nil: [],
qabs: |r|,
append: as @ bs,
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),
so_lambda: 
x.t[x],
sq_type: SQType(T),
eclass-val: X(e),
sqequal: s ~ t,
void: Void,
es-E-interface: E(X),
quotient: x,y:A//B[x; y],
decide: case b of inl(x) => s[x] | inr(y) => t[y],
product: x:A 
B[x],
es-interface-pair-prior: X;Y,
in-eclass: e X,
set: {x:A| B[x]} ,
prop: 
,
assert: b,
uimplies: b supposing a,
bag: bag(T),
subtype: S 
T,
subtype_rel: A r B,
atom: Atom,
apply: f a,
top: Top,
es-base-E: es-base-E(es),
token: "$token",
ifthenelse: if b then t else f fi ,
record-select: r.x,
event_ordering: EO,
es-E: E,
lambda: x.A[x],
so_lambda: x y.t[x; y],
eclass: EClass(A[eo; e]),
dep-isect: Error :dep-isect,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record+: record+,
all: x:A. B[x],
function: x:A 
B[x],
isect: 
x:A. B[x],
uall: [x:A]. B[x],
universe: Type,
member: t T,
event-ordering+: EO+(Info),
equal: s = t,
tactic: Error :tactic,
bag_only_single: bag_only_single{bag_only_single_compseq_tag_def:o}(x),
single-bag: {x},
empty-bag: {},
bag-only: only(bs),
false: False,
limited-type: LimitedType,
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,
es-prior-val: (X)',
bnot: b,
int: 
,
unit: Unit,
bool: 
,
cond-class: [X?Y],
so_apply: x[s],
union: left + right,
or: P Q,
guard: {T},
eq_knd: a = b,
l_member: (x l),
fpf-dom: x dom(f),
fpf: a:A fp-> B[a],
RepeatFor: Error :RepeatFor,
CollapseTHEN: Error :CollapseTHEN,
MaAuto: Error :MaAuto,
CollapseTHENA: Error :CollapseTHENA
Lemmas :
is-pair-prior,
bool_wf,
eqtt_to_assert,
not_wf,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
bnot_wf,
es-prior-val_wf,
single-bag_wf,
bag_wf,
ifthenelse_wf,
bag-only_wf,
assert_wf,
in-eclass_wf,
eclass_wf,
member_wf,
es-interface-top,
es-interface-subtype_rel2,
subtype_rel_wf,
top_wf,
es-E_wf,
es-base-E_wf,
subtype_rel_self,
event-ordering+_inc,
event-ordering+_wf,
es-interface-pair-prior_wf,
eclass-val_wf,
subtype_base_sq,
product_subtype_base
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[A,B:Type]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)]. \mforall{}[e:E].
X;Y(e) \msim{} <(X)'(e), Y(e)> supposing \muparrow{}e \mmember{}\msubb{} X;Y
Date html generated:
2011_08_16-PM-05_38_58
Last ObjectModification:
2011_06_20-AM-01_29_14
Home
Index