Nuprl Lemma : equal-wf-base
∀[A:Type]. ∀[a,b:Base]. (a = b ∈ A ∈ ℙ)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
base: Base,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
member: t ∈ T,
uall: ∀[x:A]. B[x],
prop: ℙ
Lemmas referenced :
base_wf
Rules used in proof :
universeEquality,
extract_by_obid,
introduction,
because_Cache,
hypothesis,
sqequalHypSubstitution,
cut,
isect_memberFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution,
hypothesisEquality,
equalityEquality,
equalityTransitivity,
equalitySymmetry,
sqequalBase
Latex:
\mforall{}[A:Type]. \mforall{}[a,b:Base]. (a = b \mmember{} \mBbbP{})
Date html generated:
2019_06_20-AM-11_13_37
Last ObjectModification:
2018_11_24-PM-08_39_20
Theory : core_2
Home
Index