Nuprl Lemma : Legendre-annihilates-rpolynomial
∀[n:ℕ]. ∀[f:[r(-1), r1] ⟶ℝ].
r(-1)_∫-r1 f[x] * Legendre(n;x) dx = r0
supposing ∃k:ℕn. ∃a:ℕk + 1 ⟶ ℝ. ∀x:{x:ℝ| x ∈ [r(-1), r1]} . ((f x) = (Σi≤k. a_i * x^i))
Proof
Definitions occuring in Statement :
integral: a_∫-b f[x] dx,
Legendre: Legendre(n;x),
rfun: I ⟶ℝ,
rccint: [l, u],
i-member: r ∈ I,
rpolynomial: (Σi≤n. a_i * x^i),
req: x = y,
rmul: a * b,
int-to-real: r(n),
real: ℝ,
int_seg: {i..j-},
nat: ℕ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
set: {x:A| B[x]} ,
apply: f a,
function: x:A ⟶ B[x],
add: n + m,
minus: -n,
natural_number: $n
Definitions unfolded in proof :
so_apply: x[s],
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
exists: ∃x:A. B[x],
member: t ∈ T,
nat: ℕ,
int_seg: {i..j-},
all: ∀x:A. B[x],
prop: ℙ,
rfun: I ⟶ℝ,
ge: i ≥ j ,
lelt: i ≤ j < k,
and: P ∧ Q,
decidable: Dec(P),
or: P ∨ Q,
not: ¬A,
implies: P ⇒ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
top: Top,
iff: P ⇐⇒ Q,
imax: imax(a;b),
imin: imin(a;b),
le_int: i ≤z j,
lt_int: i <z j,
bnot: ¬bb,
ifthenelse: if b then t else f fi ,
bfalse: ff,
btrue: tt,
ifun: ifun(f;I),
real-fun: real-fun(f;a;b),
i-finite: i-finite(I),
rccint: [l, u],
isl: isl(x),
assert: ↑b,
true: True,
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q),
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
cand: A c∧ B,
i-member: r ∈ I,
guard: {T},
le: A ≤ B,
less_than': less_than'(a;b),
pointwise-req: x[k] = y[k] for k ∈ [n,m],
sq_stable: SqStable(P),
squash: ↓T,
nequal: a ≠ b ∈ T ,
rev_implies: P ⇐ Q,
sq_type: SQType(T)
Lemmas referenced :
int_seg_wf,
real_wf,
i-member_wf,
rccint_wf,
int-to-real_wf,
req_wf,
rpolynomial_wf,
int_seg_properties,
nat_properties,
decidable__le,
full-omega-unsat,
intformand_wf,
intformnot_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
istype-int,
int_formula_prop_and_lemma,
istype-void,
int_formula_prop_not_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_wf,
istype-le,
rfun_wf,
istype-nat,
ifun_wf,
rmin_wf,
rmax_wf,
rccint-icompact,
rmin-rleq-rmax,
member_rccint_lemma,
rleq_wf,
imin_wf,
imax_wf,
rmul_wf,
Legendre_wf,
iff_weakening_uiff,
rleq_functionality,
rmin-int,
req_weakening,
rmax-int,
left_endpoint_rccint_lemma,
right_endpoint_rccint_lemma,
left-endpoint_wf,
right-endpoint_wf,
req-int,
req_functionality,
rmul_functionality,
subtype_rel_sets_simple,
req_inversion,
rleq_transitivity,
rleq_weakening,
int_seg_subtype_nat,
istype-false,
rpolynomial_functionality,
decidable__lt,
intformless_wf,
itermAdd_wf,
int_formula_prop_less_lemma,
int_term_value_add_lemma,
istype-less_than,
Legendre_functionality,
sq_stable__req,
integral_wf,
Legendre-orthogonal-rpolynomial,
subtype_base_sq,
bool_wf,
bool_subtype_base,
equal_wf,
squash_wf,
true_wf,
istype-universe,
eq_int_eq_false,
intformeq_wf,
int_formula_prop_eq_lemma,
bfalse_wf,
subtype_rel_self,
iff_weakening_equal,
integral_functionality
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation_alt,
cut,
productIsType,
universeIsType,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
natural_numberEquality,
setElimination,
rename,
hypothesisEquality,
hypothesis,
functionIsType,
addEquality,
setIsType,
minusEquality,
applyEquality,
dependent_set_memberEquality_alt,
because_Cache,
productElimination,
dependent_functionElimination,
unionElimination,
independent_isectElimination,
approximateComputation,
independent_functionElimination,
dependent_pairFormation_alt,
lambdaEquality_alt,
int_eqEquality,
isect_memberEquality_alt,
voidElimination,
independent_pairFormation,
callbyvalueReduce,
sqleReflexivity,
promote_hyp,
lambdaFormation_alt,
closedConclusion,
productEquality,
equalityTransitivity,
equalitySymmetry,
instantiate,
cumulativity,
imageElimination,
inhabitedIsType,
universeEquality,
equalityIstype,
imageMemberEquality,
baseClosed
Latex:
\mforall{}[n:\mBbbN{}]. \mforall{}[f:[r(-1), r1] {}\mrightarrow{}\mBbbR{}].
r(-1)\_\mint{}\msupminus{}r1 f[x] * Legendre(n;x) dx = r0
supposing \mexists{}k:\mBbbN{}n. \mexists{}a:\mBbbN{}k + 1 {}\mrightarrow{} \mBbbR{}. \mforall{}x:\{x:\mBbbR{}| x \mmember{} [r(-1), r1]\} . ((f x) = (\mSigma{}i\mleq{}k. a\_i * x\^{}i))
Date html generated:
2019_10_31-AM-06_18_39
Last ObjectModification:
2019_01_07-AM-10_31_19
Theory : reals_2
Home
Index