Nuprl Lemma : identity-injection
∀[T:Type]. Inj(T;T;λx.x)
Proof
Definitions occuring in Statement : 
inject: Inj(A;B;f)
, 
uall: ∀[x:A]. B[x]
, 
lambda: λx.A[x]
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
inject: Inj(A;B;f)
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
prop: ℙ
Lemmas referenced : 
equal_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
lambdaFormation, 
sqequalRule, 
sqequalHypSubstitution, 
hypothesis, 
extract_by_obid, 
isectElimination, 
thin, 
cumulativity, 
hypothesisEquality, 
applyEquality, 
lambdaEquality, 
dependent_functionElimination, 
axiomEquality, 
universeEquality
Latex:
\mforall{}[T:Type].  Inj(T;T;\mlambda{}x.x)
Date html generated:
2017_04_17-AM-08_07_57
Last ObjectModification:
2017_02_27-PM-04_35_31
Theory : list_1
Home
Index