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 16588

Description: Lemma for gcdaddm 16589. (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 16567	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁))
4	1, 2, 3	mp2an 704	. . . . . 6 ⊢ ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)
5	4	simpli 488	. . . . 5 ⊢ (𝑀 gcd 𝑁) ∥ 𝑀
6		gcdcl 16570	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) ∈ ℕ₀)
7	1, 2, 6	mp2an 704	. . . . . . . . 9 ⊢ (𝑀 gcd 𝑁) ∈ ℕ₀
8	7	nn0zi 12625	. . . . . . . 8 ⊢ (𝑀 gcd 𝑁) ∈ ℤ
9		gcdaddmlem.1	. . . . . . . . 9 ⊢ 𝐾 ∈ ℤ
10		1z 12630	. . . . . . . . 9 ⊢ 1 ∈ ℤ
11		dvds2ln 16353	. . . . . . . . 9 ⊢ (((𝐾 ∈ ℤ ∧ 1 ∈ ℤ) ∧ ((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁) → (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁))))
12	9, 10, 11	mpanl12 714	. . . . . . . 8 ⊢ (((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁) → (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁))))
13	8, 1, 2, 12	mp3an 1489	. . . . . . 7 ⊢ (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁) → (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁)))
14	4, 13	ax-mp 5	. . . . . 6 ⊢ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + (1 · 𝑁))
15		zcn 12602	. . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
16	2, 15	ax-mp 5	. . . . . . . 8 ⊢ 𝑁 ∈ ℂ
17	16	mullidi 11220	. . . . . . 7 ⊢ (1 · 𝑁) = 𝑁
18	17	oveq2i 7423	. . . . . 6 ⊢ ((𝐾 · 𝑀) + (1 · 𝑁)) = ((𝐾 · 𝑀) + 𝑁)
19	14, 18	breqtri 5135	. . . . 5 ⊢ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)
20		zmulcl 12649	. . . . . . . 8 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 · 𝑀) ∈ ℤ)
21	9, 1, 20	mp2an 704	. . . . . . 7 ⊢ (𝐾 · 𝑀) ∈ ℤ
22		zaddcl 12640	. . . . . . 7 ⊢ (((𝐾 · 𝑀) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 · 𝑀) + 𝑁) ∈ ℤ)
23	21, 2, 22	mp2an 704	. . . . . 6 ⊢ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ
24		dvdslegcd 16568	. . . . . . 7 ⊢ ((((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) ∧ ¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0)) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁))))
25	24	ex 417	. . . . . 6 ⊢ (((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))))
26	8, 1, 23, 25	mp3an 1489	. . . . 5 ⊢ (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁))))
27	5, 19, 26	mp2ani 710	. . . 4 ⊢ (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
28		gcddvds 16567	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → ((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)))
29	1, 23, 28	mp2an 704	. . . . . 6 ⊢ ((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁))
30	29	simpli 488	. . . . 5 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀
31		gcdcl 16570	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℕ₀)
32	1, 23, 31	mp2an 704	. . . . . . . . 9 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℕ₀
33	32	nn0zi 12625	. . . . . . . 8 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ
34		znegcl 12635	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → -𝐾 ∈ ℤ)
35	9, 34	ax-mp 5	. . . . . . . . 9 ⊢ -𝐾 ∈ ℤ
36		dvds2ln 16353	. . . . . . . . 9 ⊢ (((-𝐾 ∈ ℤ ∧ 1 ∈ ℤ) ∧ ((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ)) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁)))))
37	35, 10, 36	mpanl12 714	. . . . . . . 8 ⊢ (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ ((𝐾 · 𝑀) + 𝑁) ∈ ℤ) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁)))))
38	33, 1, 23, 37	mp3an 1489	. . . . . . 7 ⊢ (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((𝐾 · 𝑀) + 𝑁)) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁))))
39	29, 38	ax-mp 5	. . . . . 6 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁)))
40		zcn 12602	. . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ)
41	9, 40	ax-mp 5	. . . . . . . . 9 ⊢ 𝐾 ∈ ℂ
42		zcn 12602	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
43	1, 42	ax-mp 5	. . . . . . . . 9 ⊢ 𝑀 ∈ ℂ
44	41, 43	mulneg1i 11666	. . . . . . . 8 ⊢ (-𝐾 · 𝑀) = -(𝐾 · 𝑀)
45		zcn 12602	. . . . . . . . . 10 ⊢ (((𝐾 · 𝑀) + 𝑁) ∈ ℤ → ((𝐾 · 𝑀) + 𝑁) ∈ ℂ)
46	23, 45	ax-mp 5	. . . . . . . . 9 ⊢ ((𝐾 · 𝑀) + 𝑁) ∈ ℂ
47	46	mullidi 11220	. . . . . . . 8 ⊢ (1 · ((𝐾 · 𝑀) + 𝑁)) = ((𝐾 · 𝑀) + 𝑁)
48	44, 47	oveq12i 7424	. . . . . . 7 ⊢ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁))) = (-(𝐾 · 𝑀) + ((𝐾 · 𝑀) + 𝑁))
49	41, 43	mulcli 11222	. . . . . . . . . 10 ⊢ (𝐾 · 𝑀) ∈ ℂ
50	49	negcli 11532	. . . . . . . . . 10 ⊢ -(𝐾 · 𝑀) ∈ ℂ
51	49	negidi 11533	. . . . . . . . . 10 ⊢ ((𝐾 · 𝑀) + -(𝐾 · 𝑀)) = 0
52	49, 50, 51	addcomli 11408	. . . . . . . . 9 ⊢ (-(𝐾 · 𝑀) + (𝐾 · 𝑀)) = 0
53	52	oveq1i 7422	. . . . . . . 8 ⊢ ((-(𝐾 · 𝑀) + (𝐾 · 𝑀)) + 𝑁) = (0 + 𝑁)
54	50, 49, 16	addassi 11225	. . . . . . . 8 ⊢ ((-(𝐾 · 𝑀) + (𝐾 · 𝑀)) + 𝑁) = (-(𝐾 · 𝑀) + ((𝐾 · 𝑀) + 𝑁))
55	16	addlidi 11404	. . . . . . . 8 ⊢ (0 + 𝑁) = 𝑁
56	53, 54, 55	3eqtr3i 2793	. . . . . . 7 ⊢ (-(𝐾 · 𝑀) + ((𝐾 · 𝑀) + 𝑁)) = 𝑁
57	48, 56	eqtri 2785	. . . . . 6 ⊢ ((-𝐾 · 𝑀) + (1 · ((𝐾 · 𝑀) + 𝑁))) = 𝑁
58	39, 57	breqtri 5135	. . . . 5 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁
59		dvdslegcd 16568	. . . . . . 7 ⊢ ((((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
60	59	ex 417	. . . . . 6 ⊢ (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ (𝑀 = 0 ∧ 𝑁 = 0) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁))))
61	33, 1, 2, 60	mp3an 1489	. . . . 5 ⊢ (¬ (𝑀 = 0 ∧ 𝑁 = 0) → (((𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑀 ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∥ 𝑁) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
62	30, 58, 61	mp2ani 710	. . . 4 ⊢ (¬ (𝑀 = 0 ∧ 𝑁 = 0) → (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁))
63	27, 62	anim12i 624	. . 3 ⊢ ((¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) → ((𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
64	8	zrei 12603	. . . 4 ⊢ (𝑀 gcd 𝑁) ∈ ℝ
65	33	zrei 12603	. . . 4 ⊢ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∈ ℝ
66	64, 65	letri3i 11332	. . 3 ⊢ ((𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ↔ ((𝑀 gcd 𝑁) ≤ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ∧ (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)) ≤ (𝑀 gcd 𝑁)))
67	63, 66	sylibr 237	. 2 ⊢ ((¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
68		pm4.57 1005	. . 3 ⊢ (¬ (¬ (𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∧ ¬ (𝑀 = 0 ∧ 𝑁 = 0)) ↔ ((𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) ∨ (𝑀 = 0 ∧ 𝑁 = 0)))
69		oveq2 7420	. . . . . . . . . 10 ⊢ (𝑀 = 0 → (𝐾 · 𝑀) = (𝐾 · 0))
70	41	mul01i 11406	. . . . . . . . . 10 ⊢ (𝐾 · 0) = 0
71	69, 70	eqtrdi 2813	. . . . . . . . 9 ⊢ (𝑀 = 0 → (𝐾 · 𝑀) = 0)
72	71	oveq1d 7427	. . . . . . . 8 ⊢ (𝑀 = 0 → ((𝐾 · 𝑀) + 𝑁) = (0 + 𝑁))
73	72, 55	eqtrdi 2813	. . . . . . 7 ⊢ (𝑀 = 0 → ((𝐾 · 𝑀) + 𝑁) = 𝑁)
74	73	eqeq1d 2764	. . . . . 6 ⊢ (𝑀 = 0 → (((𝐾 · 𝑀) + 𝑁) = 0 ↔ 𝑁 = 0))
75	74	pm5.32i 584	. . . . 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 2800	. . . . 5 ⊢ ((𝑀 = 0 ∧ 𝑁 = 0) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
80	75, 79	sylbi 220	. . . 4 ⊢ ((𝑀 = 0 ∧ ((𝐾 · 𝑀) + 𝑁) = 0) → (𝑀 gcd 𝑁) = (𝑀 gcd ((𝐾 · 𝑀) + 𝑁)))
81	80, 79	jaoi 870	. . 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 400 ∨ wo 860 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 (class class class)co 7412 ℂcc 11104 0cc0 11106 1c1 11107 + caddc 11109 · cmul 11111 ≤ cle 11250 -cneg 11448 ℕ₀cn0 12510 ℤcz 12597 ∥ cdvds 16316 gcd cgcd 16558

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9400 df-inf 9401 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-seq 14045 df-exp 14105 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-dvds 16317 df-gcd 16559

This theorem is used by: gcdaddm 16589

W3C validator