Nuprl Lemma : es-prior-fixedpoints-fix
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:E(X) ─→ E(X)].
∀[e:E(X)]. (prior-f-fixedpoints(e) ~ prior-f-fixedpoints(f**(e))) supposing ∀x:E(X). f x c≤ x
Proof
Definitions occuring in Statement :
es-prior-fixedpoints: prior-f-fixedpoints(e),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-fix: f**(e),
es-causle: e c≤ e',
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
apply: f a,
function: x:A ─→ B[x],
universe: Type,
sqequal: s ~ t
Lemmas :
es-fix-sqequal,
assert_of_bnot,
iff_weakening_uiff,
iff_transitivity,
eqff_to_assert,
assert-es-eq-E-2,
eqtt_to_assert,
bool_subtype_base,
bool_wf,
subtype_base_sq,
bool_cases,
es-E_wf,
equal_wf,
not_wf,
bnot_wf,
assert_wf,
es-E-interface_wf,
event-ordering+_subtype,
es-eq-E_wf
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)].
\mforall{}[e:E(X)]. (prior-f-fixedpoints(e) \msim{} prior-f-fixedpoints(f**(e))) supposing \mforall{}x:E(X). f x c\mleq{} x
Date html generated:
2015_07_21-PM-03_52_04
Last ObjectModification:
2015_07_16-AM-09_40_51
Home
Index