Nuprl Lemma : implies-usquash2
∀[T:ℙ]. (T 
⇒ usquash(T))
Proof
Definitions occuring in Statement : 
usquash: usquash(T)
, 
uall: ∀[x:A]. B[x]
, 
prop: ℙ
, 
implies: P 
⇒ Q
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
implies: P 
⇒ Q
, 
all: ∀x:A. B[x]
, 
prop: ℙ
Lemmas referenced : 
implies-usquash
Rules used in proof : 
cut, 
introduction, 
extract_by_obid, 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation_alt, 
hypothesis, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
hypothesisEquality, 
lambdaFormation_alt, 
independent_functionElimination, 
dependent_functionElimination, 
Error :memTop, 
universeIsType, 
universeEquality
Latex:
\mforall{}[T:\mBbbP{}].  (T  {}\mRightarrow{}  usquash(T))
Date html generated:
2020_05_19-PM-09_35_55
Last ObjectModification:
2020_05_18-AM-09_49_48
Theory : per!type!1
Home
Index