Nuprl Lemma : rless-by-computation1
∀[x,y:ℝ]. x < y supposing (x 1000) + 4 < y 1000
Proof
Definitions occuring in Statement :
rless: x < y,
real: ℝ,
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
apply: f a,
add: n + m,
natural_number: $n
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
rless: x < y,
sq_exists: ∃x:A [B[x]],
nat_plus: ℕ+,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
not: ¬A,
implies: P ⇒ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
prop: ℙ,
false: False,
real: ℝ
Latex:
\mforall{}[x,y:\mBbbR{}]. x < y supposing (x 1000) + 4 < y 1000
Date html generated:
2020_05_20-AM-10_56_24
Last ObjectModification:
2019_12_09-AM-10_57_16
Theory : reals
Home
Index