Nuprl Lemma : arcsin_functionality

[x:{x:ℝx ∈ [r(-1), r1]} ]. ∀[x':ℝ].  arcsin(x) arcsin(x') supposing x'


Proof




Definitions occuring in Statement :  arcsin: arcsin(a) rccint: [l, u] i-member: r ∈ I req: y int-to-real: r(n) real: uimplies: supposing a uall: [x:A]. B[x] set: {x:A| B[x]}  minus: -n natural_number: $n
Definitions unfolded in proof :  uall: [x:A]. B[x] uimplies: supposing a member: t ∈ T all: x:A. B[x] top: Top and: P ∧ Q cand: c∧ B guard: {T} prop: subtype_rel: A ⊆B i-member: r ∈ I rccint: [l, u] implies:  Q uiff: uiff(P;Q) rev_uimplies: rev_uimplies(P;Q)
Lemmas referenced :  member_rccint_lemma istype-void rleq_transitivity int-to-real_wf rleq_weakening req_inversion rleq_wf arcsin-unique arcsin_wf subtype_rel_self real_wf i-member_wf rccint_wf req_wf rsin_wf req_functionality rsin-arcsin req_weakening
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation_alt cut setElimination thin rename sqequalHypSubstitution introduction extract_by_obid dependent_functionElimination isect_memberEquality_alt voidElimination hypothesis dependent_set_memberEquality_alt hypothesisEquality productElimination isectElimination minusEquality natural_numberEquality independent_isectElimination because_Cache independent_pairFormation sqequalRule productIsType universeIsType equalityTransitivity equalitySymmetry applyEquality setEquality independent_functionElimination setIsType

Latex:
\mforall{}[x:\{x:\mBbbR{}|  x  \mmember{}  [r(-1),  r1]\}  ].  \mforall{}[x':\mBbbR{}].    arcsin(x)  =  arcsin(x')  supposing  x  =  x'



Date html generated: 2019_10_31-AM-06_14_59
Last ObjectModification: 2019_05_24-PM-02_11_26

Theory : reals_2


Home Index