Nuprl Lemma : pi1_cons_lemma
∀b,a:Top. (fst([a / b]) ~ a)
Proof
Definitions occuring in Statement :
cons: [a / b],
top: Top,
pi1: fst(t),
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
cons: [a / b],
pi1: fst(t)
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}b,a:Top. (fst([a / b]) \msim{} a)
Date html generated:
2016_05_14-AM-06_26_02
Last ObjectModification:
2015_12_26-PM-00_42_11
Theory : list_0
Home
Index