Nuprl Lemma : FOL-proveable_wf
∀[s:mFOL-sequent()]. (FOL-proveable(s) ∈ ℙ)
Proof
Definitions occuring in Statement :
FOL-proveable: FOL-proveable(s),
mFOL-sequent: mFOL-sequent(),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
FOL-proveable: FOL-proveable(s)
Lemmas referenced :
proveable_wf,
mFOL-sequent_wf,
FOLRule_wf,
FOLeffect_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
hypothesisEquality,
productEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[s:mFOL-sequent()]. (FOL-proveable(s) \mmember{} \mBbbP{})
Date html generated:
2016_05_15-PM-10_28_39
Last ObjectModification:
2015_12_27-PM-06_25_09
Theory : minimal-first-order-logic
Home
Index