Nuprl Lemma : arcsin-unique

[x:{x:ℝx ∈ [r(-1), r1]} ]. ∀[y:{y:ℝy ∈ [-(π/2), π/2]} ].  ((rsin(y) x)  (arcsin(x) y))


Proof




Definitions occuring in Statement :  arcsin: arcsin(a) halfpi: π/2 rsin: rsin(x) rccint: [l, u] i-member: r ∈ I req: y rminus: -(x) int-to-real: r(n) real: uall: [x:A]. B[x] implies:  Q set: {x:A| B[x]}  minus: -n natural_number: $n
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T implies:  Q prop: subtype_rel: A ⊆B all: x:A. B[x] top: Top uimplies: supposing a not: ¬A rneq: x ≠ y or: P ∨ Q strictly-increasing-on-interval: f[x] strictly-increasing for x ∈ I so_lambda: λ2x.t[x] and: P ∧ Q so_apply: x[s] cand: c∧ B guard: {T} false: False
Lemmas referenced :  rsin-arcsin req_wf rsin_wf req_witness arcsin_wf member_rccint_lemma istype-void real_wf i-member_wf rccint_wf rminus_wf halfpi_wf int-to-real_wf rsin-strictly-increasing2 not-rneq rneq_wf subtype_rel_sets_simple req_inversion rless_transitivity1 rleq_weakening rless_irreflexivity
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation_alt introduction cut lambdaFormation_alt extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality universeIsType setElimination rename hypothesis sqequalRule lambdaEquality_alt dependent_functionElimination applyEquality isect_memberEquality_alt voidElimination inhabitedIsType equalityTransitivity equalitySymmetry because_Cache independent_functionElimination functionIsTypeImplies setIsType isectIsTypeImplies minusEquality natural_numberEquality independent_isectElimination unionElimination productEquality productElimination productIsType

Latex:
\mforall{}[x:\{x:\mBbbR{}|  x  \mmember{}  [r(-1),  r1]\}  ].  \mforall{}[y:\{y:\mBbbR{}|  y  \mmember{}  [-(\mpi{}/2),  \mpi{}/2]\}  ].    ((rsin(y)  =  x)  {}\mRightarrow{}  (arcsin(x)  =  y))



Date html generated: 2019_10_31-AM-06_14_51
Last ObjectModification: 2019_05_23-AM-10_14_28

Theory : reals_2


Home Index