Nuprl Lemma : stable__proj-eq
∀[n:ℕ]. ∀[a,b:ℙ^n].  Stable{a = b}
Proof
Definitions occuring in Statement : 
proj-eq: a = b
, 
real-proj: ℙ^n
, 
nat: ℕ
, 
stable: Stable{P}
, 
uall: ∀[x:A]. B[x]
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
proj-eq: a = b
, 
nat: ℕ
, 
so_lambda: λ2x.t[x]
, 
real-proj: ℙ^n
, 
real-vec: ℝ^n
, 
so_apply: x[s]
, 
implies: P 
⇒ Q
, 
all: ∀x:A. B[x]
, 
stable: Stable{P}
, 
uimplies: b supposing a
, 
prop: ℙ
Lemmas referenced : 
stable__all, 
int_seg_wf, 
all_wf, 
req_wf, 
rmul_wf, 
stable_req, 
req_witness, 
not_wf, 
proj-eq_wf, 
real-proj_wf, 
nat_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
extract_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
natural_numberEquality, 
addEquality, 
setElimination, 
rename, 
hypothesisEquality, 
hypothesis, 
sqequalRule, 
lambdaEquality, 
because_Cache, 
applyEquality, 
independent_functionElimination, 
lambdaFormation, 
isect_memberEquality, 
dependent_functionElimination, 
equalityTransitivity, 
equalitySymmetry
Latex:
\mforall{}[n:\mBbbN{}].  \mforall{}[a,b:\mBbbP{}\^{}n].    Stable\{a  =  b\}
Date html generated:
2017_10_05-AM-00_18_11
Last ObjectModification:
2017_06_17-AM-10_07_25
Theory : inner!product!spaces
Home
Index