Nuprl Lemma : reduce_hd_cons_lemma

b,a:Top.  (hd([a b]) a)


Proof




Definitions occuring in Statement :  hd: hd(l) cons: [a b] top: Top all: x:A. B[x] sqequal: t
Definitions unfolded in proof :  all: x:A. B[x] member: t ∈ T hd: hd(l) pi1: fst(t) cons: [a b]
Lemmas referenced :  istype-top
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity Error :lambdaFormation_alt,  cut hypothesis Error :inhabitedIsType,  hypothesisEquality introduction extract_by_obid sqequalRule

Latex:
\mforall{}b,a:Top.    (hd([a  /  b])  \msim{}  a)



Date html generated: 2019_06_20-PM-00_38_17
Last ObjectModification: 2018_10_07-PM-00_40_08

Theory : list_0


Home Index