Nuprl Lemma : union-wf
∀[A,B:Type]. (A + B ∈ Type)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x]
,
member: t ∈ T
,
union: left + right
,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x]
,
member: t ∈ T
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
unionEquality,
hypothesisEquality,
sqequalHypSubstitution,
hypothesis,
sqequalRule,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality,
isect_memberEquality,
isectElimination,
thin,
because_Cache
Latex:
\mforall{}[A,B:Type]. (A + B \mmember{} Type)
Date html generated:
2016_05_13-PM-03_07_02
Last ObjectModification:
2016_01_06-PM-05_28_46
Theory : core_2
Home
Index