Nuprl Lemma : oobright_wf
∀[A,B:Type]. ∀[rval:B]. (oobright(rval) ∈ one_or_both(A;B))
Proof
Definitions occuring in Statement :
oobright: oobright(rval),
one_or_both: one_or_both(A;B),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
oobright: oobright(rval),
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,
inrEquality,
hypothesisEquality,
productEquality,
thin,
sqequalHypSubstitution,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
isectElimination,
because_Cache,
universeEquality
Latex:
\mforall{}[A,B:Type]. \mforall{}[rval:B]. (oobright(rval) \mmember{} one\_or\_both(A;B))
Date html generated:
2016_05_15-PM-05_32_14
Last ObjectModification:
2015_12_27-PM-02_09_37
Theory : general
Home
Index