Nuprl Lemma : qmin-eq-iff-2
∀[q,r:ℚ]. uiff(qmin(q;r) = r ∈ ℚ;r ≤ q)
Proof
Definitions occuring in Statement :
qmin: qmin(x;y),
qle: r ≤ s,
rationals: ℚ,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
rev_implies: P ⇐ Q,
not: ¬A,
false: False,
assert: ↑b,
bnot: ¬bb,
sq_type: SQType(T),
or: P ∨ Q,
exists: ∃x:A. B[x],
bfalse: ff,
ifthenelse: if b then t else f fi ,
iff: P ⇐⇒ Q,
guard: {T},
prop: ℙ,
uimplies: b supposing a,
and: P ∧ Q,
uiff: uiff(P;Q),
btrue: tt,
it: ⋅,
unit: Unit,
bool: 𝔹,
implies: P ⇒ Q,
all: ∀x:A. B[x],
qmin: qmin(x;y),
member: t ∈ T,
uall: ∀[x:A]. B[x]
Lemmas referenced :
rationals_wf,
qle_weakening_lt_qorder,
qless_trichot_qorder,
assert-bnot,
bool_subtype_base,
bool_wf,
subtype_base_sq,
bool_cases_sqequal,
eqff_to_assert,
qle_wf,
qle_antisymmetry,
qle_witness,
qle_weakening_eq_qorder,
iff_weakening_equal,
assert-q_le-eq,
eqtt_to_assert,
q_le_wf
Rules used in proof :
axiomEquality,
isectIsTypeImplies,
isect_memberEquality_alt,
independent_pairEquality,
voidElimination,
because_Cache,
cumulativity,
instantiate,
dependent_functionElimination,
promote_hyp,
dependent_pairFormation_alt,
universeIsType,
equalityIstype,
independent_pairFormation,
sqequalRule,
independent_functionElimination,
independent_isectElimination,
productElimination,
equalitySymmetry,
equalityTransitivity,
equalityElimination,
unionElimination,
lambdaFormation_alt,
inhabitedIsType,
hypothesis,
hypothesisEquality,
thin,
isectElimination,
sqequalHypSubstitution,
extract_by_obid,
cut,
introduction,
isect_memberFormation_alt,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}[q,r:\mBbbQ{}]. uiff(qmin(q;r) = r;r \mleq{} q)
Date html generated:
2019_10_29-AM-07_44_19
Last ObjectModification:
2019_10_21-PM-06_10_22
Theory : rationals
Home
Index