Theorem divides 16391

Description: Define the divides relation. 𝑀 ∥ 𝑁 means 𝑀 divides into 𝑁 with no remainder. For example, 3 ∥ 6 (ex-dvds 30990). As proven in dvdsval3 16393, 𝑀 ∥ 𝑁 ↔ (𝑁 mod 𝑀) = 0. See divides 16391 and dvdsval2 16392 for other equivalent expressions. (Contributed by Paul Chapman, 21-Mar-2011.)

Assertion

Ref	Expression
divides	⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁))

Distinct variable groups:   𝑛,𝑀   𝑛,𝑁

Proof of Theorem divides

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-br 5103	. . 3 ⊢ (𝑀 ∥ 𝑁 ↔ ⟨𝑀, 𝑁⟩ ∈ ∥ )
2		df-dvds 16390	. . . 4 ⊢ ∥ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ ∃𝑛 ∈ ℤ (𝑛 · 𝑥) = 𝑦)}
3	2	eleq2i 2852	. . 3 ⊢ (⟨𝑀, 𝑁⟩ ∈ ∥ ↔ ⟨𝑀, 𝑁⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ ∃𝑛 ∈ ℤ (𝑛 · 𝑥) = 𝑦)})
4	1, 3	bitri 278	. 2 ⊢ (𝑀 ∥ 𝑁 ↔ ⟨𝑀, 𝑁⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ ∃𝑛 ∈ ℤ (𝑛 · 𝑥) = 𝑦)})
5		oveq2 7416	. . . . 5 ⊢ (𝑥 = 𝑀 → (𝑛 · 𝑥) = (𝑛 · 𝑀))
6	5	eqeq1d 2762	. . . 4 ⊢ (𝑥 = 𝑀 → ((𝑛 · 𝑥) = 𝑦 ↔ (𝑛 · 𝑀) = 𝑦))
7	6	rexbidv 3186	. . 3 ⊢ (𝑥 = 𝑀 → (∃𝑛 ∈ ℤ (𝑛 · 𝑥) = 𝑦 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑦))
8		eqeq2 2772	. . . 4 ⊢ (𝑦 = 𝑁 → ((𝑛 · 𝑀) = 𝑦 ↔ (𝑛 · 𝑀) = 𝑁))
9	8	rexbidv 3186	. . 3 ⊢ (𝑦 = 𝑁 → (∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑦 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁))
10	7, 9	opelopab2 5512	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (⟨𝑀, 𝑁⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ ∃𝑛 ∈ ℤ (𝑛 · 𝑥) = 𝑦)} ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁))
11	4, 10	bitrid 286	1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ ∃𝑛 ∈ ℤ (𝑛 · 𝑀) = 𝑁))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3086  ⟨cop 4589   class class class wbr 5102  {copab 5166  (class class class)co 7408   · cmul 11176  ℤcz 12662   ∥ cdvds 16389

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-iota 6483  df-fv 6535  df-ov 7411  df-dvds 16390

This theorem is used by:  dvdsval2  16392  dvds0lem  16403  dvds1lem  16404  dvds2lem  16405  0dvds  16413  dvdsle  16447  divconjdvds  16452  dvdsexp2im  16464  odd2np1  16478  even2n  16479  oddm1even  16480  opeo  16502  omeo  16503  m1exp1  16513  divalglem4  16533  divalglem9  16538  divalgb  16541  modremain  16545  zeqzmulgcd  16647  bezoutlem4  16679  gcddiv  16688  dvdssqim  16691  dvdsexpim  16692  coprmdvds2  16791  congr  16801  divgcdcoprm0  16802  cncongr2  16805  dvdsnprmd  16827  prmpwdvds  17043  odmulg  19731  gexdvdsi  19758  lgsquadlem2  27671  primrootspoweq0  43076  aks6d1c2  43100  grpods  43164  unitscyglem4  43168  dvdsrabdioph  43755  jm2.26a  43945  coskpi2  46798  cosknegpi  46801  fourierswlem  47162  ppivalnnprm  48632  ppivalnnnprmge6  48633  dfeven2  48669