Nuprl Lemma : one_or_both_wf
∀[A,B:Type]. (one_or_both(A;B) ∈ Type)
Proof
Definitions occuring in Statement :
one_or_both: one_or_both(A;B),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
one_or_both: one_or_both(A;B),
uall: ∀[x:A]. B[x],
member: t ∈ T
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
unionEquality,
productEquality,
hypothesisEquality,
thin,
sqequalHypSubstitution,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality,
isect_memberEquality,
isectElimination,
because_Cache
Latex:
\mforall{}[A,B:Type]. (one\_or\_both(A;B) \mmember{} Type)
Date html generated:
2016_05_15-PM-05_31_01
Last ObjectModification:
2015_12_27-PM-02_10_28
Theory : general
Home
Index