gcdaddmlem - Metamath Proof Explorer

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

Theorem gcdaddmlem 16676

Description: Lemma for gcdaddm 16677. (Contributed by Paul Chapman, 31-Mar-2011.)

**Hypotheses**
Ref	Expression
gcdaddmlem.1	⊢ 𝐾 ∈ ℤ
gcdaddmlem.2	⊢ 𝑀 ∈ ℤ
gcdaddmlem.3	⊢ 𝑁 ∈ ℤ

**Assertion**
Ref	Expression
gcdaddmlem	⊢ (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁))

**Proof of Theorem gcdaddmlem**
Step	Hyp	Ref	Expression
1		gcdaddmlem.2	. . . . . . 7 ⊢ 𝑀 ∈ ℤ
2		gcdaddmlem.3	. . . . . . 7 ⊢ 𝑁 ∈ ℤ
3		gcddvds 16653	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁))
4	1, 2, 3	mp2an 705	. . . . . 6 ⊢ ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)
5	4	simpli 489	. . . . 5 ⊢ (𝑀 gcd 𝑁) ∥ 𝑀
6		gcdcl 16656	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) ∈ ℕ₀)
7	1, 2, 6	mp2an 705	. . . . . . . . 9 ⊢ (𝑀 gcd 𝑁) ∈ ℕ₀
8	7	nn0zi 12702	. . . . . . . 8 ⊢ (𝑀 gcd 𝑁) ∈ ℤ
9		gcdaddmlem.1	. . . . . . . . 9 ⊢ 𝐾 ∈ ℤ
10		1z 12707	. . . . . . . . 9 ⊢ 1 ∈ ℤ
11		dvds2ln 16439	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 1 ∈ ℤ) ∧ ((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁) → (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁))))
12	9, 10, 11	mpanl12 715	. . . . . . . 8 ⊢ (((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁) → (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁))))
13	8, 1, 2, 12	mp3an 1490	. . . . . . 7 ⊢ (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁) → (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁)))
14	4, 13	ax-mp 5	. . . . . 6 ⊢ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁))
15		zcn 12679	. . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
16	2, 15	ax-mp 5	. . . . . . . 8 ⊢ 𝑁 ∈ ℂ
17	16	mullidi 11295	. . . . . . 7 ⊢ (1 · 𝑁) = 𝑁
18	17	oveq2i 7423	. . . . . 6 ⊢ ((𝐾 · 𝑀) + (1 · 𝑁)) = ((𝐾 · 𝑀) + 𝑁)
19	14, 18	breqtri 5130	. . . . 5 ⊢ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)
20		zmulcl 12726	. . . . . . . 8 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 · 𝑀) ∈ ℤ)
21	9, 1, 20	mp2an 705	. . . . . . 7 ⊢ (𝐾 · 𝑀) ∈ ℤ
22		zaddcl 12717	. . . . . . 7 ⊢ (((𝐾 · 𝑀) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) + 𝑁) ∈ ℤ)
23	21, 2, 22	mp2an 705	. . . . . 6 ⊢ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ
24		dvdslegcd 16654	. . . . . . 7 ⊢ ((((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) ∧ ¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0)) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁))))
25	24	ex 418	. . . . . 6 ⊢ (((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))))
26	8, 1, 23, 25	mp3an 1490	. . . . 5 ⊢ (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁))))
27	5, 19, 26	mp2ani 711	. . . 4 ⊢ (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
28		gcddvds 16653	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → ((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)))
29	1, 23, 28	mp2an 705	. . . . . 6 ⊢ ((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁))
30	29	simpli 489	. . . . 5 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀
31		gcdcl 16656	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℕ₀)
32	1, 23, 31	mp2an 705	. . . . . . . . 9 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℕ₀
33	32	nn0zi 12702	. . . . . . . 8 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ
34		znegcl 12712	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → -𝐾 ∈ ℤ)
35	9, 34	ax-mp 5	. . . . . . . . 9 ⊢ -𝐾 ∈ ℤ
36		dvds2ln 16439	. . . . . . . . 9 ⊢ (((-𝐾 ∈ ℤ ∧ 1 ∈ ℤ) ∧ ((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ)) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁)))))
37	35, 10, 36	mpanl12 715	. . . . . . . 8 ⊢ (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁)))))
38	33, 1, 23, 37	mp3an 1490	. . . . . . 7 ⊢ (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁))))
39	29, 38	ax-mp 5	. . . . . 6 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁)))
40		zcn 12679	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ)
41	9, 40	ax-mp 5	. . . . . . . . 9 ⊢ 𝐾 ∈ ℂ
42		zcn 12679	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
43	1, 42	ax-mp 5	. . . . . . . . 9 ⊢ 𝑀 ∈ ℂ
44	41, 43	mulneg1i 11743	. . . . . . . 8 ⊢ (-𝐾 · 𝑀) = -(𝐾 · 𝑀)
45		zcn 12679	. . . . . . . . . 10 ⊢ (((𝐾 · 𝑀) + 𝑁) ∈ ℤ → ((𝐾 · 𝑀) + 𝑁) ∈ ℂ)
46	23, 45	ax-mp 5	. . . . . . . . 9 ⊢ ((𝐾 · 𝑀) + 𝑁) ∈ ℂ
47	46	mullidi 11295	. . . . . . . 8 ⊢ (1 · ((𝐾 · 𝑀) + 𝑁)) = ((𝐾 · 𝑀) + 𝑁)
48	44, 47	oveq12i 7424	. . . . . . 7 ⊢ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁))) = (-(𝐾 · 𝑀) + ((𝐾 · 𝑀) + 𝑁))
49	41, 43	mulcli 11297	. . . . . . . . . 10 ⊢ (𝐾 · 𝑀) ∈ ℂ
50	49	negcli 11607	. . . . . . . . . 10 ⊢ -(𝐾 · 𝑀) ∈ ℂ
51	49	negidi 11608	. . . . . . . . . 10 ⊢ ((𝐾 · 𝑀) + -(𝐾 · 𝑀)) = 0
52	49, 50, 51	addcomli 11483	. . . . . . . . 9 ⊢ (-(𝐾 · 𝑀) + (𝐾 · 𝑀)) = 0
53	52	oveq1i 7422	. . . . . . . 8 ⊢ ((-(𝐾 · 𝑀) + (𝐾 · 𝑀)) + 𝑁) = (0 + 𝑁)
54	50, 49, 16	addassi 11300	. . . . . . . 8 ⊢ ((-(𝐾 · 𝑀) + (𝐾 · 𝑀)) + 𝑁) = (-(𝐾 · 𝑀) + ((𝐾 · 𝑀) + 𝑁))
55	16	addlidi 11479	. . . . . . . 8 ⊢ (0 + 𝑁) = 𝑁
56	53, 54, 55	3eqtr3i 2792	. . . . . . 7 ⊢ (-(𝐾 · 𝑀) + ((𝐾 · 𝑀) + 𝑁)) = 𝑁
57	48, 56	eqtri 2784	. . . . . 6 ⊢ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁))) = 𝑁
58	39, 57	breqtri 5130	. . . . 5 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁
59		dvdslegcd 16654	. . . . . . 7 ⊢ ((((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
60	59	ex 418	. . . . . 6 ⊢ (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ (𝑀 = 0 ∧ 𝑁 = 0) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁))))
61	33, 1, 2, 60	mp3an 1490	. . . . 5 ⊢ (¬ (𝑀 = 0 ∧ 𝑁 = 0) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
62	30, 58, 61	mp2ani 711	. . . 4 ⊢ (¬ (𝑀 = 0 ∧ 𝑁 = 0) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁))
63	27, 62	anim12i 625	. . 3 ⊢ ((¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) → ((𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
64	8	zrei 12680	. . . 4 ⊢ (𝑀 gcd 𝑁) ∈ ℝ
65	33	zrei 12680	. . . 4 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℝ
66	64, 65	letri3i 11407	. . 3 ⊢ ((𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ↔ ((𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
67	63, 66	sylibr 237	. 2 ⊢ ((¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
68		pm4.57 1006	. . 3 ⊢ (¬ (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) ↔ ((𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∨ (𝑀 = 0 ∧ 𝑁 = 0)))
69		oveq2 7420	. . . . . . . . . 10 ⊢ (𝑀 = 0 → (𝐾 · 𝑀) = (𝐾 · 0))
70	41	mul01i 11481	. . . . . . . . . 10 ⊢ (𝐾 · 0) = 0
71	69, 70	eqtrdi 2812	. . . . . . . . 9 ⊢ (𝑀 = 0 → (𝐾 · 𝑀) = 0)
72	71	oveq1d 7427	. . . . . . . 8 ⊢ (𝑀 = 0 → ((𝐾 · 𝑀) + 𝑁) = (0 + 𝑁))
73	72, 55	eqtrdi 2812	. . . . . . 7 ⊢ (𝑀 = 0 → ((𝐾 · 𝑀) + 𝑁) = 𝑁)
74	73	eqeq1d 2763	. . . . . 6 ⊢ (𝑀 = 0 → (((𝐾 · 𝑀) + 𝑁) = 0 ↔ 𝑁 = 0))
75	74	pm5.32i 585	. . . . 5 ⊢ ((𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ↔ (𝑀 = 0 ∧ 𝑁 = 0))
76		oveq12 7421	. . . . . 6 ⊢ ((𝑀 = 0 ∧ 𝑁 = 0) → (𝑀 gcd 𝑁) = (0 gcd 0))
77		oveq12 7421	. . . . . . 7 ⊢ ((𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) = (0 gcd 0))
78	75, 77	sylbir 238	. . . . . 6 ⊢ ((𝑀 = 0 ∧ 𝑁 = 0) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) = (0 gcd 0))
79	76, 78	eqtr4d 2799	. . . . 5 ⊢ ((𝑀 = 0 ∧ 𝑁 = 0) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
80	75, 79	sylbi 220	. . . 4 ⊢ ((𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
81	80, 79	jaoi 871	. . 3 ⊢ (((𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∨ (𝑀 = 0 ∧ 𝑁 = 0)) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
82	68, 81	sylbi 220	. 2 ⊢ (¬ (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
83	67, 82	pm2.61i 184	1 ⊢ (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 (class class class)co 7412 ℂcc 11179 0cc0 11181 1c1 11182 + caddc 11184 · cmul 11186 ≤ cle 11325 -cneg 11523 ℕ₀cn0 12587 ℤcz 12674 ∥ cdvds 16402 gcd cgcd 16644

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-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-sup 9418 df-inf 9419 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-rp 13102 df-seq 14125 df-exp 14185 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-dvds 16403 df-gcd 16645

This theorem is used by: gcdaddm 16677

W3C validator