Nuprl Lemma : weighted-sum_wf

[p:ℚ List]. ∀[F:ℕ||p|| ⟶ ℚ].  (weighted-sum(p;F) ∈ ℚ)


Proof




Definitions occuring in Statement :  weighted-sum: weighted-sum(p;F) rationals: length: ||as|| list: List int_seg: {i..j-} uall: [x:A]. B[x] member: t ∈ T function: x:A ⟶ B[x] natural_number: $n
Definitions unfolded in proof :  weighted-sum: weighted-sum(p;F) uall: [x:A]. B[x] member: t ∈ T so_lambda: λ2x.t[x] int_seg: {i..j-} uimplies: supposing a guard: {T} lelt: i ≤ j < k and: P ∧ Q all: x:A. B[x] decidable: Dec(P) or: P ∨ Q satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] false: False implies:  Q not: ¬A top: Top prop: less_than: a < b squash: T so_apply: x[s]
Lemmas referenced :  list_wf int_seg_wf int_formula_prop_less_lemma intformless_wf decidable__lt int_formula_prop_wf int_term_value_var_lemma int_term_value_constant_lemma int_formula_prop_le_lemma int_formula_prop_not_lemma int_formula_prop_and_lemma itermVar_wf itermConstant_wf intformle_wf intformnot_wf intformand_wf satisfiable-full-omega-tt decidable__le int_seg_properties select_wf qmul_wf rationals_wf length_wf qsum_wf
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep isect_memberFormation introduction cut lemma_by_obid sqequalHypSubstitution isectElimination thin natural_numberEquality hypothesis hypothesisEquality lambdaEquality applyEquality because_Cache setElimination rename independent_isectElimination productElimination dependent_functionElimination unionElimination dependent_pairFormation int_eqEquality intEquality isect_memberEquality voidElimination voidEquality independent_pairFormation computeAll imageElimination axiomEquality equalityTransitivity equalitySymmetry functionEquality

Latex:
\mforall{}[p:\mBbbQ{}  List].  \mforall{}[F:\mBbbN{}||p||  {}\mrightarrow{}  \mBbbQ{}].    (weighted-sum(p;F)  \mmember{}  \mBbbQ{})



Date html generated: 2016_05_15-PM-11_45_07
Last ObjectModification: 2016_01_17-AM-10_07_32

Theory : randomness


Home Index