{ 
[A,B:Type]. EO+(A) 
r EO+(B) supposing A r B }
{ Proof }
Definitions occuring in Statement :
event-ordering+: EO+(Info),
subtype_rel: A r B,
uimplies: b supposing a,
uall: [x:A]. B[x],
universe: Type
Definitions :
bool: 
,
nat: 
,
exists: 
x:A. B[x],
Id: Id,
ifthenelse: if b then t else f fi ,
fpf-dom: x 
dom(f),
false: False,
pair: <a, b>,
eq_atom: x =a y,
eq_atom: eq_atom$n(x;y),
record-select: r.x,
infix_ap: x f y,
dep-isect: Error :dep-isect,
record: record(x.T[x]),
fset: FSet{T},
dataflow: dataflow(A;B),
isect2: T1 
T2,
b-union: A 
B,
bag: bag(T),
list: type List,
top: Top,
fpf: a:A fp-> B[a],
fpf-sub: f g,
deq: EqDecider(T),
ma-state: State(ds),
true: True,
squash: 
T,
atom: Atom,
lambda: 
x.A[x],
class-program: ClassProgram(T),
set: {x:A| B[x]} ,
apply: f a,
so_apply: x[s],
implies: P 
Q,
union: left + right,
or: P 
Q,
guard: {T},
l_member: (x l),
assert: 
b,
prop: 
,
fpf-cap: f(x)?z,
equal: s = t,
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),
all: x:A. B[x],
so_lambda: 
x.t[x],
event-ordering+: EO+(Info),
uall: [x:A]. B[x],
universe: Type,
uimplies: b supposing a,
isect: x:A. B[x],
member: t T,
subtype_rel: A r B,
event_ordering: EO,
token: "$token",
function: x:A 
B[x],
es-base-E: es-base-E(es),
record+: record+,
MaAuto: Error :MaAuto,
Unfold: Error :Unfold,
tactic: Error :tactic,
CollapseTHEN: Error :CollapseTHEN
Lemmas :
subtype_rel_wf,
record+_wf,
event_ordering_wf,
es-base-E_wf,
uall_wf,
true_wf,
squash_wf,
subtype_rel_record+,
subtype_rel_self,
bool_wf,
Id_wf,
not_wf,
nat_wf,
l_member_wf,
subtype_rel_function
\mforall{}[A,B:Type]. EO+(A) \msubseteq{}r EO+(B) supposing A \msubseteq{}r B
Date html generated:
2011_08_16-AM-11_20_45
Last ObjectModification:
2011_06_20-AM-00_25_25
Home
Index