Nuprl Lemma : predicate_or_wf
∀[T:Type]. ∀[P1,P2:T ⟶ ℙ]. (P1 ∨ P2 ∈ T ⟶ ℙ)
Proof
Definitions occuring in Statement :
predicate_or: P1 ∨ P2,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
predicate_or: P1 ∨ P2,
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ
Lemmas referenced :
or_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
lambdaEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
applyEquality,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
functionEquality,
cumulativity,
universeEquality,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[T:Type]. \mforall{}[P1,P2:T {}\mrightarrow{} \mBbbP{}]. (P1 \mvee{} P2 \mmember{} T {}\mrightarrow{} \mBbbP{})
Date html generated:
2016_05_14-AM-06_05_33
Last ObjectModification:
2015_12_26-AM-11_32_50
Theory : relations
Home
Index