Nuprl Lemma : church_fst_lemma
∀y,x:Top. (church-fst() (church-pair() x y) ~ x)
Proof
Definitions occuring in Statement :
church-fst: church-fst(),
church-pair: church-pair(),
top: Top,
all: ∀x:A. B[x],
apply: f a,
sqequal: s ~ t
Definitions unfolded in proof :
member: t ∈ T,
all: ∀x:A. B[x],
church-pair: church-pair(),
church-fst: church-fst(),
church-true: church-true()
Lemmas referenced :
top_wf
Rules used in proof :
lemma_by_obid,
hypothesis,
cut,
lambdaFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution,
sqequalRule
Latex:
\mforall{}y,x:Top. (church-fst() (church-pair() x y) \msim{} x)
Date html generated:
2020_05_20-AM-08_06_02
Last ObjectModification:
2020_01_24-PM-02_03_40
Theory : general
Home
Index