Nuprl Lemma : int_sq
SQType(ℤ)
Proof
Definitions occuring in Statement :
sq_type: SQType(T),
int: ℤ
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a
Lemmas referenced :
subtype_base_sq,
int_subtype_base
Rules used in proof :
cut,
instantiate,
lemma_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isectElimination,
thin,
cumulativity,
intEquality,
independent_isectElimination,
hypothesis
Latex:
SQType(\mBbbZ{})
Date html generated:
2016_05_13-PM-04_10_25
Last ObjectModification:
2015_12_26-AM-11_22_12
Theory : subtype_1
Home
Index