Nuprl Lemma : qmin_ub
∀[a,b,c:ℚ]. uiff(a ≤ qmin(b;c);(a ≤ b) ∧ (a ≤ c))
Proof
Definitions occuring in Statement :
qmin: qmin(x;y),
qle: r ≤ s,
rationals: ℚ,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
and: P ∧ Q
Definitions unfolded in proof :
qmin: qmin(x;y),
member: t ∈ T,
uall: ∀[x:A]. B[x],
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
guard: {T},
implies: P ⇒ Q,
prop: ℙ,
true: True,
all: ∀x:A. B[x],
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
squash: ↓T
Lemmas referenced :
q_le_wf,
bool_wf,
equal-wf-T-base,
assert_wf,
qle_wf,
qle_transitivity_qorder,
qle_witness,
bnot_wf,
not_wf,
qle_complement_qorder,
qless_transitivity_1_qorder,
qle_weakening_lt_qorder,
qmin_wf,
rationals_wf,
uiff_transitivity2,
eqtt_to_assert,
assert-q_le-eq,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
squash_wf,
true_wf,
equal_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
equalityTransitivity,
equalitySymmetry,
baseClosed,
because_Cache,
independent_pairFormation,
isect_memberFormation,
independent_isectElimination,
sqequalRule,
productElimination,
independent_pairEquality,
independent_functionElimination,
productEquality,
natural_numberEquality,
isect_memberEquality,
lambdaFormation,
unionElimination,
equalityElimination,
applyEquality,
lambdaEquality,
imageElimination,
universeEquality,
imageMemberEquality,
dependent_functionElimination
Latex:
\mforall{}[a,b,c:\mBbbQ{}]. uiff(a \mleq{} qmin(b;c);(a \mleq{} b) \mwedge{} (a \mleq{} c))
Date html generated:
2018_05_21-PM-11_54_59
Last ObjectModification:
2017_07_26-PM-06_45_53
Theory : rationals
Home
Index