rpmulgcd2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > rpmulgcd2		Structured version Visualization version GIF version

Theorem rpmulgcd2 16593

Description: If 𝑀 is relatively prime to 𝑁, then the GCD of 𝐾 with 𝑀 · 𝑁 is the product of the GCDs with 𝑀 and 𝑁 respectively. (Contributed by Mario Carneiro, 2-Jul-2015.)

**Assertion**
Ref	Expression
rpmulgcd2	⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd (𝑀 · 𝑁)) = ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)))

**Proof of Theorem rpmulgcd2**
Step	Hyp	Ref	Expression
1		simpl1 1192	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → 𝐾 ∈ ℤ)
2		simpl2 1193	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → 𝑀 ∈ ℤ)
3		simpl3 1194	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℤ)
4	2, 3	zmulcld 12672	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 · 𝑁) ∈ ℤ)
5	1, 4	gcdcld 16449	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd (𝑀 · 𝑁)) ∈ ℕ₀)
6	1, 2	gcdcld 16449	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∈ ℕ₀)
7	1, 3	gcdcld 16449	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∈ ℕ₀)
8	6, 7	nn0mulcld 12537	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∈ ℕ₀)
9		mulgcddvds 16592	. . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 gcd (𝑀 · 𝑁)) ∥ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)))
10	9	adantr 482	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd (𝑀 · 𝑁)) ∥ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)))
11		gcddvds 16444	. . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝐾 gcd 𝑀) ∥ 𝐾 ∧ (𝐾 gcd 𝑀) ∥ 𝑀))
12	1, 2, 11	syl2anc 585	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) ∥ 𝐾 ∧ (𝐾 gcd 𝑀) ∥ 𝑀))
13	12	simpld 496	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∥ 𝐾)
14		gcddvds 16444	. . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 gcd 𝑁) ∥ 𝐾 ∧ (𝐾 gcd 𝑁) ∥ 𝑁))
15	1, 3, 14	syl2anc 585	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑁) ∥ 𝐾 ∧ (𝐾 gcd 𝑁) ∥ 𝑁))
16	15	simpld 496	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∥ 𝐾)
17	6	nn0zd 12584	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∈ ℤ)
18	7	nn0zd 12584	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∈ ℤ)
19	17, 18	gcdcld 16449	. . . . . . . . . 10 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∈ ℕ₀)
20	19	nn0zd 12584	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∈ ℤ)
21		gcddvds 16444	. . . . . . . . . . 11 ⊢ (((𝐾 gcd 𝑀) ∈ ℤ ∧ (𝐾 gcd 𝑁) ∈ ℤ) → (((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑀) ∧ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑁)))
22	17, 18, 21	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑀) ∧ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑁)))
23	22	simpld 496	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑀))
24	12	simprd 497	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∥ 𝑀)
25	20, 17, 2, 23, 24	dvdstrd 16238	. . . . . . . 8 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑀)
26	22	simprd 497	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑁))
27	15	simprd 497	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∥ 𝑁)
28	20, 18, 3, 26, 27	dvdstrd 16238	. . . . . . . 8 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑁)
29		dvdsgcd 16486	. . . . . . . . 9 ⊢ ((((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑀 ∧ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑁) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝑀 gcd 𝑁)))
30	20, 2, 3, 29	syl3anc 1372	. . . . . . . 8 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑀 ∧ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑁) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝑀 gcd 𝑁)))
31	25, 28, 30	mp2and 698	. . . . . . 7 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝑀 gcd 𝑁))
32		simpr 486	. . . . . . 7 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 gcd 𝑁) = 1)
33	31, 32	breqtrd 5175	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 1)
34		dvds1 16262	. . . . . . 7 ⊢ (((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∈ ℕ₀ → (((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 1 ↔ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) = 1))
35	19, 34	syl 17	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 1 ↔ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) = 1))
36	33, 35	mpbid 231	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) = 1)
37		coprmdvds2 16591	. . . . 5 ⊢ ((((𝐾 gcd 𝑀) ∈ ℤ ∧ (𝐾 gcd 𝑁) ∈ ℤ ∧ 𝐾 ∈ ℤ) ∧ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) = 1) → (((𝐾 gcd 𝑀) ∥ 𝐾 ∧ (𝐾 gcd 𝑁) ∥ 𝐾) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ 𝐾))
38	17, 18, 1, 36, 37	syl31anc 1374	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (((𝐾 gcd 𝑀) ∥ 𝐾 ∧ (𝐾 gcd 𝑁) ∥ 𝐾) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ 𝐾))
39	13, 16, 38	mp2and 698	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ 𝐾)
40		dvdscmul 16226	. . . . . 6 ⊢ (((𝐾 gcd 𝑁) ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝐾 gcd 𝑀) ∈ ℤ) → ((𝐾 gcd 𝑁) ∥ 𝑁 → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ ((𝐾 gcd 𝑀) · 𝑁)))
41	18, 3, 17, 40	syl3anc 1372	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑁) ∥ 𝑁 → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ ((𝐾 gcd 𝑀) · 𝑁)))
42		dvdsmulc 16227	. . . . . 6 ⊢ (((𝐾 gcd 𝑀) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 gcd 𝑀) ∥ 𝑀 → ((𝐾 gcd 𝑀) · 𝑁) ∥ (𝑀 · 𝑁)))
43	17, 2, 3, 42	syl3anc 1372	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) ∥ 𝑀 → ((𝐾 gcd 𝑀) · 𝑁) ∥ (𝑀 · 𝑁)))
44	17, 18	zmulcld 12672	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∈ ℤ)
45	17, 3	zmulcld 12672	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · 𝑁) ∈ ℤ)
46		dvdstr 16237	. . . . . 6 ⊢ ((((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∈ ℤ ∧ ((𝐾 gcd 𝑀) · 𝑁) ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → ((((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ ((𝐾 gcd 𝑀) · 𝑁) ∧ ((𝐾 gcd 𝑀) · 𝑁) ∥ (𝑀 · 𝑁)) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁)))
47	44, 45, 4, 46	syl3anc 1372	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ ((𝐾 gcd 𝑀) · 𝑁) ∧ ((𝐾 gcd 𝑀) · 𝑁) ∥ (𝑀 · 𝑁)) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁)))
48	41, 43, 47	syl2and 609	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (((𝐾 gcd 𝑁) ∥ 𝑁 ∧ (𝐾 gcd 𝑀) ∥ 𝑀) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁)))
49	27, 24, 48	mp2and 698	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁))
50		dvdsgcd 16486	. . . 4 ⊢ ((((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → ((((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ 𝐾 ∧ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁)) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝐾 gcd (𝑀 · 𝑁))))
51	44, 1, 4, 50	syl3anc 1372	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ 𝐾 ∧ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁)) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝐾 gcd (𝑀 · 𝑁))))
52	39, 49, 51	mp2and 698	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝐾 gcd (𝑀 · 𝑁)))
53		dvdseq 16257	. 2 ⊢ ((((𝐾 gcd (𝑀 · 𝑁)) ∈ ℕ₀ ∧ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∈ ℕ₀) ∧ ((𝐾 gcd (𝑀 · 𝑁)) ∥ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∧ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝐾 gcd (𝑀 · 𝑁)))) → (𝐾 gcd (𝑀 · 𝑁)) = ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)))
54	5, 8, 10, 52, 53	syl22anc 838	1 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd (𝑀 · 𝑁)) = ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 class class class wbr 5149 (class class class)co 7409 1c1 11111 · cmul 11115 ℕ₀cn0 12472 ℤcz 12558 ∥ cdvds 16197 gcd cgcd 16435

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-dvds 16198 df-gcd 16436

This theorem is referenced by: dvdsmulf1o 26698

W3C validator