Nuprl Lemma : cover-seq-0
∀[d,a,b:Top]. (cover-seq(d;a;b;0) ~ <a, b>)
Proof
Definitions occuring in Statement :
cover-seq: cover-seq(d;a;b;n),
uall: ∀[x:A]. B[x],
top: Top,
pair: <a, b>,
natural_number: $n,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
cover-seq: cover-seq(d;a;b;n),
all: ∀x:A. B[x],
top: Top
Lemmas referenced :
primrec0_lemma,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
sqequalAxiom,
isectElimination,
hypothesisEquality,
because_Cache
Latex:
\mforall{}[d,a,b:Top]. (cover-seq(d;a;b;0) \msim{} <a, b>)
Date html generated:
2017_10_03-AM-10_03_04
Last ObjectModification:
2017_07_06-PM-02_37_24
Theory : reals
Home
Index