Nuprl Lemma : vs-map-from-subspace

∀[K:Rng]. ∀[A,B:VectorSpace(K)]. ∀[f:A ⟶ B]. ∀[P:Point(A) ⟶ ℙ].
  f ∈ (a:A | P[a]) ⟶ B supposing vs-subspace(K;A;a.P[a])


Proof




Definitions occuring in Statement :  vs-map: A ⟶ B,  sub-vs: (v:vs | P[v]),  vs-subspace: vs-subspace(K;vs;x.P[x]),  vector-space: VectorSpace(K),  vs-point: Point(vs),  uimplies: b supposing a,  uall: ∀[x:A]. B[x],  prop: ℙ,  so_apply: x[s],  member: t ∈ T,  function: x:A ⟶ B[x],  rng: Rng
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  uimplies: b supposing a,  rng: Rng,  so_lambda: λ2x.t[x],  so_apply: x[s],  prop: ℙ,  all: ∀x:A. B[x],  vs-map: A ⟶ B,  and: P ∧ Q,  vs-point: Point(vs),  subtype_rel: A ⊆r B,  vs-mul: a * x,  sub-vs: (v:vs | P[v]),  vs-add: x + y,  mk-vs: mk-vs,  top: Top,  eq_atom: x =a y,  ifthenelse: if b then t else f fi ,  bfalse: ff,  btrue: tt
Lemmas referenced :  vs-subspace_wf,  vs-point_wf,  vs-map_wf,  vector-space_wf,  rng_wf,  sub-vs_wf,  vs-add_wf,  rng_car_wf,  vs-mul_wf,  sub-vs-point-subtype,  rec_select_update_lemma,  istype-void,  subtype_rel_self
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation_alt,  introduction,  cut,  sqequalHypSubstitution,  hypothesis,  sqequalRule,  axiomEquality,  equalityTransitivity,  equalitySymmetry,  universeIsType,  extract_by_obid,  isectElimination,  thin,  setElimination,  rename,  hypothesisEquality,  lambdaEquality_alt,  applyEquality,  isect_memberEquality_alt,  isectIsTypeImplies,  inhabitedIsType,  functionIsType,  universeEquality,  dependent_functionElimination,  dependent_set_memberEquality_alt,  productIsType,  productElimination,  independent_isectElimination,  because_Cache,  equalityIstype,  functionExtensionality,  voidElimination,  independent_pairFormation,  promote_hyp,  lambdaFormation_alt,  setIsType,  instantiate

Latex:
\mforall{}[K:Rng].  \mforall{}[A,B:VectorSpace(K)].  \mforall{}[f:A  {}\mrightarrow{}  B].  \mforall{}[P:Point(A)  {}\mrightarrow{}  \mBbbP{}].
    f  \mmember{}  (a:A  |  P[a])  {}\mrightarrow{}  B  supposing  vs-subspace(K;A;a.P[a])



Date html generated: 2019_10_31-AM-06_27_34
Last ObjectModification: 2019_08_12-PM-04_47_48

Theory : linear!algebra


Home Index