Nuprl Lemma : base-respects-equality
∀[T:Type]. respects-equality(Base;T)
Proof
Definitions occuring in Statement :
respects-equality: respects-equality(S;T),
uall: ∀[x:A]. B[x],
base: Base,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
respects-equality: respects-equality(S;T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ
Lemmas referenced :
trivial-equal,
equal-wf-base,
istype-base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
introduction,
cut,
Error :lambdaFormation_alt,
hypothesis,
thin,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
equalitySymmetry,
hyp_replacement,
applyLambdaEquality,
sqequalRule,
because_Cache,
Error :equalityIsType4,
Error :universeIsType,
Error :inhabitedIsType,
Error :lambdaEquality_alt,
dependent_functionElimination,
axiomEquality,
Error :functionIsTypeImplies,
universeEquality
Latex:
\mforall{}[T:Type]. respects-equality(Base;T)
Date html generated:
2019_06_20-AM-11_13_40
Last ObjectModification:
2018_11_21-AM-10_44_05
Theory : core_2
Home
Index