Nuprl Lemma : rcos-reduce4
∀[x:ℝ]. (rcos(x) = (r1 - 8 * rsin((x)/4)^2 * rcos((x)/4)^2))
Proof
Definitions occuring in Statement : 
rcos: rcos(x)
, 
rsin: rsin(x)
, 
rnexp: x^k1
, 
int-rdiv: (a)/k1
, 
int-rmul: k1 * a
, 
rsub: x - y
, 
req: x = y
, 
rmul: a * b
, 
int-to-real: r(n)
, 
real: ℝ
, 
uall: ∀[x:A]. B[x]
, 
natural_number: $n
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
nat: ℕ
, 
all: ∀x:A. B[x]
, 
decidable: Dec(P)
, 
or: P ∨ Q
, 
uimplies: b supposing a
, 
not: ¬A
, 
implies: P 
⇒ Q
, 
satisfiable_int_formula: satisfiable_int_formula(fmla)
, 
exists: ∃x:A. B[x]
, 
top: Top
, 
prop: ℙ
, 
false: False
, 
int_nzero: ℤ-o
, 
true: True
, 
nequal: a ≠ b ∈ T 
, 
sq_type: SQType(T)
, 
guard: {T}
, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
rev_uimplies: rev_uimplies(P;Q)
, 
iff: P 
⇐⇒ Q
, 
rev_implies: P 
⇐ Q
, 
req_int_terms: t1 ≡ t2
Lemmas referenced : 
req_witness, 
rcos_wf, 
rsub_wf, 
int-to-real_wf, 
int-rmul_wf, 
rmul_wf, 
rnexp_wf, 
decidable__le, 
full-omega-unsat, 
intformnot_wf, 
intformle_wf, 
itermConstant_wf, 
istype-int, 
int_formula_prop_not_lemma, 
istype-void, 
int_formula_prop_le_lemma, 
int_term_value_constant_lemma, 
int_formula_prop_wf, 
istype-le, 
rsin_wf, 
int-rdiv_wf, 
subtype_base_sq, 
int_subtype_base, 
nequal_wf, 
real_wf, 
req_weakening, 
req_functionality, 
rcos-reduce2, 
rsub_functionality, 
rnexp_functionality, 
rsin-reduce2, 
int-rdiv-int-rdiv, 
rcos_functionality, 
rsin_functionality, 
int-rmul_functionality, 
rmul_functionality, 
rsin-rcos-pythag, 
req_wf, 
radd_wf, 
iff_weakening_uiff, 
radd_functionality, 
rnexp2, 
req_transitivity, 
int-rmul-req, 
radd-preserves-req, 
rminus_wf, 
itermSubtract_wf, 
itermAdd_wf, 
itermMinus_wf, 
itermMultiply_wf, 
itermVar_wf, 
req-iff-rsub-is-0, 
real_polynomial_null, 
real_term_value_sub_lemma, 
real_term_value_add_lemma, 
real_term_value_minus_lemma, 
real_term_value_mul_lemma, 
real_term_value_var_lemma, 
real_term_value_const_lemma
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation_alt, 
introduction, 
cut, 
extract_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
hypothesisEquality, 
hypothesis, 
closedConclusion, 
natural_numberEquality, 
dependent_set_memberEquality_alt, 
dependent_functionElimination, 
unionElimination, 
independent_isectElimination, 
approximateComputation, 
independent_functionElimination, 
dependent_pairFormation_alt, 
lambdaEquality_alt, 
isect_memberEquality_alt, 
voidElimination, 
sqequalRule, 
universeIsType, 
lambdaFormation_alt, 
instantiate, 
cumulativity, 
intEquality, 
equalityTransitivity, 
equalitySymmetry, 
equalityIstype, 
baseClosed, 
sqequalBase, 
because_Cache, 
multiplyEquality, 
inhabitedIsType, 
productElimination, 
int_eqEquality
Latex:
\mforall{}[x:\mBbbR{}].  (rcos(x)  =  (r1  -  8  *  rsin((x)/4)\^{}2  *  rcos((x)/4)\^{}2))
Date html generated:
2019_10_30-AM-11_42_08
Last ObjectModification:
2019_02_02-PM-02_47_50
Theory : reals_2
Home
Index