Nuprl Lemma : FOL-evidence_wf
∀[fmla:mFOL()]. (FOL-evidence{i:l}(fmla) ∈ 𝕌')
Proof
Definitions occuring in Statement :
FOL-evidence: FOL-evidence{i:l}(fmla),
mFOL: mFOL(),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
FOL-evidence: FOL-evidence{i:l}(fmla)
Lemmas referenced :
FO-uniform-evidence_wf,
mFOL-freevars_wf,
FOL-abstract_wf,
mFOL_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[fmla:mFOL()]. (FOL-evidence\{i:l\}(fmla) \mmember{} \mBbbU{}')
Date html generated:
2016_05_15-PM-10_18_52
Last ObjectModification:
2015_12_27-PM-06_31_17
Theory : minimal-first-order-logic
Home
Index