Nuprl Lemma : upper-bound_wf
∀[A:Set(ℝ)]. ∀[b:ℝ]. (A ≤ b ∈ ℙ)
Proof
Definitions occuring in Statement :
upper-bound: A ≤ b,
rset: Set(ℝ),
real: ℝ,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
upper-bound: A ≤ b,
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
so_apply: x[s]
Lemmas referenced :
all_wf,
real_wf,
rset-member_wf,
rleq_wf,
rset_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
functionEquality,
hypothesisEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[A:Set(\mBbbR{})]. \mforall{}[b:\mBbbR{}]. (A \mleq{} b \mmember{} \mBbbP{})
Date html generated:
2016_05_18-AM-08_08_44
Last ObjectModification:
2015_12_28-AM-01_15_17
Theory : reals
Home
Index