{ 
[Info,Ta,Tb:Type]. [A:EClass(Ta)]. [B:EClass(Tb)]. [R:Ta 
Tb 
].
(es-interface-match(A;B;R) 
EClass(Ta 
Tb)) }
{ Proof }
Definitions occuring in Statement :
es-interface-match: es-interface-match(A;B;R),
eclass: EClass(A[eo; e]),
bool: ,
uall: [x:A]. B[x],
member: t T,
function: x:A B[x],
product: x:A B[x],
universe: Type
Definitions :
void: Void,
inr: inr x ,
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,
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),
so_apply: x[s],
implies: P Q,
guard: {T},
inl: inl x ,
strong-subtype: strong-subtype(A;B),
le: A B,
ge: i 
j ,
less_than: a < b,
uiff: uiff(P;Q),
empty-bag: {},
single-bag: {x},
prop: 
,
l_member: (x l),
fpf: a:A fp-> B[a],
pair: <a, b>,
quotient: x,y:A//B[x; y],
uimplies: b supposing a,
l_all: (xL.P[x]),
squash: 
T,
not: A,
assert: 
b,
select: l[i],
and: P Q,
length: ||as||,
int_seg: {i..j
},
exists: x:A. B[x],
sq_exists: x:{A| B[x]},
union: left + right,
or: P Q,
bag-only: only(bs),
find-first: find-first(P;L),
decide: case b of inl(x) => s[x] | inr(y) => t[y],
natural_number: $n,
set: {x:A| B[x]} ,
real: 
,
grp_car: |g|,
int: 
,
nat: 
,
bag-size: bag-size(bs),
eq_int: (i =
j),
list: type List,
es-interface-unmatched: es-interface-unmatched(A; B; R),
primed-class: Prior(X),
eclass-compose2: eclass-compose2(f;X;Y),
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],
bag: bag(T),
axiom: Ax,
es-interface-match: es-interface-match(A;B;R),
product: x:A B[x],
bool: ,
equal: s = t,
universe: Type,
so_lambda: 
x y.t[x; y],
eclass: EClass(A[eo; e]),
uall: [x:A]. B[x],
isect: 
x:A. B[x],
member: t T,
function: x:A B[x]
Lemmas :
event-ordering+_wf,
event-ordering+_inc,
subtype_rel_self,
es-base-E_wf,
es-E_wf,
eclass_wf,
bool_wf,
es-interface-unmatched_wf,
primed-class_wf,
eclass-compose2_wf,
bag_wf,
ifthenelse_wf,
eq_int_wf,
bag-size_wf,
nat_wf,
bag-only_wf,
find-first_wf,
l_member_wf,
single-bag_wf,
empty-bag_wf,
assert_wf,
not_wf,
int_seg_wf,
member_wf,
es-interface-top,
permutation_wf,
uiff_transitivity,
eqtt_to_assert,
assert_of_eq_int,
eqff_to_assert,
assert_of_bnot,
not_functionality_wrt_uiff,
bnot_wf
\mforall{}[Info,Ta,Tb:Type]. \mforall{}[A:EClass(Ta)]. \mforall{}[B:EClass(Tb)]. \mforall{}[R:Ta {}\mrightarrow{} Tb {}\mrightarrow{} \mBbbB{}].
(es-interface-match(A;B;R) \mmember{} EClass(Ta \mtimes{} Tb))
Date html generated:
2011_08_16-PM-05_13_32
Last ObjectModification:
2011_06_20-AM-01_14_23
Home
Index