Nuprl Lemma : qle-normalize

[a,b:ℚ].  uiff(a ≤ b;0 ≤ (b a))


Proof




Definitions occuring in Statement :  qle: r ≤ s qsub: s rationals: uiff: uiff(P;Q) uall: [x:A]. B[x] natural_number: $n
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a subtype_rel: A ⊆B implies:  Q prop: guard: {T} rev_uimplies: rev_uimplies(P;Q) true: True qsub: s squash: T iff: ⇐⇒ Q rev_implies:  Q
Lemmas referenced :  iff_weakening_equal mon_ident_q qadd_inv_assoc_q qadd_comm_q true_wf squash_wf qadd_wf qmul_wf qadd_preserves_qle rationals_wf qle_wf qsub_wf int-subtype-rationals qle_witness
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut independent_pairFormation lemma_by_obid sqequalHypSubstitution isectElimination thin natural_numberEquality hypothesis applyEquality sqequalRule hypothesisEquality independent_functionElimination because_Cache productElimination independent_pairEquality isect_memberEquality equalityTransitivity equalitySymmetry independent_isectElimination minusEquality lambdaEquality imageElimination imageMemberEquality baseClosed universeEquality

Latex:
\mforall{}[a,b:\mBbbQ{}].    uiff(a  \mleq{}  b;0  \mleq{}  (b  -  a))



Date html generated: 2016_05_15-PM-11_05_39
Last ObjectModification: 2016_01_16-PM-09_27_54

Theory : rationals


Home Index