Nuprl Lemma : cantor2baire-aux_wf

∀[a:ℕ ⟶ 𝔹]. ∀[n:ℕ].  (cantor2baire-aux(a;n) ∈ ℕ)


Proof




Definitions occuring in Statement :  cantor2baire-aux: cantor2baire-aux(a;n),  nat: ℕ,  bool: 𝔹,  uall: ∀[x:A]. B[x],  member: t ∈ T,  function: x:A ⟶ B[x]
Definitions unfolded in proof :  bfalse: ff,  uiff: uiff(P;Q),  ifthenelse: if b then t else f fi ,  btrue: tt,  it: ⋅,  unit: Unit,  bool: 𝔹,  top: Top,  exists: ∃x:A. B[x],  satisfiable_int_formula: satisfiable_int_formula(fmla),  uimplies: b supposing a,  or: P ∨ Q,  decidable: Dec(P),  all: ∀x:A. B[x],  lelt: i ≤ j < k,  ge: i ≥ j ,  guard: {T},  int_seg: {i..j-},  prop: ℙ,  implies: P ⇒ Q,  not: ¬A,  false: False,  less_than': less_than'(a;b),  and: P ∧ Q,  le: A ≤ B,  nat: ℕ,  cantor2baire-aux: cantor2baire-aux(a;n),  member: t ∈ T,  uall: ∀[x:A]. B[x]
Lemmas referenced :  int_seg_wf,  equal_wf,  eqtt_to_assert,  bool_wf,  int_formula_prop_wf,  int_term_value_var_lemma,  int_term_value_add_lemma,  int_term_value_constant_lemma,  int_formula_prop_le_lemma,  int_formula_prop_not_lemma,  int_formula_prop_and_lemma,  itermVar_wf,  itermAdd_wf,  itermConstant_wf,  intformle_wf,  intformnot_wf,  intformand_wf,  satisfiable-full-omega-tt,  decidable__le,  int_seg_properties,  nat_properties,  le_wf,  false_wf,  nat_wf,  primrec_wf
Rules used in proof :  functionEquality,  axiomEquality,  independent_functionElimination,  equalitySymmetry,  equalityTransitivity,  equalityElimination,  computeAll,  voidEquality,  voidElimination,  isect_memberEquality,  intEquality,  int_eqEquality,  dependent_pairFormation,  independent_isectElimination,  unionElimination,  dependent_functionElimination,  productElimination,  rename,  setElimination,  addEquality,  because_Cache,  functionExtensionality,  applyEquality,  lambdaEquality,  lambdaFormation,  independent_pairFormation,  natural_numberEquality,  dependent_set_memberEquality,  hypothesisEquality,  hypothesis,  thin,  isectElimination,  sqequalHypSubstitution,  extract_by_obid,  sqequalRule,  cut,  introduction,  isect_memberFormation,  sqequalReflexivity,  computationStep,  sqequalTransitivity,  sqequalSubstitution

Latex:
\mforall{}[a:\mBbbN{}  {}\mrightarrow{}  \mBbbB{}].  \mforall{}[n:\mBbbN{}].    (cantor2baire-aux(a;n)  \mmember{}  \mBbbN{})



Date html generated: 2017_04_21-AM-11_21_36
Last ObjectModification: 2017_04_20-PM-03_38_02

Theory : continuity


Home Index