Nuprl Lemma : C_TYPE_eq_wf
∀[a,b:C_TYPE()]. (C_TYPE_eq(a;b) ∈ 𝔹)
Proof
Definitions occuring in Statement :
C_TYPE_eq: C_TYPE_eq(a;b),
C_TYPE: C_TYPE(),
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
C_TYPE_eq: C_TYPE_eq(a;b)
Lemmas referenced :
C_TYPE_eq_fun_wf,
C_TYPE_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{}[a,b:C\_TYPE()]. (C\_TYPE\_eq(a;b) \mmember{} \mBbbB{})
Date html generated:
2016_05_16-AM-08_45_50
Last ObjectModification:
2015_12_28-PM-06_57_25
Theory : C-semantics
Home
Index