Nuprl Lemma : eq_mFO_wf
∀[x,y:mFOL()]. (eq_mFO(x;y) ∈ 𝔹)
Proof
Definitions occuring in Statement :
eq_mFO: eq_mFO(x;y),
mFOL: mFOL(),
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
eq_mFO: eq_mFO(x;y)
Lemmas referenced :
mFO-equal_wf,
mFOL_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
applyEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[x,y:mFOL()]. (eq\_mFO(x;y) \mmember{} \mBbbB{})
Date html generated:
2016_05_15-PM-10_14_26
Last ObjectModification:
2015_12_27-PM-06_33_01
Theory : minimal-first-order-logic
Home
Index