{ 
[Info:Type]. [es:EO+(Info)]. [A:Type]. [X:EClass(A)]. [e:E].
uiff(X(<e) = [];
e 
prior(X)) }
{ Proof }
Definitions occuring in Statement :
es-prior-interface: prior(X),
es-prior-interface-vals: X(<e),
in-eclass: e X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: b,
uiff: uiff(P;Q),
uall: [x:A]. B[x],
not: A,
nil: [],
list: type List,
universe: Type,
equal: s = t
Definitions :
sq_type: SQType(T),
intensional-universe: IType,
set: {x:A| B[x]} ,
eq_knd: a = b,
fpf-dom: x dom(f),
bool: 
,
IdLnk: IdLnk,
Id: Id,
so_apply: x[s],
or: P 
Q,
guard: {T},
locl: locl(a),
Knd: Knd,
append: as @ bs,
l_member: (x l),
limited-type: LimitedType,
fpf: a:A fp-> B[a],
es-E-interface: E(X),
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
null: null(as),
less_than: a < b,
rev_implies: P 
Q,
es-prior-interface: prior(X),
in-eclass: e X,
iff: P 
Q,
axiom: Ax,
nil: [],
es-prior-interface-vals: X(<e),
assert: b,
prop: 
,
list: type List,
pair: <a, b>,
void: Void,
false: False,
implies: P Q,
not: A,
uimplies: b supposing a,
product: x:A 
B[x],
and: P 
Q,
uiff: uiff(P;Q),
union: left + right,
subtype: S 
T,
subtype_rel: A r B,
atom: Atom,
apply: f a,
top: Top,
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,
fpf-cap: f(x)?z,
filter: filter(P;l),
natural_number: $n,
cons: [car / cdr],
eclass-val: X(e),
tl: tl(l),
hd: hd(l),
true: True,
bfalse: ff,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
btrue: tt,
eq_bool: p =b q,
lt_int: i <z j,
le_int: i z j,
eq_int: (i =
j),
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_str: Error :eq_str,
eq_id: a = b,
eq_lnk: a = b,
es-eq-E: e = e',
bimplies: p q,
band: p q,
bor: p q,
bnot: b,
int: 
,
unit: Unit,
CollapseTHEN: Error :CollapseTHEN,
RepeatFor: Error :RepeatFor,
cand: A c B,
Auto: Error :Auto
Lemmas :
append_is_nil,
bool_wf,
assert_of_bnot,
eqff_to_assert,
uiff_transitivity,
iff_weakening_uiff,
eqtt_to_assert,
es-prior-interface-vals-property,
bnot_wf,
true_wf,
append_wf,
eclass-val_wf,
ifthenelse_wf,
list-subtype,
l_member_wf,
eclass-val_wf2,
es-interface-val_wf2,
not_wf,
assert_wf,
false_wf,
uiff_wf,
event-ordering+_inc,
subtype_rel_self,
es-E_wf,
event-ordering+_wf,
eclass_wf,
in-eclass_wf,
es-prior-interface_wf1,
member_wf,
es-prior-interface-vals_wf,
rev_implies_wf,
iff_wf,
uiff_inversion,
intensional-universe_wf,
subtype_rel_wf,
es-prior-interface_wf,
es-interface-top,
es-E-interface_wf,
es-interface-subtype_rel2,
top_wf
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[A:Type]. \mforall{}[X:EClass(A)]. \mforall{}[e:E]. uiff(X(<e) = [];\mneg{}\muparrow{}e \mmember{}\msubb{} prior(X))
Date html generated:
2011_08_16-PM-05_01_22
Last ObjectModification:
2011_06_20-AM-01_09_04
Home
Index