qredeq - Metamath Proof Explorer

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

Theorem qredeq 16594

Description: Two equal reduced fractions have the same numerator and denominator. (Contributed by Jeff Hankins, 29-Sep-2013.)

**Assertion**
Ref	Expression
qredeq	⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) ∧ (𝑀 / 𝑁) = (𝑃 / 𝑄)) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄))

**Proof of Theorem qredeq**
Step	Hyp	Ref	Expression
1		zcn 12563	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
2	1	adantr 482	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑀 ∈ ℂ)
3		nncn 12220	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
4	3	adantl 483	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℂ)
5		nnne0 12246	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0)
6	5	adantl 483	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑁 ≠ 0)
7	2, 4, 6	divcld 11990	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 / 𝑁) ∈ ℂ)
8	7	3adant3 1133	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 / 𝑁) ∈ ℂ)
9	8	adantr 482	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑀 / 𝑁) ∈ ℂ)
10		zcn 12563	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℤ → 𝑃 ∈ ℂ)
11	10	adantr 482	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → 𝑃 ∈ ℂ)
12		nncn 12220	. . . . . . . . . 10 ⊢ (𝑄 ∈ ℕ → 𝑄 ∈ ℂ)
13	12	adantl 483	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → 𝑄 ∈ ℂ)
14		nnne0 12246	. . . . . . . . . 10 ⊢ (𝑄 ∈ ℕ → 𝑄 ≠ 0)
15	14	adantl 483	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → 𝑄 ≠ 0)
16	11, 13, 15	divcld 11990	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → (𝑃 / 𝑄) ∈ ℂ)
17	16	3adant3 1133	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑃 / 𝑄) ∈ ℂ)
18	17	adantl 483	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑃 / 𝑄) ∈ ℂ)
19	3	3ad2ant2 1135	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℂ)
20	19	adantr 482	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ∈ ℂ)
21	5	3ad2ant2 1135	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ≠ 0)
22	21	adantr 482	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ≠ 0)
23	9, 18, 20, 22	mulcand 11847	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑀 / 𝑁)) = (𝑁 · (𝑃 / 𝑄)) ↔ (𝑀 / 𝑁) = (𝑃 / 𝑄)))
24	2, 4, 6	divcan2d 11992	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑁 · (𝑀 / 𝑁)) = 𝑀)
25	24	3adant3 1133	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑁 · (𝑀 / 𝑁)) = 𝑀)
26	25	adantr 482	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · (𝑀 / 𝑁)) = 𝑀)
27	26	eqeq1d 2735	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑀 / 𝑁)) = (𝑁 · (𝑃 / 𝑄)) ↔ 𝑀 = (𝑁 · (𝑃 / 𝑄))))
28	23, 27	bitr3d 281	. . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 / 𝑁) = (𝑃 / 𝑄) ↔ 𝑀 = (𝑁 · (𝑃 / 𝑄))))
29	1	3ad2ant1 1134	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑀 ∈ ℂ)
30	29	adantr 482	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑀 ∈ ℂ)
31		mulcl 11194	. . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ (𝑃 / 𝑄) ∈ ℂ) → (𝑁 · (𝑃 / 𝑄)) ∈ ℂ)
32	19, 17, 31	syl2an 597	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · (𝑃 / 𝑄)) ∈ ℂ)
33	12	3ad2ant2 1135	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℂ)
34	33	adantl 483	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ∈ ℂ)
35	14	3ad2ant2 1135	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ≠ 0)
36	35	adantl 483	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ≠ 0)
37	30, 32, 34, 36	mulcan2d 11848	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑄) = ((𝑁 · (𝑃 / 𝑄)) · 𝑄) ↔ 𝑀 = (𝑁 · (𝑃 / 𝑄))))
38	20, 18, 34	mulassd 11237	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑃 / 𝑄)) · 𝑄) = (𝑁 · ((𝑃 / 𝑄) · 𝑄)))
39	11, 13, 15	divcan1d 11991	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → ((𝑃 / 𝑄) · 𝑄) = 𝑃)
40	39	3adant3 1133	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → ((𝑃 / 𝑄) · 𝑄) = 𝑃)
41	40	adantl 483	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑃 / 𝑄) · 𝑄) = 𝑃)
42	41	oveq2d 7425	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · ((𝑃 / 𝑄) · 𝑄)) = (𝑁 · 𝑃))
43	38, 42	eqtrd 2773	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑃 / 𝑄)) · 𝑄) = (𝑁 · 𝑃))
44	43	eqeq2d 2744	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑄) = ((𝑁 · (𝑃 / 𝑄)) · 𝑄) ↔ (𝑀 · 𝑄) = (𝑁 · 𝑃)))
45	37, 44	bitr3d 281	. . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑀 = (𝑁 · (𝑃 / 𝑄)) ↔ (𝑀 · 𝑄) = (𝑁 · 𝑃)))
46	28, 45	bitrd 279	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 / 𝑁) = (𝑃 / 𝑄) ↔ (𝑀 · 𝑄) = (𝑁 · 𝑃)))
47		nnz 12579	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ)
48	47	3ad2ant2 1135	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℤ)
49		simp2 1138	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℕ)
50	48, 49	anim12i 614	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 ∈ ℤ ∧ 𝑄 ∈ ℕ))
51	50	adantr 482	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 ∈ ℤ ∧ 𝑄 ∈ ℕ))
52	48	adantr 482	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ∈ ℤ)
53		simpl1 1192	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑀 ∈ ℤ)
54		nnz 12579	. . . . . . . . . . . 12 ⊢ (𝑄 ∈ ℕ → 𝑄 ∈ ℤ)
55	54	3ad2ant2 1135	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℤ)
56	55	adantl 483	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ∈ ℤ)
57	52, 53, 56	3jca 1129	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ))
58	57	adantr 482	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ))
59		simp1 1137	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑃 ∈ ℤ)
60		dvdsmul1 16221	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℤ ∧ 𝑃 ∈ ℤ) → 𝑁 ∥ (𝑁 · 𝑃))
61	48, 59, 60	syl2an 597	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ∥ (𝑁 · 𝑃))
62	61	adantr 482	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∥ (𝑁 · 𝑃))
63		simpr 486	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑀 · 𝑄) = (𝑁 · 𝑃))
64	62, 63	breqtrrd 5177	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∥ (𝑀 · 𝑄))
65		gcdcom 16454	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
66	47, 65	sylan 581	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ ∧ 𝑀 ∈ ℤ) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
67	66	ancoms 460	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
68	67	3adant3 1133	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
69		simp3 1139	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 gcd 𝑁) = 1)
70	68, 69	eqtrd 2773	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑁 gcd 𝑀) = 1)
71	70	ad2antrr 725	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 gcd 𝑀) = 1)
72	64, 71	jca 513	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 ∥ (𝑀 · 𝑄) ∧ (𝑁 gcd 𝑀) = 1))
73		coprmdvds 16590	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ) → ((𝑁 ∥ (𝑀 · 𝑄) ∧ (𝑁 gcd 𝑀) = 1) → 𝑁 ∥ 𝑄))
74	58, 72, 73	sylc 65	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∥ 𝑄)
75		dvdsle 16253	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑄 ∈ ℕ) → (𝑁 ∥ 𝑄 → 𝑁 ≤ 𝑄))
76	51, 74, 75	sylc 65	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ≤ 𝑄)
77		simp2 1138	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℕ)
78	55, 77	anim12i 614	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1)) → (𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ))
79	78	ancoms 460	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ))
80	79	adantr 482	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ))
81		simpr1 1195	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑃 ∈ ℤ)
82	56, 81, 52	3jca 1129	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 𝑁 ∈ ℤ))
83	82	adantr 482	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 𝑁 ∈ ℤ))
84		simp1 1137	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑀 ∈ ℤ)
85		dvdsmul2 16222	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ) → 𝑄 ∥ (𝑀 · 𝑄))
86	84, 55, 85	syl2an 597	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ∥ (𝑀 · 𝑄))
87	86	adantr 482	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∥ (𝑀 · 𝑄))
88	10	3ad2ant1 1134	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑃 ∈ ℂ)
89		mulcom 11196	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℂ ∧ 𝑃 ∈ ℂ) → (𝑁 · 𝑃) = (𝑃 · 𝑁))
90	19, 88, 89	syl2an 597	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · 𝑃) = (𝑃 · 𝑁))
91	90	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 · 𝑃) = (𝑃 · 𝑁))
92	63, 91	eqtrd 2773	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑀 · 𝑄) = (𝑃 · 𝑁))
93	87, 92	breqtrd 5175	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∥ (𝑃 · 𝑁))
94		gcdcom 16454	. . . . . . . . . . . . . 14 ⊢ ((𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
95	54, 94	sylan 581	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ ℕ ∧ 𝑃 ∈ ℤ) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
96	95	ancoms 460	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
97	96	3adant3 1133	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
98		simp3 1139	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑃 gcd 𝑄) = 1)
99	97, 98	eqtrd 2773	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑄 gcd 𝑃) = 1)
100	99	ad2antlr 726	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 gcd 𝑃) = 1)
101	93, 100	jca 513	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 ∥ (𝑃 · 𝑁) ∧ (𝑄 gcd 𝑃) = 1))
102		coprmdvds 16590	. . . . . . . 8 ⊢ ((𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑄 ∥ (𝑃 · 𝑁) ∧ (𝑄 gcd 𝑃) = 1) → 𝑄 ∥ 𝑁))
103	83, 101, 102	sylc 65	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∥ 𝑁)
104		dvdsle 16253	. . . . . . 7 ⊢ ((𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑄 ∥ 𝑁 → 𝑄 ≤ 𝑁))
105	80, 103, 104	sylc 65	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ≤ 𝑁)
106		nnre 12219	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ)
107	106	3ad2ant2 1135	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℝ)
108	107	ad2antrr 725	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∈ ℝ)
109		nnre 12219	. . . . . . . . 9 ⊢ (𝑄 ∈ ℕ → 𝑄 ∈ ℝ)
110	109	3ad2ant2 1135	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℝ)
111	110	ad2antlr 726	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∈ ℝ)
112	108, 111	letri3d 11356	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 = 𝑄 ↔ (𝑁 ≤ 𝑄 ∧ 𝑄 ≤ 𝑁)))
113	76, 105, 112	mpbir2and 712	. . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 = 𝑄)
114		oveq2 7417	. . . . . . . . . 10 ⊢ (𝑁 = 𝑄 → (𝑀 · 𝑁) = (𝑀 · 𝑄))
115	114	eqeq1d 2735	. . . . . . . . 9 ⊢ (𝑁 = 𝑄 → ((𝑀 · 𝑁) = (𝑁 · 𝑃) ↔ (𝑀 · 𝑄) = (𝑁 · 𝑃)))
116	115	anbi2d 630	. . . . . . . 8 ⊢ (𝑁 = 𝑄 → ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑁) = (𝑁 · 𝑃)) ↔ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃))))
117		mulcom 11196	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
118	1, 3, 117	syl2an 597	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
119	118	3adant3 1133	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
120	119	adantr 482	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
121	120	eqeq1d 2735	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑁) = (𝑁 · 𝑃) ↔ (𝑁 · 𝑀) = (𝑁 · 𝑃)))
122	88	adantl 483	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑃 ∈ ℂ)
123	30, 122, 20, 22	mulcand 11847	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · 𝑀) = (𝑁 · 𝑃) ↔ 𝑀 = 𝑃))
124	121, 123	bitrd 279	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑁) = (𝑁 · 𝑃) ↔ 𝑀 = 𝑃))
125	124	biimpa 478	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑁) = (𝑁 · 𝑃)) → 𝑀 = 𝑃)
126	116, 125	syl6bir 254	. . . . . . 7 ⊢ (𝑁 = 𝑄 → ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑀 = 𝑃))
127	126	com12 32	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 = 𝑄 → 𝑀 = 𝑃))
128	127	ancrd 553	. . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 = 𝑄 → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄)))
129	113, 128	mpd 15	. . . 4 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄))
130	129	ex 414	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑄) = (𝑁 · 𝑃) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄)))
131	46, 130	sylbid 239	. 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 / 𝑁) = (𝑃 / 𝑄) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄)))
132	131	3impia 1118	1 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) ∧ (𝑀 / 𝑁) = (𝑃 / 𝑄)) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 class class class wbr 5149 (class class class)co 7409 ℂcc 11108 ℝcr 11109 0cc0 11110 1c1 11111 · cmul 11115 ≤ cle 11249 / cdiv 11871 ℕcn 12212 ℤ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: qredeu 16595

W3C validator