Nuprl Lemma : lt_int_wf
∀[i,j:ℤ]. (i <z j ∈ 𝔹)
Proof
Definitions occuring in Statement :
lt_int: i <z j,
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T,
int: ℤ
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
lt_int: i <z j
Lemmas referenced :
less-member,
bool_wf,
btrue_wf,
bfalse_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
hypothesisEquality,
sqequalRule,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
intEquality,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[i,j:\mBbbZ{}]. (i <z j \mmember{} \mBbbB{})
Date html generated:
2016_05_13-PM-03_20_08
Last ObjectModification:
2015_12_26-AM-09_09_44
Theory : basic_types
Home
Index