{ 
[Info,T:Type]. [X:EClass(T)]. [g:
es:EO+(Info). (E(X) 
Id)]. [i:Id].
[es:EO+(Info)]. [e:E].
(X|g=i)(e) ~ X(e) supposing 
e 
(X|g=i) }
{ Proof }
Definitions occuring in Statement :
es-interface-part: (X|g=i),
es-E-interface: E(X),
eclass-val: X(e),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
Id: Id,
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
isect: x:A. B[x],
function: x:A B[x],
universe: Type,
sqequal: s ~ t
Definitions :
implies: P 
Q,
filter: filter(P;l),
nil: [],
qabs: |r|,
append: as @ bs,
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
sq_type: SQType(T),
eclass-val: X(e),
sqequal: s ~ t,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
es-interface-part: (X|g=i),
in-eclass: e X,
set: {x:A| B[x]} ,
prop: 
,
assert: b,
uimplies: b supposing a,
atom: Atom$n,
bag: bag(T),
es-E-interface: E(X),
Id: Id,
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],
isect: x:A. B[x],
function: x:A B[x],
all: x:A. B[x],
uall: [x:A]. B[x],
eclass: EClass(A[eo; e]),
so_lambda: 
x y.t[x; y],
member: t T,
equal: s = t,
universe: Type,
tactic: Error :tactic,
quotient: x,y:A//B[x; y],
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,
bnot: b,
int: 
,
unit: Unit,
union: left + right,
bool: 
,
let: let,
fpf: a:A fp-> B[a],
RepeatFor: Error :RepeatFor,
CollapseTHEN: Error :CollapseTHEN,
RepUR: Error :RepUR,
D: Error :D,
Auto: Error :Auto,
MaAuto: Error :MaAuto,
CollapseTHENA: Error :CollapseTHENA,
Complete: Error :Complete,
Repeat: Error :Repeat
Lemmas :
is-interface-part,
subtype_rel_wf,
bool_wf,
eqtt_to_assert,
not_wf,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
bnot_wf,
bag_wf,
ifthenelse_wf,
bag-only_wf,
assert-eq-id,
not_functionality_wrt_uiff,
eq_id_wf,
es-E-interface_wf,
Id_wf,
event-ordering+_wf,
es-E_wf,
es-base-E_wf,
subtype_rel_self,
event-ordering+_inc,
assert_wf,
in-eclass_wf,
top_wf,
member_wf,
es-interface-top,
eclass-val_wf,
es-interface-part_wf,
eclass_wf,
subtype_base_sq
\mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[g:\mcap{}es:EO+(Info). (E(X) {}\mrightarrow{} Id)]. \mforall{}[i:Id]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E].
(X|g=i)(e) \msim{} X(e) supposing \muparrow{}e \mmember{}\msubb{} (X|g=i)
Date html generated:
2011_08_16-PM-06_04_04
Last ObjectModification:
2011_06_20-AM-01_46_58
Home
Index