Nuprl Lemma : accum-induction

[P:ℕ ⟶ ℙ]. (P[0]  (∀n:ℕ(P[n]  P[n 1]))  (∀n:ℕP[n]))


Proof




Definitions occuring in Statement :  nat: uall: [x:A]. B[x] prop: so_apply: x[s] all: x:A. B[x] implies:  Q function: x:A ⟶ B[x] add: m natural_number: $n
Definitions unfolded in proof :  uall: [x:A]. B[x] implies:  Q all: x:A. B[x] member: t ∈ T prop: so_lambda: λ2x.t[x] so_apply: x[s] subtype_rel: A ⊆B nat: ge: i ≥  decidable: Dec(P) or: P ∨ Q uimplies: supposing a satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] false: False not: ¬A top: Top and: P ∧ Q le: A ≤ B less_than': less_than'(a;b)
Lemmas referenced :  add-zero accum-induction-lemma false_wf le_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 nat_properties all_wf nat_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation lambdaFormation cut lemma_by_obid hypothesis sqequalHypSubstitution isectElimination thin sqequalRule lambdaEquality functionEquality applyEquality hypothesisEquality universeEquality because_Cache dependent_set_memberEquality addEquality setElimination rename natural_numberEquality dependent_functionElimination unionElimination independent_isectElimination dependent_pairFormation int_eqEquality intEquality isect_memberEquality voidElimination voidEquality independent_pairFormation computeAll cumulativity independent_functionElimination

Latex:
\mforall{}[P:\mBbbN{}  {}\mrightarrow{}  \mBbbP{}].  (P[0]  {}\mRightarrow{}  (\mforall{}n:\mBbbN{}.  (P[n]  {}\mRightarrow{}  P[n  +  1]))  {}\mRightarrow{}  (\mforall{}n:\mBbbN{}.  P[n]))



Date html generated: 2016_05_15-PM-04_09_42
Last ObjectModification: 2016_01_16-AM-11_06_43

Theory : general


Home Index