Nuprl Lemma : has-value_wf_base
∀[a:Base]. ((a)↓ ∈ ℙ)
Proof
Definitions occuring in Statement :
has-value: (a)↓,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
base: Base
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
has-value: (a)↓,
prop: ℙ
Lemmas referenced :
base_sq,
base_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
sqleIntensionalEquality,
lemma_by_obid,
hypothesis,
sqequalHypSubstitution,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[a:Base]. ((a)\mdownarrow{} \mmember{} \mBbbP{})
Date html generated:
2016_05_13-PM-03_21_52
Last ObjectModification:
2015_12_26-AM-09_31_55
Theory : call!by!value_1
Home
Index