Nuprl Lemma : rsin-bounds

x:ℝ(rsin(x) ∈ [r(-1), r1])


Proof




Definitions occuring in Statement :  rsin: rsin(x) rccint: [l, u] i-member: r ∈ I int-to-real: r(n) real: all: x:A. B[x] minus: -n natural_number: $n
Definitions unfolded in proof :  all: x:A. B[x] member: t ∈ T top: Top uall: [x:A]. B[x] iff: ⇐⇒ Q and: P ∧ Q implies:  Q cand: c∧ B squash: T prop: true: True subtype_rel: A ⊆B uimplies: supposing a guard: {T}
Lemmas referenced :  rabs-rsin-rleq member_rccint_lemma istype-void rabs-rleq-iff rsin_wf int-to-real_wf rleq_wf squash_wf true_wf rminus-int subtype_rel_self iff_weakening_equal real_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity lambdaFormation_alt cut introduction extract_by_obid sqequalHypSubstitution dependent_functionElimination thin hypothesisEquality isect_memberEquality_alt voidElimination hypothesis isectElimination natural_numberEquality productElimination independent_functionElimination applyEquality lambdaEquality_alt imageElimination because_Cache equalityTransitivity equalitySymmetry universeIsType inhabitedIsType sqequalRule imageMemberEquality baseClosed instantiate universeEquality independent_isectElimination independent_pairFormation

Latex:
\mforall{}x:\mBbbR{}.  (rsin(x)  \mmember{}  [r(-1),  r1])



Date html generated: 2019_10_30-AM-11_41_38
Last ObjectModification: 2019_05_23-AM-10_11_53

Theory : reals_2


Home Index