Nuprl Lemma : FOL-sequent-evidence_wf

[s:mFOL-sequent()]. (FOL-sequent-evidence{i:l}(s) ∈ 𝕌')


Proof




Definitions occuring in Statement :  FOL-sequent-evidence: FOL-sequent-evidence{i:l}(s) mFOL-sequent: mFOL-sequent() uall: [x:A]. B[x] member: t ∈ T universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T FOL-sequent-evidence: FOL-sequent-evidence{i:l}(s)
Lemmas referenced :  FO-uniform-evidence_wf mFOL-sequent-freevars_wf FOL-sequent-abstract_wf mFOL-sequent_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{}[s:mFOL-sequent()].  (FOL-sequent-evidence\{i:l\}(s)  \mmember{}  \mBbbU{}')



Date html generated: 2016_05_15-PM-10_27_17
Last ObjectModification: 2015_12_27-PM-06_26_01

Theory : minimal-first-order-logic


Home Index