Nuprl Lemma : one-mul
∀[x:ℤ]. (1 * x ~ x)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
multiply: n * m,
natural_number: $n,
int: ℤ,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
guard: {T},
implies: P ⇒ Q,
sq_type: SQType(T),
uimplies: b supposing a
Lemmas referenced :
istype-int,
subtype_base_sq,
int_subtype_base
Rules used in proof :
cut,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :lambdaFormation_alt,
multiplyOne,
hypothesisEquality,
hypothesis,
introduction,
extract_by_obid,
intEquality,
axiomSqEquality,
isect_memberFormation,
thin,
dependent_functionElimination,
sqequalHypSubstitution,
independent_functionElimination,
equalitySymmetry,
equalityTransitivity,
independent_isectElimination,
cumulativity,
isectElimination,
lemma_by_obid,
instantiate
Latex:
\mforall{}[x:\mBbbZ{}]. (1 * x \msim{} x)
Date html generated:
2019_06_20-AM-11_22_08
Last ObjectModification:
2018_10_16-PM-00_59_48
Theory : arithmetic
Home
Index