Nuprl Lemma : cons-seq_wf
∀[T:Type]. ∀[k:ℕ]. ∀[x:T]. ∀[s:ℕk ⟶ T]. (cons-seq(x;s) ∈ ℕk + 1 ⟶ T)
Proof
Definitions occuring in Statement :
cons-seq: cons-seq(x;s),
int_seg: {i..j-},
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
add: n + m,
natural_number: $n,
universe: Type
Definitions unfolded in proof :
cons-seq: cons-seq(x;s),
uall: ∀[x:A]. B[x],
member: t ∈ T,
int_seg: {i..j-},
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
nat: ℕ,
lelt: i ≤ j < k,
nequal: a ≠ b ∈ T ,
ge: i ≥ j ,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top
Lemmas referenced :
eq_int_wf,
bool_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_int,
int_seg_wf,
subtract_wf,
int_seg_properties,
nat_properties,
decidable__le,
satisfiable-full-omega-tt,
intformand_wf,
intformnot_wf,
intformle_wf,
itermConstant_wf,
itermSubtract_wf,
itermVar_wf,
intformeq_wf,
int_formula_prop_and_lemma,
int_formula_prop_not_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_subtract_lemma,
int_term_value_var_lemma,
int_formula_prop_eq_lemma,
int_formula_prop_wf,
decidable__lt,
intformless_wf,
itermAdd_wf,
int_formula_prop_less_lemma,
int_term_value_add_lemma,
lelt_wf,
nat_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
lambdaEquality,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
setElimination,
rename,
because_Cache,
hypothesis,
natural_numberEquality,
lambdaFormation,
unionElimination,
equalityElimination,
hypothesisEquality,
productElimination,
independent_isectElimination,
equalityTransitivity,
equalitySymmetry,
dependent_pairFormation,
promote_hyp,
dependent_functionElimination,
instantiate,
cumulativity,
independent_functionElimination,
voidElimination,
applyEquality,
functionExtensionality,
dependent_set_memberEquality,
independent_pairFormation,
addEquality,
int_eqEquality,
intEquality,
isect_memberEquality,
voidEquality,
computeAll,
axiomEquality,
functionEquality,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[k:\mBbbN{}]. \mforall{}[x:T]. \mforall{}[s:\mBbbN{}k {}\mrightarrow{} T]. (cons-seq(x;s) \mmember{} \mBbbN{}k + 1 {}\mrightarrow{} T)
Date html generated:
2018_05_22-AM-00_34_33
Last ObjectModification:
2017_07_26-PM-06_59_51
Theory : randomness
Home
Index