Step
*
1
1
of Lemma
eqmod_cancellation
1. m : ℤ
2. x : ℤ
3. a : ℤ
4. b : ℤ
5. CoPrime(x,m)
6. m | ((x * a) - x * b)
⊢ CoPrime(m,x)
BY
{ TACTIC:(Unfold `coprime` 0 THEN (BLemma `gcd_p_sym` THENA Auto) THEN Fold `coprime` 0) }
1
1. m : ℤ
2. x : ℤ
3. a : ℤ
4. b : ℤ
5. CoPrime(x,m)
6. m | ((x * a) - x * b)
⊢ CoPrime(x,m)
Latex:
Latex:
1. m : \mBbbZ{}
2. x : \mBbbZ{}
3. a : \mBbbZ{}
4. b : \mBbbZ{}
5. CoPrime(x,m)
6. m | ((x * a) - x * b)
\mvdash{} CoPrime(m,x)
By
Latex:
TACTIC:(Unfold `coprime` 0 THEN (BLemma `gcd\_p\_sym` THENA Auto) THEN Fold `coprime` 0)
Home
Index