Nuprl Lemma : or_wf
∀[A,B:ℙ]. (A ∨ B ∈ ℙ)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
prop: ℙ,
or: P ∨ Q,
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
or: P ∨ Q,
prop: ℙ
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:\mBbbP{}]. (A \mvee{} B \mmember{} \mBbbP{})
Date html generated:
2016_05_13-PM-03_06_56
Last ObjectModification:
2016_01_06-PM-05_28_50
Theory : core_2
Home
Index