Nuprl Lemma : decidable__equal_name
∀x,y:Name. Dec(x = y ∈ Name)
Proof
Definitions occuring in Statement :
name: Name,
decidable: Dec(P),
all: ∀x:A. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
uiff: uiff(P;Q),
and: P ∧ Q,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Lemmas referenced :
name_wf,
equal_wf,
assert_wf,
name_eq_wf,
decidable__assert,
decidable_functionality,
iff_weakening_uiff,
assert-name_eq
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
lemma_by_obid,
hypothesis,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
dependent_functionElimination,
independent_functionElimination,
productElimination,
independent_pairFormation
Latex:
\mforall{}x,y:Name. Dec(x = y)
Date html generated:
2016_05_14-PM-03_34_27
Last ObjectModification:
2015_12_26-PM-06_00_18
Theory : decidable!equality
Home
Index