Nuprl Lemma : es-fix-sqequal
[Info:Type]. [es:EO+(Info)]. [X:EClass(Top)]. [f:E(X) 
E(X)]. [e:E(X)]. f**(e) ~ e supposing (f e) = e
Proof not projected
Definitions occuring in Statement :
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-fix: f**(e),
es-E: E,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
apply: f a,
function: x:A B[x],
universe: Type,
sqequal: s ~ t,
equal: s = t
Definitions :
so_lambda: 
x y.t[x; y],
member: t 
T,
guard: {T},
bfalse: ff,
btrue: tt,
implies: P 
Q,
all: x:A. B[x],
ifthenelse: if b then t else f fi ,
ycomb: Y,
fix: f**(x),
es-fix: f**(e),
eqof: eqof(d),
es-E-interface: E(X),
true: True,
assert: 
b,
so_apply: x[s1;s2],
uall: [x:A]. B[x],
and: P 
Q,
uiff: uiff(P;Q),
uimplies: b supposing a,
unit: Unit,
bool: 
,
prop: 
,
sq_type: SQType(T),
false: False,
not: 
A,
subtype: S 
T,
it: 
Lemmas :
event-ordering+_wf,
top_wf,
eclass_wf,
es-E-interface_wf,
es-E-interface-subtype_rel,
event-ordering+_inc,
es-E_wf,
equal_wf,
not_functionality_wrt_uiff,
assert_of_bnot,
eqff_to_assert,
assert-deq,
eqtt_to_assert,
uiff_transitivity,
not_wf,
bnot_wf,
assert_wf,
bool_wf,
es-eq_wf,
eqof_wf,
es-eq_wf-interface,
in-eclass_wf,
assert_elim,
bool_subtype_base,
subtype_base_sq
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)]. \mforall{}[e:E(X)].
f**(e) \msim{} e supposing (f e) = e
Date html generated:
2012_01_23-PM-12_24_18
Last ObjectModification:
2011_12_13-PM-01_32_58
Home
Index