Nuprl Lemma : addrcos_wf
∀[x:ℝ]. (addrcos(x) ∈ ℕ+ ⟶ ℤ)
Proof
Definitions occuring in Statement :
addrcos: addrcos(x),
real: ℝ,
nat_plus: ℕ+,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
int: ℤ
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
addrcos: addrcos(x),
has-value: (a)↓,
uimplies: b supposing a,
nat_plus: ℕ+,
real: ℝ,
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
true: True,
and: P ∧ Q,
prop: ℙ,
int_nzero: ℤ-o,
nequal: a ≠ b ∈ T ,
not: ¬A,
implies: P ⇒ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
all: ∀x:A. B[x],
top: Top,
subtype_rel: A ⊆r B,
sq_type: SQType(T),
guard: {T}
Lemmas referenced :
value-type-has-value,
int-value-type,
mul_nat_plus,
less_than_wf,
cosine_wf,
int-rdiv_wf,
nat_plus_properties,
satisfiable-full-omega-tt,
intformand_wf,
intformeq_wf,
itermMultiply_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
int_formula_prop_and_lemma,
int_formula_prop_eq_lemma,
int_term_value_mul_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
equal-wf-base,
int_subtype_base,
nequal_wf,
int-to-real_wf,
subtype_base_sq,
true_wf,
nat_plus_wf,
real_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lambdaEquality,
callbyvalueReduce,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
intEquality,
independent_isectElimination,
hypothesis,
multiplyEquality,
natural_numberEquality,
setElimination,
rename,
hypothesisEquality,
because_Cache,
applyEquality,
dependent_set_memberEquality,
independent_pairFormation,
imageMemberEquality,
baseClosed,
lambdaFormation,
dependent_pairFormation,
int_eqEquality,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
computeAll,
baseApply,
closedConclusion,
divideEquality,
addEquality,
addLevel,
instantiate,
cumulativity,
equalityTransitivity,
equalitySymmetry,
independent_functionElimination,
axiomEquality
Latex:
\mforall{}[x:\mBbbR{}]. (addrcos(x) \mmember{} \mBbbN{}\msupplus{} {}\mrightarrow{} \mBbbZ{})
Date html generated:
2017_10_04-PM-10_22_13
Last ObjectModification:
2017_03_01-PM-04_02_53
Theory : reals_2
Home
Index