Nuprl Lemma : vs-neg-add2
∀[K:Rng]. ∀[vs:VectorSpace(K)]. ∀[x,y:Point(vs)]. (-(x + y) = -(y) + -(x) ∈ Point(vs))
Proof
Definitions occuring in Statement :
vs-neg: -(x),
vs-add: x + y,
vector-space: VectorSpace(K),
vs-point: Point(vs),
uall: ∀[x:A]. B[x],
equal: s = t ∈ T,
rng: Rng
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
rev_implies: P ⇐ Q,
and: P ∧ Q,
iff: P ⇐⇒ Q,
guard: {T},
uimplies: b supposing a,
subtype_rel: A ⊆r B,
true: True,
rng: Rng,
prop: ℙ,
squash: ↓T,
vs-neg: -(x),
member: t ∈ T,
uall: ∀[x:A]. B[x]
Lemmas referenced :
rng_wf,
vector-space_wf,
vs-add-comm,
vs-point_wf,
iff_weakening_equal,
vs-mul_wf,
vs-add_wf,
rng_one_wf,
rng_minus_wf,
vs-mul-linear,
true_wf,
squash_wf,
equal_wf
Rules used in proof :
dependent_functionElimination,
axiomEquality,
isect_memberEquality,
independent_functionElimination,
productElimination,
independent_isectElimination,
baseClosed,
imageMemberEquality,
sqequalRule,
natural_numberEquality,
rename,
setElimination,
because_Cache,
universeEquality,
equalitySymmetry,
hypothesis,
equalityTransitivity,
hypothesisEquality,
isectElimination,
extract_by_obid,
imageElimination,
sqequalHypSubstitution,
lambdaEquality,
thin,
applyEquality,
cut,
introduction,
isect_memberFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}[K:Rng]. \mforall{}[vs:VectorSpace(K)]. \mforall{}[x,y:Point(vs)]. (-(x + y) = -(y) + -(x))
Date html generated:
2018_05_22-PM-09_41_19
Last ObjectModification:
2018_01_09-AM-10_35_02
Theory : linear!algebra
Home
Index