Nuprl Lemma : int-mono
mono(ℤ)
Proof
Definitions occuring in Statement :
mono: mono(T),
int: ℤ
Definitions unfolded in proof :
mono: mono(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ
Lemmas referenced :
is-above-int,
is-above_wf,
base_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
independent_isectElimination,
hypothesis,
equalitySymmetry,
intEquality
Latex:
mono(\mBbbZ{})
Date html generated:
2016_05_13-PM-04_13_28
Last ObjectModification:
2015_12_26-AM-11_11_14
Theory : subtype_1
Home
Index