Nuprl Lemma : partition-choice_wf

∀[p:ℝ List]. (partition-choice(p) ∈ Type)


Proof




Definitions occuring in Statement :  partition-choice: partition-choice(p),  real: ℝ,  list: T List,  uall: ∀[x:A]. B[x],  member: t ∈ T,  universe: Type
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  partition-choice: partition-choice(p),  all: ∀x:A. B[x],  top: Top,  and: P ∧ Q,  int_seg: {i..j-},  uimplies: b supposing a,  guard: {T},  lelt: i ≤ j < k,  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,  prop: ℙ,  less_than: a < b,  squash: ↓T,  uiff: uiff(P;Q)
Lemmas referenced :  list_wf,  int_term_value_add_lemma,  itermAdd_wf,  false_wf,  int_term_value_subtract_lemma,  int_formula_prop_less_lemma,  itermSubtract_wf,  intformless_wf,  subtract-is-int-iff,  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,  int_seg_properties,  select_wf,  rleq_wf,  real_wf,  length_wf,  subtract_wf,  int_seg_wf,  member_rccint_lemma
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation,  introduction,  cut,  sqequalRule,  lemma_by_obid,  sqequalHypSubstitution,  dependent_functionElimination,  thin,  isect_memberEquality,  voidElimination,  voidEquality,  hypothesis,  functionEquality,  isectElimination,  natural_numberEquality,  hypothesisEquality,  setEquality,  because_Cache,  productEquality,  setElimination,  rename,  independent_isectElimination,  productElimination,  unionElimination,  dependent_pairFormation,  lambdaEquality,  int_eqEquality,  intEquality,  independent_pairFormation,  computeAll,  pointwiseFunctionality,  equalityTransitivity,  equalitySymmetry,  promote_hyp,  imageElimination,  baseApply,  closedConclusion,  baseClosed,  addEquality,  axiomEquality

Latex:
\mforall{}[p:\mBbbR{}  List].  (partition-choice(p)  \mmember{}  Type)



Date html generated: 2016_05_18-AM-09_03_42
Last ObjectModification: 2016_01_17-AM-02_33_10

Theory : reals


Home Index