Nuprl Lemma : trivial-equal
∀[A:Type]. ∀[a:A]. (a = a ∈ A)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
hypothesisEquality,
sqequalRule,
sqequalHypSubstitution,
isect_memberEquality,
isectElimination,
thin,
axiomEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[A:Type]. \mforall{}[a:A]. (a = a)
Date html generated:
2016_05_13-PM-03_06_39
Last ObjectModification:
2016_01_06-PM-05_29_04
Theory : core_2
Home
Index