Nuprl Lemma : replace-seq-from_wf
∀[T:Type]. ∀[s:ℕ ⟶ T]. ∀[n:ℕ]. ∀[k:T]. (replace-seq-from(s;n;k) ∈ ℕ ⟶ T)
Proof
Definitions occuring in Statement :
replace-seq-from: replace-seq-from(s;n;k),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
replace-seq-from: replace-seq-from(s;n;k),
nat: ℕ,
less_than: a < b,
and: P ∧ Q,
less_than': less_than'(a;b),
true: True,
squash: ↓T,
top: Top,
not: ¬A,
implies: P ⇒ Q,
false: False,
prop: ℙ
Lemmas referenced :
top_wf,
less_than_wf,
nat_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lambdaEquality,
sqequalHypSubstitution,
setElimination,
thin,
rename,
hypothesisEquality,
hypothesis,
lessCases,
independent_pairFormation,
isectElimination,
baseClosed,
natural_numberEquality,
equalityTransitivity,
equalitySymmetry,
imageMemberEquality,
axiomSqEquality,
extract_by_obid,
isect_memberEquality,
because_Cache,
voidElimination,
voidEquality,
lambdaFormation,
imageElimination,
productElimination,
independent_functionElimination,
applyEquality,
axiomEquality,
functionEquality,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[s:\mBbbN{} {}\mrightarrow{} T]. \mforall{}[n:\mBbbN{}]. \mforall{}[k:T]. (replace-seq-from(s;n;k) \mmember{} \mBbbN{} {}\mrightarrow{} T)
Date html generated:
2019_06_20-PM-02_57_05
Last ObjectModification:
2018_08_20-PM-09_39_06
Theory : continuity
Home
Index