Nuprl Lemma : es-prior-fixedpoints_wf

[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:E(X) ─→ E(X)].
  ∀[e:E(X)]. (prior-f-fixedpoints(e) ∈ {e':E(X)| (f e') e' ∈ E}  List) supposing ∀x:E(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-causle: c≤ e' es-E: E list: List uimplies: supposing a uall: [x:A]. B[x] top: Top all: x:A. B[x] member: t ∈ T set: {x:A| B[x]}  apply: a function: x:A ─→ B[x] universe: Type equal: t ∈ T
Lemmas :  es-causl-swellfnd event-ordering+_subtype nat_properties less_than_transitivity1 less_than_irreflexivity ge_wf less_than_wf int_seg_wf int_seg_subtype-nat decidable__le subtract_wf false_wf not-ge-2 less-iff-le condition-implies-le minus-one-mul zero-add minus-add minus-minus add-associates add-swap add-commutes add_functionality_wrt_le add-zero le-add-cancel decidable__equal_int subtype_rel-int_seg le_weakening int_seg_properties le_wf nat_wf zero-le-nat lelt_wf es-causl_wf equal_wf decidable__lt not-equal-2 le-add-cancel-alt not-le-2 sq_stable__le add-mul-special zero-mul es-E-interface_wf all_wf es-causle_wf eclass_wf top_wf es-E_wf event-ordering+_wf es-eq-E_wf bool_wf equal-wf-T-base assert_wf in-eclass_wf es-prior-interface_wf0 es-interface-subtype_rel2 subtype_top append_wf eclass-val_wf2 es-prior-interface_wf es-prior-interface-causl cons_wf nil_wf bnot_wf not_wf uiff_transitivity eqtt_to_assert assert-es-eq-E-2 iff_transitivity iff_weakening_uiff eqff_to_assert assert_of_bnot es-fix_wf2 es-fix-causle es-fix-equal-E-interface es-E-interface-property

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)  \mmember{}  \{e':E(X)|  (f  e')  =  e'\}    List)  supposing  \mforall{}x:E(X).  f  x  c\mleq{}  x



Date html generated: 2015_07_21-PM-03_51_52
Last ObjectModification: 2015_01_27-PM-06_00_35

Home Index