Nuprl Lemma : pi2-consensus-rcvs-to-consensus-events

[V:Type]. ∀[A:Id List]. ∀[t:ℕ+]. ∀[f:(V List) ─→ V]. ∀[v0:V]. ∀[L:consensus-rcv(V;A) List].
  ((snd(consensus-rcvs-to-consensus-events(f;t;v0;L))) L ∈ (consensus-rcv(V;A) List))


Proof




Definitions occuring in Statement :  consensus-rcvs-to-consensus-events: consensus-rcvs-to-consensus-events(f;t;v0;L) consensus-rcv: consensus-rcv(V;A) Id: Id list: List nat_plus: + uall: [x:A]. B[x] pi2: snd(t) function: x:A ─→ B[x] universe: Type equal: t ∈ T
Lemmas :  last_induction equal_wf consensus-rcvs-to-consensus-events_wf list_wf consensus-event_wf nil_wf list_accum_append subtype_rel_list top_wf list_accum_wf bool_wf l_member_wf append_wf cons_wf bfalse_wf consensus-accum-num_wf rcv-vote?_wf eqtt_to_assert rcvd-vote_wf nat_wf consensus-message_wf decidable__le false_wf not-le-2 sq_stable__le condition-implies-le minus-add minus-one-mul zero-add add-associates add-swap add-commutes add_functionality_wrt_le add-zero le-add-cancel le_wf decidable__lt add-mul-special zero-mul lelt_wf unit_wf2 eqff_to_assert bool_cases_sqequal subtype_base_sq bool_subtype_base assert-bnot set_wf Id_wf list-cases null_nil_lemma archive-event_wf inning-event_wf product_subtype_list null_cons_lemma map_wf int_seg_wf subtract_wf length_wf filter_wf5 is-inning-event_wf upto_wf list_accum_cons_lemma list_accum_nil_lemma consensus-rcv_wf nat_plus_wf and_wf
\mforall{}[V:Type].  \mforall{}[A:Id  List].  \mforall{}[t:\mBbbN{}\msupplus{}].  \mforall{}[f:(V  List)  {}\mrightarrow{}  V].  \mforall{}[v0:V].  \mforall{}[L:consensus-rcv(V;A)  List].
    ((snd(consensus-rcvs-to-consensus-events(f;t;v0;L)))  =  L)



Date html generated: 2015_07_17-AM-11_54_42
Last ObjectModification: 2015_01_28-AM-00_44_33

Home Index