Nuprl Lemma : stable__req-vec

n:ℕ. ∀x,y:ℝ^n.  Stable{req-vec(n;x;y)}


Proof




Definitions occuring in Statement :  req-vec: req-vec(n;x;y) real-vec: ^n nat: stable: Stable{P} all: x:A. B[x]
Definitions unfolded in proof :  all: x:A. B[x] req-vec: req-vec(n;x;y) uall: [x:A]. B[x] member: t ∈ T nat: so_lambda: λ2x.t[x] real-vec: ^n so_apply: x[s] implies:  Q
Lemmas referenced :  stable__all int_seg_wf req_wf stable_req real-vec_wf nat_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity lambdaFormation cut introduction extract_by_obid sqequalHypSubstitution isectElimination thin natural_numberEquality setElimination rename hypothesisEquality hypothesis sqequalRule lambdaEquality applyEquality because_Cache independent_functionElimination

Latex:
\mforall{}n:\mBbbN{}.  \mforall{}x,y:\mBbbR{}\^{}n.    Stable\{req-vec(n;x;y)\}



Date html generated: 2016_10_26-AM-10_14_18
Last ObjectModification: 2016_09_26-PM-00_48_22

Theory : reals


Home Index