Nuprl Lemma : sq_stable__sq_or
∀[a,b:ℙ]. SqStable(a ↓∨ b)
Proof
Definitions occuring in Statement :
sq_or: a ↓∨ b,
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
prop: ℙ
Definitions unfolded in proof :
sq_or: a ↓∨ b,
uall: ∀[x:A]. B[x],
member: t ∈ T,
sq_stable: SqStable(P),
implies: P ⇒ Q,
squash: ↓T,
or: P ∨ Q,
prop: ℙ
Lemmas referenced :
squash_wf,
or_wf,
sq_stable__squash
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
lambdaEquality,
dependent_functionElimination,
imageElimination,
imageMemberEquality,
baseClosed,
universeEquality,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[a,b:\mBbbP{}]. SqStable(a \mdownarrow{}\mvee{} b)
Date html generated:
2016_05_13-PM-03_13_16
Last ObjectModification:
2016_01_06-PM-05_48_15
Theory : core_2
Home
Index