Nuprl Lemma : ndiff_ann_l

∀[a:ℕ]. ((0 -- a) = 0 ∈ ℤ)


Proof




Definitions occuring in Statement :  ndiff: a -- b,  nat: ℕ,  uall: ∀[x:A]. B[x],  natural_number: $n,  int: ℤ,  equal: s = t ∈ T
Definitions unfolded in proof :  ndiff: a -- b,  imax: imax(a;b),  uall: ∀[x:A]. B[x],  has-value: (a)↓,  member: t ∈ T,  uimplies: b supposing a,  nat: ℕ,  all: ∀x:A. B[x],  implies: P ⇒ Q,  bool: 𝔹,  unit: Unit,  it: ⋅,  btrue: tt,  uiff: uiff(P;Q),  and: P ∧ Q,  ifthenelse: if b then t else f fi ,  le: A ≤ B,  bfalse: ff,  exists: ∃x:A. B[x],  prop: ℙ,  or: P ∨ Q,  sq_type: SQType(T),  guard: {T},  bnot: ¬bb,  assert: ↑b,  false: False,  not: ¬A,  ge: i ≥ j ,  satisfiable_int_formula: satisfiable_int_formula(fmla),  top: Top
Lemmas referenced :  value-type-has-value,  int-value-type,  subtract_wf,  le_int_wf,  bool_wf,  eqtt_to_assert,  assert_of_le_int,  eqff_to_assert,  equal_wf,  bool_cases_sqequal,  subtype_base_sq,  bool_subtype_base,  assert-bnot,  le_wf,  nat_properties,  satisfiable-full-omega-tt,  intformand_wf,  intformnot_wf,  intformle_wf,  itermSubtract_wf,  itermConstant_wf,  itermVar_wf,  int_formula_prop_and_lemma,  int_formula_prop_not_lemma,  int_formula_prop_le_lemma,  int_term_value_subtract_lemma,  int_term_value_constant_lemma,  int_term_value_var_lemma,  int_formula_prop_wf,  nat_wf
Rules used in proof :  sqequalSubstitution,  sqequalRule,  sqequalReflexivity,  sqequalTransitivity,  computationStep,  isect_memberFormation,  cut,  callbyvalueReduce,  introduction,  extract_by_obid,  sqequalHypSubstitution,  isectElimination,  thin,  intEquality,  independent_isectElimination,  hypothesis,  natural_numberEquality,  setElimination,  rename,  hypothesisEquality,  because_Cache,  lambdaFormation,  unionElimination,  equalityElimination,  productElimination,  dependent_pairFormation,  equalityTransitivity,  equalitySymmetry,  promote_hyp,  dependent_functionElimination,  instantiate,  cumulativity,  independent_functionElimination,  voidElimination,  lambdaEquality,  int_eqEquality,  isect_memberEquality,  voidEquality,  independent_pairFormation,  computeAll

Latex:
\mforall{}[a:\mBbbN{}].  ((0  --  a)  =  0)



Date html generated: 2017_04_14-AM-09_14_53
Last ObjectModification: 2017_02_27-PM-03_52_45

Theory : int_2


Home Index