Nuprl Lemma : left_endpoint_rccint_lemma
∀b,a:Top. (left-endpoint([a, b]) ~ a)
Proof
Definitions occuring in Statement :
rccint: [l, u],
left-endpoint: left-endpoint(I),
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
left-endpoint: left-endpoint(I),
pi1: fst(t),
endpoints: endpoints(I),
rccint: [l, u],
outl: outl(x)
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}b,a:Top. (left-endpoint([a, b]) \msim{} a)
Date html generated:
2016_05_18-AM-08_37_39
Last ObjectModification:
2015_12_27-PM-11_52_09
Theory : reals
Home
Index