Nuprl Lemma : strict_wf
∀F:Base. (strict(F) ∈ ℙ)
Proof
Definitions occuring in Statement :
strict: strict(F),
prop: ℙ,
all: ∀x:A. B[x],
member: t ∈ T,
base: Base
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
strict: strict(F),
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
so_apply: x[s]
Lemmas referenced :
is-exception_wf,
has-value_wf_base,
base_wf,
all_wf,
and_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
functionEquality,
baseApply,
closedConclusion,
baseClosed,
hypothesisEquality,
sqequalIntensionalEquality
Latex:
\mforall{}F:Base. (strict(F) \mmember{} \mBbbP{})
Date html generated:
2016_05_13-PM-03_23_11
Last ObjectModification:
2016_01_14-PM-06_46_16
Theory : call!by!value_1
Home
Index