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 16694

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 1191	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → 𝐾 ∈ ℤ)
2		simpl2 1192	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → 𝑀 ∈ ℤ)
3		simpl3 1193	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℤ)
4	2, 3	zmulcld 12730	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 · 𝑁) ∈ ℤ)
5	1, 4	gcdcld 16546	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd (𝑀 · 𝑁)) ∈ ℕ₀)
6	1, 2	gcdcld 16546	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∈ ℕ₀)
7	1, 3	gcdcld 16546	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∈ ℕ₀)
8	6, 7	nn0mulcld 12594	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∈ ℕ₀)
9		mulgcddvds 16693	. . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 gcd (𝑀 · 𝑁)) ∥ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)))
10	9	adantr 480	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd (𝑀 · 𝑁)) ∥ ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)))
11		gcddvds 16541	. . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝐾 gcd 𝑀) ∥ 𝐾 ∧ (𝐾 gcd 𝑀) ∥ 𝑀))
12	1, 2, 11	syl2anc 584	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) ∥ 𝐾 ∧ (𝐾 gcd 𝑀) ∥ 𝑀))
13	12	simpld 494	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∥ 𝐾)
14		gcddvds 16541	. . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 gcd 𝑁) ∥ 𝐾 ∧ (𝐾 gcd 𝑁) ∥ 𝑁))
15	1, 3, 14	syl2anc 584	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑁) ∥ 𝐾 ∧ (𝐾 gcd 𝑁) ∥ 𝑁))
16	15	simpld 494	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∥ 𝐾)
17	6	nn0zd 12641	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∈ ℤ)
18	7	nn0zd 12641	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∈ ℤ)
19	17, 18	gcdcld 16546	. . . . . . . . . 10 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∈ ℕ₀)
20	19	nn0zd 12641	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∈ ℤ)
21		gcddvds 16541	. . . . . . . . . . 11 ⊢ (((𝐾 gcd 𝑀) ∈ ℤ ∧ (𝐾 gcd 𝑁) ∈ ℤ) → (((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑀) ∧ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑁)))
22	17, 18, 21	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑀) ∧ ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑁)))
23	22	simpld 494	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑀))
24	12	simprd 495	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑀) ∥ 𝑀)
25	20, 17, 2, 23, 24	dvdstrd 16333	. . . . . . . 8 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑀)
26	22	simprd 495	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝐾 gcd 𝑁))
27	15	simprd 495	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝐾 gcd 𝑁) ∥ 𝑁)
28	20, 18, 3, 26, 27	dvdstrd 16333	. . . . . . . 8 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 𝑁)
29		dvdsgcd 16582	. . . . . . . . 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 699	. . . . . . 7 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ (𝑀 gcd 𝑁))
32		simpr 484	. . . . . . 7 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 gcd 𝑁) = 1)
33	31, 32	breqtrd 5168	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) ∥ 1)
34		dvds1 16357	. . . . . . 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 232	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) gcd (𝐾 gcd 𝑁)) = 1)
37		coprmdvds2 16692	. . . . 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 699	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ 𝐾)
40		dvdscmul 16321	. . . . . 6 ⊢ (((𝐾 gcd 𝑁) ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝐾 gcd 𝑀) ∈ ℤ) → ((𝐾 gcd 𝑁) ∥ 𝑁 → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ ((𝐾 gcd 𝑀) · 𝑁)))
41	18, 3, 17, 40	syl3anc 1372	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑁) ∥ 𝑁 → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ ((𝐾 gcd 𝑀) · 𝑁)))
42		dvdsmulc 16322	. . . . . 6 ⊢ (((𝐾 gcd 𝑀) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 gcd 𝑀) ∥ 𝑀 → ((𝐾 gcd 𝑀) · 𝑁) ∥ (𝑀 · 𝑁)))
43	17, 2, 3, 42	syl3anc 1372	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) ∥ 𝑀 → ((𝐾 gcd 𝑀) · 𝑁) ∥ (𝑀 · 𝑁)))
44	17, 18	zmulcld 12730	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∈ ℤ)
45	17, 3	zmulcld 12730	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · 𝑁) ∈ ℤ)
46		dvdstr 16332	. . . . . 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 608	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → (((𝐾 gcd 𝑁) ∥ 𝑁 ∧ (𝐾 gcd 𝑀) ∥ 𝑀) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁)))
49	27, 24, 48	mp2and 699	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝑀 · 𝑁))
50		dvdsgcd 16582	. . . 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 699	. 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 gcd 𝑁) = 1) → ((𝐾 gcd 𝑀) · (𝐾 gcd 𝑁)) ∥ (𝐾 gcd (𝑀 · 𝑁)))
53		dvdseq 16352	. 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 206 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 class class class wbr 5142 (class class class)co 7432 1c1 11157 · cmul 11161 ℕ₀cn0 12528 ℤcz 12615 ∥ cdvds 16291 gcd cgcd 16532

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233 ax-pre-sup 11234

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-sup 9483 df-inf 9484 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-div 11922 df-nn 12268 df-2 12330 df-3 12331 df-n0 12529 df-z 12616 df-uz 12880 df-rp 13036 df-fl 13833 df-mod 13911 df-seq 14044 df-exp 14104 df-cj 15139 df-re 15140 df-im 15141 df-sqrt 15275 df-abs 15276 df-dvds 16292 df-gcd 16533

This theorem is referenced by: mpodvdsmulf1o 27238 dvdsmulf1o 27240

W3C validator