Nuprl Lemma : es-prior-interface-vals-property

[Info:Type]. ∀[es:EO+(Info)]. ∀[A:Type]. ∀[X:EClass(A)]. ∀[e:E].
  (X(<e) if e ∈b prior(X) then X(<prior(X)(e)) [X(prior(X)(e))] else [] fi  ∈ (A List))


Proof




Definitions occuring in Statement :  es-prior-interface: prior(X) es-prior-interface-vals: X(<e) eclass-val: X(e) in-eclass: e ∈b X eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-E: E append: as bs cons: [a b] nil: [] list: List ifthenelse: if then else fi  uall: [x:A]. B[x] universe: Type equal: t ∈ T
Lemmas :  es-E_wf event-ordering+_subtype eclass_wf event-ordering+_wf es-causl-swellfnd 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 in-eclass_wf es-prior-interface_wf1 es-interface-subtype_rel2 top_wf subtype_top es-E-interface_wf bool_wf equal-wf-T-base assert_wf bnot_wf not_wf eqtt_to_assert uiff_transitivity eqff_to_assert assert_of_bnot es-first_wf2 es-is-prior-interface es-locl-first assert_elim btrue_neq_bfalse mapfilter-append filter_cons_lemma filter_nil_lemma es-pred_wf es-prior-interface-val-pred iff_weakening_equal append_wf squash_wf true_wf list_wf es-prior-interface-vals_wf map_cons_lemma map_nil_lemma cons_wf eclass-val_wf event-ordering+_cumulative2 assert_functionality_wrt_uiff nil_wf append-nil subtype_rel_list es-pred-locl es-causl_weakening es-prior-interface_wf0 es-E-interface-property eclass-val_wf2 es-prior-interface_wf es-is-prior-interface-pred filter_is_nil es-before_wf l_all_iff l_member_wf es-locl_wf member-es-before

Latex:
\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[A:Type].  \mforall{}[X:EClass(A)].  \mforall{}[e:E].
    (X(<e)  =  if  e  \mmember{}\msubb{}  prior(X)  then  X(<prior(X)(e))  @  [X(prior(X)(e))]  else  []  fi  )



Date html generated: 2015_07_21-PM-03_16_42
Last ObjectModification: 2015_02_04-PM-06_21_49

Home Index