Nuprl Lemma : real-matrix-add_functionality
∀[a,b:ℕ]. ∀[A1,A2,B1,B2:ℝ(a × b)]. (A1 + B1 ≡ A2 + B2) supposing (A1 ≡ A2 and B1 ≡ B2)
Proof
Definitions occuring in Statement :
real-matrix-add: A + B,
reqmatrix: X ≡ Y,
rmatrix: ℝ(a × b),
nat: ℕ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
reqmatrix: X ≡ Y,
rmatrix: ℝ(a × b),
real-matrix-add: A + B,
all: ∀x:A. B[x],
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
le: A ≤ B,
nat: ℕ,
subtype_rel: A ⊆r B,
less_than: a < b,
squash: ↓T,
implies: P ⇒ Q,
prop: ℙ,
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q)
Lemmas referenced :
int_seg_wf,
req_witness,
real-matrix-add_wf,
subtype_rel_self,
real_wf,
reqmatrix_wf,
rmatrix_wf,
istype-nat,
radd_wf,
req_weakening,
req_functionality,
radd_functionality
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
introduction,
cut,
sqequalHypSubstitution,
sqequalRule,
lambdaFormation_alt,
universeIsType,
extract_by_obid,
isectElimination,
thin,
setElimination,
rename,
productElimination,
hypothesis,
hypothesisEquality,
natural_numberEquality,
lambdaEquality_alt,
dependent_functionElimination,
applyEquality,
functionEquality,
imageElimination,
independent_functionElimination,
functionIsTypeImplies,
inhabitedIsType,
isect_memberEquality_alt,
because_Cache,
isectIsTypeImplies,
independent_isectElimination
Latex:
\mforall{}[a,b:\mBbbN{}]. \mforall{}[A1,A2,B1,B2:\mBbbR{}(a \mtimes{} b)]. (A1 + B1 \mequiv{} A2 + B2) supposing (A1 \mequiv{} A2 and B1 \mequiv{} B2)
Date html generated:
2019_10_30-AM-08_17_58
Last ObjectModification:
2019_09_19-PM-00_57_17
Theory : reals
Home
Index