Nuprl Lemma : seq-len_wf
∀[T:Type]. ∀[s:sequence(T)]. (||s|| ∈ ℕ)
Proof
Definitions occuring in Statement :
seq-len: ||s||,
sequence: sequence(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
seq-len: ||s||,
sequence: sequence(T),
pi1: fst(t)
Lemmas referenced :
sequence_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
sqequalHypSubstitution,
productElimination,
thin,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
extract_by_obid,
isectElimination,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[s:sequence(T)]. (||s|| \mmember{} \mBbbN{})
Date html generated:
2018_07_25-PM-01_28_14
Last ObjectModification:
2018_06_11-PM-01_11_20
Theory : arithmetic
Home
Index