Nuprl Lemma : small-reciprocal
∀e:ℚ. ∃m:ℕ+. (1/m) < e supposing 0 < e
Proof
Definitions occuring in Statement :
qless: r < s,
qdiv: (r/s),
rationals: ℚ,
nat_plus: ℕ+,
uimplies: b supposing a,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
natural_number: $n
Definitions unfolded in proof :
member: t ∈ T,
experimental: experimental{impliesFunctionality}(possibleextract),
small-reciprocal-proof,
q-elim,
rem_bounds_1,
qmul_preserves_qless,
any: any x,
uall: ∀[x:A]. B[x],
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
so_lambda: λ2x y.t[x; y],
top: Top,
so_apply: x[s1;s2],
uimplies: b supposing a
Lemmas referenced :
small-reciprocal-proof,
lifting-strict-spread,
istype-void,
strict4-spread,
q-elim,
rem_bounds_1,
qmul_preserves_qless
Rules used in proof :
introduction,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
instantiate,
extract_by_obid,
hypothesis,
sqequalRule,
thin,
sqequalHypSubstitution,
equalityTransitivity,
equalitySymmetry,
isectElimination,
baseClosed,
isect_memberEquality_alt,
voidElimination,
independent_isectElimination
Latex:
\mforall{}e:\mBbbQ{}. \mexists{}m:\mBbbN{}\msupplus{}. (1/m) < e supposing 0 < e
Date html generated:
2019_10_16-PM-00_32_14
Last ObjectModification:
2019_06_26-PM-04_15_36
Theory : rationals
Home
Index