Nuprl Lemma : rpositive_wf
∀[x:ℕ+ ⟶ ℤ]. (rpositive(x) ∈ ℙ)
Proof
Definitions occuring in Statement :
rpositive: rpositive(x),
nat_plus: ℕ+,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
int: ℤ
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
rpositive: rpositive(x),
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
sq_exists_wf,
nat_plus_wf,
less_than_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
natural_numberEquality,
applyEquality,
hypothesisEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
functionEquality,
intEquality
Latex:
\mforall{}[x:\mBbbN{}\msupplus{} {}\mrightarrow{} \mBbbZ{}]. (rpositive(x) \mmember{} \mBbbP{})
Date html generated:
2016_05_18-AM-07_00_29
Last ObjectModification:
2015_12_28-AM-00_33_17
Theory : reals
Home
Index