Nuprl Lemma : rabs-sine-rleq

x:ℝ(|sine(x)| ≤ r1)


Proof




Definitions occuring in Statement :  sine: sine(x) rleq: x ≤ y rabs: |x| int-to-real: r(n) real: all: x:A. B[x] natural_number: $n
Definitions unfolded in proof :  all: x:A. B[x] member: t ∈ T uall: [x:A]. B[x] implies:  Q iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q le: A ≤ B less_than': less_than'(a;b) false: False not: ¬A prop: nat_plus: + less_than: a < b squash: T true: True nat: uimplies: supposing a uiff: uiff(P;Q) rev_uimplies: rev_uimplies(P;Q) so_lambda: λ2x.t[x] so_apply: x[s] exp: i^n primrec: primrec(n;b;c) subtract: m subtype_rel: A ⊆B guard: {T} sq_type: SQType(T) rsub: y
Lemmas referenced :  sine-cosine-pythag real_wf rnexp-rleq-iff rabs_wf sine_wf int-to-real_wf zero-rleq-rabs rleq-int false_wf less_than_wf rnexp_wf le_wf rnexp2-nonneg rleq_functionality req_inversion rabs-rnexp req_weakening rabs-of-nonneg exp_wf2 subtype_base_sq nat_plus_wf set_subtype_base int_subtype_base equal_wf squash_wf true_wf exp-one iff_weakening_equal radd-preserves-req radd_wf cosine_wf rminus_wf req_wf rnexp-int uiff_transitivity req_functionality radd_functionality radd_comm radd-ac radd-rminus-assoc radd-preserves-rleq rsub_wf rleq_wf radd-assoc req_transitivity radd-rminus-both
Rules used in proof :  cut introduction extract_by_obid sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity lambdaFormation hypothesis sqequalHypSubstitution dependent_functionElimination thin hypothesisEquality isectElimination natural_numberEquality independent_functionElimination productElimination sqequalRule independent_pairFormation dependent_set_memberEquality imageMemberEquality baseClosed because_Cache independent_isectElimination instantiate cumulativity intEquality lambdaEquality applyEquality imageElimination equalityTransitivity equalitySymmetry universeEquality

Latex:
\mforall{}x:\mBbbR{}.  (|sine(x)|  \mleq{}  r1)



Date html generated: 2017_10_04-PM-10_20_48
Last ObjectModification: 2017_07_28-AM-08_48_09

Theory : reals_2


Home Index