Nuprl Lemma : weak-overt_wf
∀[X:Type]. (wOvert(X) ∈ ℙ')
Proof
Definitions occuring in Statement :
weak-overt: wOvert(X),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
weak-overt: wOvert(X),
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
prop: ℙ
Lemmas referenced :
uall_wf,
exists_wf,
Open_wf,
all_wf,
iff_wf,
in-open_wf,
not_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
thin,
instantiate,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
universeEquality,
lambdaEquality,
functionEquality,
productEquality,
cumulativity,
hypothesisEquality,
hypothesis,
because_Cache,
applyEquality,
independent_pairEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[X:Type]. (wOvert(X) \mmember{} \mBbbP{}')
Date html generated:
2019_10_31-AM-07_19_14
Last ObjectModification:
2015_12_28-AM-11_21_26
Theory : synthetic!topology
Home
Index