Nuprl Lemma : qmul-positive2

a,b:ℚ.  ((0 < a ∧ 0 < b) ∨ (a < 0 ∧ b < 0) ⇐⇒ 0 < b)


Proof




Definitions occuring in Statement :  qless: r < s qmul: s rationals: all: x:A. B[x] iff: ⇐⇒ Q or: P ∨ Q and: P ∧ Q natural_number: $n
Definitions unfolded in proof :  all: x:A. B[x] member: t ∈ T iff: ⇐⇒ Q and: P ∧ Q implies:  Q or: P ∨ Q prop: uall: [x:A]. B[x] subtype_rel: A ⊆B guard: {T} uimplies: supposing a qless: r < s grp_lt: a < b set_lt: a <b assert: b ifthenelse: if then else fi  set_blt: a <b b band: p ∧b q infix_ap: y set_le: b pi2: snd(t) oset_of_ocmon: g↓oset dset_of_mon: g↓set grp_le: b pi1: fst(t) qadd_grp: <ℚ+> q_le: q_le(r;s) callbyvalueall: callbyvalueall evalall: evalall(t) bor: p ∨bq qpositive: qpositive(r) qsub: s qadd: s qmul: s btrue: tt lt_int: i <j bnot: ¬bb bfalse: ff qeq: qeq(r;s) eq_int: (i =z j) true: True uiff: uiff(P;Q) rev_uimplies: rev_uimplies(P;Q) rev_implies:  Q squash: T
Lemmas referenced :  qinv_inv_q true_wf squash_wf rationals_wf iff_weakening_equal qmul_zero_qrng int-subtype-rationals or_wf qmul_reverses_qless qmul_wf qless_wf and_wf qmul-positive
Rules used in proof :  cut lemma_by_obid sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity lambdaFormation hypothesis sqequalHypSubstitution dependent_functionElimination thin hypothesisEquality independent_pairFormation productElimination independent_functionElimination unionElimination inlFormation isectElimination natural_numberEquality applyEquality because_Cache sqequalRule minusEquality inrFormation promote_hyp independent_isectElimination lambdaEquality imageElimination imageMemberEquality baseClosed equalityTransitivity equalitySymmetry universeEquality

Latex:
\mforall{}a,b:\mBbbQ{}.    ((0  <  a  \mwedge{}  0  <  b)  \mvee{}  (a  <  0  \mwedge{}  b  <  0)  \mLeftarrow{}{}\mRightarrow{}  0  <  a  *  b)



Date html generated: 2016_05_15-PM-11_00_51
Last ObjectModification: 2016_01_16-PM-09_30_46

Theory : rationals


Home Index