{ 
[Info,A,B:Type]. [X:EClass(A + B)].
(right(X) = 
x.case x of inl(a) => {} | inr(b) => {b}[X]) }
{ Proof }
Definitions occuring in Statement :
es-interface-right: right(X),
es-filter-image: f[X],
eclass: EClass(A[eo; e]),
uall: [x:A]. B[x],
lambda: x.A[x],
decide: case b of inl(x) => s[x] | inr(y) => t[y],
union: left + right,
universe: Type,
equal: s = t,
single-bag: {x},
empty-bag: {}
Definitions :
eclass-val: X(e),
so_lambda: 
x.t[x],
bag-separate: bag-separate(bs),
pi2: snd(t),
bag: bag(T),
record-select: r.x,
set: {x:A| B[x]} ,
dep-isect: Error :dep-isect,
record+: record+,
false: False,
limited-type: LimitedType,
prop: 
,
bfalse: ff,
btrue: tt,
ifthenelse: if b then t else f fi ,
eq_bool: p =b q,
lt_int: i <z j,
le_int: i 
z j,
eq_int: (i =
j),
eq_atom: x =a y,
null: null(as),
set_blt: a <
b,
grp_blt: a < b,
apply: f a,
infix_ap: x f y,
dcdr-to-bool: [d],
bl-all: (x
L.P[x])_b,
bl-exists: (
xL.P[x])_b,
b-exists: (i<n.P[i])_b,
eq_type: eq_type(T;T'),
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,
in-eclass: e X,
assert: 
b,
bnot: 
b,
int: 
,
unit: Unit,
implies: P Q,
bool: 
,
eclass-compose1: f o X,
subtype: S 
T,
event_ordering: EO,
es-E: E,
event-ordering+: EO+(Info),
top: Top,
union: left + right,
pair: <a, b>,
fpf: a:A fp-> B[a],
strong-subtype: strong-subtype(A;B),
le: A B,
ge: i 
j ,
not: A,
less_than: a < b,
uimplies: b supposing a,
product: x:A 
B[x],
and: P Q,
uiff: uiff(P;Q),
subtype_rel: A r B,
function: x:A 
B[x],
all: x:A. B[x],
uall: [x:A]. B[x],
so_lambda: x y.t[x; y],
isect: 
x:A. B[x],
axiom: Ax,
es-interface-right: right(X),
es-filter-image: f[X],
lambda: x.A[x],
decide: case b of inl(x) => s[x] | inr(y) => t[y],
empty-bag: {},
single-bag: {x},
member: t T,
equal: s = t,
eclass: EClass(A[eo; e]),
universe: Type,
CollapseTHEN: Error :CollapseTHEN,
Auto: Error :Auto,
CollapseTHENA: Error :CollapseTHENA,
RepeatFor: Error :RepeatFor,
RepUR: Error :RepUR,
tactic: Error :tactic,
es-E-interface: E(X),
true: True,
squash: 
T,
so_apply: x[s],
iff: P 
Q,
rev_implies: P Q,
bag-map: bag-map(f;bs),
bag-filter: [xb|p[x]],
bag-mapfilter: bag-mapfilter(f;P;bs),
Try: Error :Try
Lemmas :
iff_wf,
rev_implies_wf,
squash_wf,
true_wf,
single-eclass-val,
es-interface-right_wf,
es-filter-image_wf,
event-ordering+_wf,
es-E_wf,
event-ordering+_inc,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
bnot_wf,
not_wf,
assert_wf,
in-eclass_wf,
member_wf,
eclass_wf,
subtype_rel_wf,
es-interface-top,
bool_wf,
bag-separate_wf,
bag_wf,
pi2_wf,
eclass-val_wf,
single-bag_wf,
empty-bag_wf
\mforall{}[Info,A,B:Type]. \mforall{}[X:EClass(A + B)]. (right(X) = \mlambda{}x.case x of inl(a) => \{\} | inr(b) => \{b\}[X])
Date html generated:
2011_08_16-PM-05_15_05
Last ObjectModification:
2011_06_20-AM-01_17_23
Home
Index