Nuprl Lemma : eqmod_inversion
∀m,a,b:ℤ. ((a ≡ b mod m) ⇒ (b ≡ a mod m))
Proof
Definitions occuring in Statement :
eqmod: a ≡ b mod m,
all: ∀x:A. B[x],
implies: P ⇒ Q,
int: ℤ
Definitions unfolded in proof :
eqmod: a ≡ b mod m,
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
uall: ∀[x:A]. B[x],
subtract: n - m,
top: Top,
prop: ℙ
Lemmas referenced :
divisor_of_minus,
subtract_wf,
minus-one-mul,
add-commutes,
istype-void,
minus-add,
minus-minus,
divides_wf,
istype-int
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
Error :lambdaFormation_alt,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
isectElimination,
hypothesis,
independent_functionElimination,
Error :isect_memberEquality_alt,
voidElimination,
because_Cache,
Error :universeIsType,
Error :inhabitedIsType
Latex:
\mforall{}m,a,b:\mBbbZ{}. ((a \mequiv{} b mod m) {}\mRightarrow{} (b \mequiv{} a mod m))
Date html generated:
2019_06_20-PM-02_24_15
Last ObjectModification:
2019_01_17-AM-09_35_50
Theory : num_thy_1
Home
Index