Nuprl Lemma : first_index_bounds

∀[T:Type]. ∀[P:T ⟶ 𝔹]. ∀[L:T List].  (index-of-first x in L.P[x] ∈ ℕ||L|| + 1)


Proof




Definitions occuring in Statement :  first_index: index-of-first x in L.P[x],  length: ||as||,  list: T List,  int_seg: {i..j-},  bool: 𝔹,  uall: ∀[x:A]. B[x],  so_apply: x[s],  member: t ∈ T,  function: x:A ⟶ B[x],  add: n + m,  natural_number: $n,  universe: Type
Definitions unfolded in proof :  first_index: index-of-first x in L.P[x],  uall: ∀[x:A]. B[x],  member: t ∈ T,  so_apply: x[s],  int_seg: {i..j-},  uimplies: b supposing a,  guard: {T},  lelt: i ≤ j < k,  and: P ∧ Q,  all: ∀x:A. B[x],  decidable: Dec(P),  or: P ∨ Q,  satisfiable_int_formula: satisfiable_int_formula(fmla),  exists: ∃x:A. B[x],  false: False,  implies: P ⇒ Q,  not: ¬A,  top: Top,  prop: ℙ,  less_than: a < b,  squash: ↓T
Lemmas referenced :  bool_wf,  list_wf,  int_seg_wf,  int_formula_prop_less_lemma,  intformless_wf,  decidable__lt,  int_formula_prop_wf,  int_term_value_var_lemma,  int_term_value_constant_lemma,  int_formula_prop_le_lemma,  int_formula_prop_not_lemma,  int_formula_prop_and_lemma,  itermVar_wf,  itermConstant_wf,  intformle_wf,  intformnot_wf,  intformand_wf,  satisfiable-full-omega-tt,  decidable__le,  length_wf,  int_seg_properties,  select_wf,  length_wf_nat,  search_wf
Rules used in proof :  sqequalSubstitution,  sqequalRule,  sqequalReflexivity,  sqequalTransitivity,  computationStep,  isect_memberFormation,  introduction,  cut,  lemma_by_obid,  sqequalHypSubstitution,  isectElimination,  thin,  cumulativity,  hypothesisEquality,  hypothesis,  lambdaEquality,  applyEquality,  because_Cache,  setElimination,  rename,  independent_isectElimination,  natural_numberEquality,  productElimination,  dependent_functionElimination,  unionElimination,  dependent_pairFormation,  int_eqEquality,  intEquality,  isect_memberEquality,  voidElimination,  voidEquality,  independent_pairFormation,  computeAll,  imageElimination,  axiomEquality,  equalityTransitivity,  equalitySymmetry,  functionEquality,  universeEquality

Latex:
\mforall{}[T:Type].  \mforall{}[P:T  {}\mrightarrow{}  \mBbbB{}].  \mforall{}[L:T  List].    (index-of-first  x  in  L.P[x]  \mmember{}  \mBbbN{}||L||  +  1)



Date html generated: 2016_05_15-PM-03_24_55
Last ObjectModification: 2016_01_16-AM-10_48_17

Theory : general


Home Index