Nuprl Lemma : qadd_minus
∀[r:ℚ]. ((r + -(r)) = 0 ∈ ℚ)
Proof
Definitions occuring in Statement :
qmul: r * s,
qadd: r + s,
rationals: ℚ,
uall: ∀[x:A]. B[x],
minus: -n,
natural_number: $n,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
uiff: uiff(P;Q),
and: P ∧ Q,
rev_uimplies: rev_uimplies(P;Q),
uimplies: b supposing a,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
nat_plus: ℕ+,
cand: A c∧ B,
not: ¬A,
implies: P ⇒ Q,
iff: P ⇐⇒ Q,
int_nzero: ℤ-o,
nequal: a ≠ b ∈ T ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
prop: ℙ,
qmul: r * s,
qadd: r + s,
qeq: qeq(r;s),
callbyvalueall: callbyvalueall,
evalall: evalall(t),
ifthenelse: if b then t else f fi ,
btrue: tt,
so_lambda: λ2x.t[x],
so_apply: x[s],
has-value: (a)↓,
has-valueall: has-valueall(a),
bfalse: ff,
decidable: Dec(P),
or: P ∨ Q
Lemmas referenced :
assert-qeq,
qadd_wf,
qmul_wf,
int-subtype-rationals,
q-elim,
nat_plus_properties,
iff_weakening_uiff,
assert_wf,
qeq_wf2,
equal-wf-base,
rationals_wf,
int_subtype_base,
istype-assert,
qdiv-int-elim,
full-omega-unsat,
intformand_wf,
intformeq_wf,
itermVar_wf,
itermConstant_wf,
intformless_wf,
istype-int,
int_formula_prop_and_lemma,
int_formula_prop_eq_lemma,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
nequal_wf,
valueall-type-has-valueall,
product-valueall-type,
int-valueall-type,
evalall-reduce,
assert_of_eq_int,
decidable__equal_int,
intformnot_wf,
itermAdd_wf,
itermMultiply_wf,
int_formula_prop_not_lemma,
int_term_value_add_lemma,
int_term_value_mul_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
minusEquality,
natural_numberEquality,
hypothesis,
applyEquality,
because_Cache,
sqequalRule,
closedConclusion,
productElimination,
independent_pairFormation,
independent_isectElimination,
dependent_functionElimination,
setElimination,
rename,
lambdaFormation_alt,
independent_functionElimination,
baseClosed,
dependent_set_memberEquality_alt,
approximateComputation,
dependent_pairFormation_alt,
lambdaEquality_alt,
int_eqEquality,
Error :memTop,
universeIsType,
voidElimination,
equalityIstype,
inhabitedIsType,
sqequalBase,
equalitySymmetry,
intEquality,
callbyvalueReduce,
sqleReflexivity,
isintReduceTrue,
productEquality,
independent_pairEquality,
multiplyEquality,
addEquality,
unionElimination,
hyp_replacement,
applyLambdaEquality
Latex:
\mforall{}[r:\mBbbQ{}]. ((r + -(r)) = 0)
Date html generated:
2020_05_20-AM-09_13_31
Last ObjectModification:
2020_01_24-PM-03_54_14
Theory : rationals
Home
Index