Nuprl Lemma : assert-name-deq
∀[x,y:Name]. uiff(↑(NameDeq x y);x = y ∈ Name)
Proof
Definitions occuring in Statement :
name-deq: NameDeq,
name: Name,
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
apply: f a,
equal: s = t ∈ T
Definitions unfolded in proof :
name_eq: name_eq(x;y)
Lemmas referenced :
assert-name_eq
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
cut,
lemma_by_obid,
hypothesis
Latex:
\mforall{}[x,y:Name]. uiff(\muparrow{}(NameDeq x y);x = y)
Date html generated:
2016_05_14-PM-03_34_17
Last ObjectModification:
2015_12_26-PM-06_00_29
Theory : decidable!equality
Home
Index