Nuprl Lemma : un-ctrex1_wf
∀[x:{x:ℝ| r(-1) ≤ x} ]. (un-ctrex1(x) ∈ ℝ)
Proof
Definitions occuring in Statement :
un-ctrex1: un-ctrex1(x),
rleq: x ≤ y,
int-to-real: r(n),
real: ℝ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
minus: -n,
natural_number: $n
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
un-ctrex1: un-ctrex1(x),
int_upper: {i...},
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
uimplies: b supposing a,
all: ∀x:A. B[x],
itermConstant: "const",
req_int_terms: t1 ≡ t2,
top: Top,
uiff: uiff(P;Q),
subtype_rel: A ⊆r B,
nat: ℕ,
int_nzero: ℤ-o,
true: True,
nequal: a ≠ b ∈ T ,
sq_type: SQType(T),
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
bfalse: ff,
ifthenelse: if b then t else f fi ,
assert: ↑b,
eq_int: (i =z j),
absval: |i|,
modulus: a mod n,
isEven: isEven(n)
Lemmas referenced :
radd_wf,
rsub_wf,
rroot_wf,
false_wf,
le_wf,
rleq-implies-rleq,
int-to-real_wf,
real_term_polynomial,
itermSubtract_wf,
itermVar_wf,
itermConstant_wf,
itermAdd_wf,
real_term_value_const_lemma,
real_term_value_sub_lemma,
real_term_value_var_lemma,
real_term_value_add_lemma,
req-iff-rsub-is-0,
assert_wf,
isEven_wf,
rleq_wf,
rmul_wf,
real_wf,
req_wf,
rnexp_wf,
int-rdiv_wf,
subtype_base_sq,
int_subtype_base,
equal-wf-base,
true_wf,
nequal_wf,
set_wf,
equal_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
setElimination,
thin,
rename,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
dependent_set_memberEquality,
natural_numberEquality,
independent_pairFormation,
lambdaFormation,
hypothesis,
hypothesisEquality,
minusEquality,
independent_isectElimination,
dependent_functionElimination,
computeAll,
lambdaEquality,
int_eqEquality,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
productElimination,
functionEquality,
applyEquality,
because_Cache,
setEquality,
productEquality,
addLevel,
instantiate,
cumulativity,
equalityTransitivity,
equalitySymmetry,
independent_functionElimination,
baseClosed,
axiomEquality,
lemma_by_obid,
sqleReflexivity,
callbyvalueReduce
Latex:
\mforall{}[x:\{x:\mBbbR{}| r(-1) \mleq{} x\} ]. (un-ctrex1(x) \mmember{} \mBbbR{})
Date html generated:
2017_10_04-PM-10_54_37
Last ObjectModification:
2017_07_28-AM-08_52_14
Theory : reals_2
Home
Index