Nuprl Lemma : sq-decider-name-deq
sq-decider(NameDeq)
Proof
Definitions occuring in Statement :
name-deq: NameDeq,
sq-decider: sq-decider(eq)
Definitions unfolded in proof :
name-deq: NameDeq,
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a
Lemmas referenced :
sq-decider-atom-deq,
sq-decider-list-deq
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
baseClosed,
independent_isectElimination,
hypothesis
Latex:
sq-decider(NameDeq)
Date html generated:
2016_05_14-PM-03_34_06
Last ObjectModification:
2016_01_14-PM-11_19_02
Theory : decidable!equality
Home
Index