Nuprl Lemma : first-choosable-property2

[M:Type ─→ Type]. ∀[r:pRunType(P.M[P])]. ∀[t:ℕ+]. ∀[n:ℕ].
  ↑lg-is-source(run-intransit(r;t);first-choosable(r;t)) supposing ↑lg-is-source(run-intransit(r;t);n)


Proof




Definitions occuring in Statement :  first-choosable: first-choosable(r;t) run-intransit: run-intransit(r;t) pRunType: pRunType(T.M[T]) lg-is-source: lg-is-source(g;i) nat_plus: + nat: assert: b uimplies: supposing a uall: [x:A]. B[x] so_apply: x[s] function: x:A ─→ B[x] universe: Type
Lemmas :  run-intransit_wf ldag_wf pInTransit_wf search_property lg-size_wf lg-is-source_wf int_seg_subtype-nat nat_wf false_wf int_seg_wf assert_witness bool_wf eqtt_to_assert assert_of_lt_int subtract_wf search_wf decidable__le not-le-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 le_wf eqff_to_assert equal_wf bool_cases_sqequal subtype_base_sq bool_subtype_base assert-bnot less_than_wf assert_wf nat_plus_wf pRunType_wf lt_int_wf bnot_wf not_wf assert_elim bfalse_wf btrue_neq_bfalse bool_cases iff_transitivity iff_weakening_uiff assert_of_bnot

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].  \mforall{}[t:\mBbbN{}\msupplus{}].  \mforall{}[n:\mBbbN{}].
    \muparrow{}lg-is-source(run-intransit(r;t);first-choosable(r;t)) 
    supposing  \muparrow{}lg-is-source(run-intransit(r;t);n)



Date html generated: 2015_07_23-AM-11_17_02
Last ObjectModification: 2015_01_28-PM-11_19_22

Home Index