Nuprl Lemma : sum_unroll_lo_q
∀[i,j:ℤ]. ∀[E:{i..j-} ⟶ ℚ]. (Σi ≤ k < j. E[k] = (E[i] + Σi + 1 ≤ k < j. E[k]) ∈ ℚ) supposing i < j
Proof
Definitions occuring in Statement :
qsum: Σa ≤ j < b. E[j],
qadd: r + s,
rationals: ℚ,
int_seg: {i..j-},
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
add: n + m,
natural_number: $n,
int: ℤ,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
qrng: <ℚ+*>,
rng_car: |r|,
pi1: fst(t),
rng_plus: +r,
pi2: snd(t),
infix_ap: x f y,
qsum: Σa ≤ j < b. E[j]
Lemmas referenced :
rng_sum_unroll_lo,
qrng_wf,
crng_subtype_rng
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isectElimination,
thin,
hypothesis,
applyEquality,
sqequalRule
Latex:
\mforall{}[i,j:\mBbbZ{}]. \mforall{}[E:\{i..j\msupminus{}\} {}\mrightarrow{} \mBbbQ{}]. (\mSigma{}i \mleq{} k < j. E[k] = (E[i] + \mSigma{}i + 1 \mleq{} k < j. E[k])) supposing i < j
Date html generated:
2020_05_20-AM-09_25_07
Last ObjectModification:
2020_02_01-AM-10_51_55
Theory : rationals
Home
Index