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 16599

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 12564	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
2	1	adantr 480	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑀 ∈ ℂ)
3		nncn 12221	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
4	3	adantl 481	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℂ)
5		nnne0 12247	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0)
6	5	adantl 481	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑁 ≠ 0)
7	2, 4, 6	divcld 11991	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 / 𝑁) ∈ ℂ)
8	7	3adant3 1129	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 / 𝑁) ∈ ℂ)
9	8	adantr 480	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑀 / 𝑁) ∈ ℂ)
10		zcn 12564	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℤ → 𝑃 ∈ ℂ)
11	10	adantr 480	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → 𝑃 ∈ ℂ)
12		nncn 12221	. . . . . . . . . 10 ⊢ (𝑄 ∈ ℕ → 𝑄 ∈ ℂ)
13	12	adantl 481	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → 𝑄 ∈ ℂ)
14		nnne0 12247	. . . . . . . . . 10 ⊢ (𝑄 ∈ ℕ → 𝑄 ≠ 0)
15	14	adantl 481	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → 𝑄 ≠ 0)
16	11, 13, 15	divcld 11991	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → (𝑃 / 𝑄) ∈ ℂ)
17	16	3adant3 1129	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑃 / 𝑄) ∈ ℂ)
18	17	adantl 481	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑃 / 𝑄) ∈ ℂ)
19	3	3ad2ant2 1131	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℂ)
20	19	adantr 480	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ∈ ℂ)
21	5	3ad2ant2 1131	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ≠ 0)
22	21	adantr 480	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ≠ 0)
23	9, 18, 20, 22	mulcand 11848	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑀 / 𝑁)) = (𝑁 · (𝑃 / 𝑄)) ↔ (𝑀 / 𝑁) = (𝑃 / 𝑄)))
24	2, 4, 6	divcan2d 11993	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑁 · (𝑀 / 𝑁)) = 𝑀)
25	24	3adant3 1129	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑁 · (𝑀 / 𝑁)) = 𝑀)
26	25	adantr 480	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · (𝑀 / 𝑁)) = 𝑀)
27	26	eqeq1d 2728	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑀 / 𝑁)) = (𝑁 · (𝑃 / 𝑄)) ↔ 𝑀 = (𝑁 · (𝑃 / 𝑄))))
28	23, 27	bitr3d 281	. . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 / 𝑁) = (𝑃 / 𝑄) ↔ 𝑀 = (𝑁 · (𝑃 / 𝑄))))
29	1	3ad2ant1 1130	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑀 ∈ ℂ)
30	29	adantr 480	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑀 ∈ ℂ)
31		mulcl 11193	. . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ (𝑃 / 𝑄) ∈ ℂ) → (𝑁 · (𝑃 / 𝑄)) ∈ ℂ)
32	19, 17, 31	syl2an 595	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · (𝑃 / 𝑄)) ∈ ℂ)
33	12	3ad2ant2 1131	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℂ)
34	33	adantl 481	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ∈ ℂ)
35	14	3ad2ant2 1131	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ≠ 0)
36	35	adantl 481	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ≠ 0)
37	30, 32, 34, 36	mulcan2d 11849	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑄) = ((𝑁 · (𝑃 / 𝑄)) · 𝑄) ↔ 𝑀 = (𝑁 · (𝑃 / 𝑄))))
38	20, 18, 34	mulassd 11238	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑃 / 𝑄)) · 𝑄) = (𝑁 · ((𝑃 / 𝑄) · 𝑄)))
39	11, 13, 15	divcan1d 11992	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → ((𝑃 / 𝑄) · 𝑄) = 𝑃)
40	39	3adant3 1129	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → ((𝑃 / 𝑄) · 𝑄) = 𝑃)
41	40	adantl 481	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑃 / 𝑄) · 𝑄) = 𝑃)
42	41	oveq2d 7420	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · ((𝑃 / 𝑄) · 𝑄)) = (𝑁 · 𝑃))
43	38, 42	eqtrd 2766	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · (𝑃 / 𝑄)) · 𝑄) = (𝑁 · 𝑃))
44	43	eqeq2d 2737	. . . . 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 12580	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ)
48	47	3ad2ant2 1131	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℤ)
49		simp2 1134	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℕ)
50	48, 49	anim12i 612	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 ∈ ℤ ∧ 𝑄 ∈ ℕ))
51	50	adantr 480	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 ∈ ℤ ∧ 𝑄 ∈ ℕ))
52	48	adantr 480	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ∈ ℤ)
53		simpl1 1188	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑀 ∈ ℤ)
54		nnz 12580	. . . . . . . . . . . 12 ⊢ (𝑄 ∈ ℕ → 𝑄 ∈ ℤ)
55	54	3ad2ant2 1131	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℤ)
56	55	adantl 481	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ∈ ℤ)
57	52, 53, 56	3jca 1125	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ))
58	57	adantr 480	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ))
59		simp1 1133	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑃 ∈ ℤ)
60		dvdsmul1 16226	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℤ ∧ 𝑃 ∈ ℤ) → 𝑁 ∥ (𝑁 · 𝑃))
61	48, 59, 60	syl2an 595	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑁 ∥ (𝑁 · 𝑃))
62	61	adantr 480	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∥ (𝑁 · 𝑃))
63		simpr 484	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑀 · 𝑄) = (𝑁 · 𝑃))
64	62, 63	breqtrrd 5169	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∥ (𝑀 · 𝑄))
65		gcdcom 16459	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
66	47, 65	sylan 579	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ ∧ 𝑀 ∈ ℤ) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
67	66	ancoms 458	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
68	67	3adant3 1129	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑁 gcd 𝑀) = (𝑀 gcd 𝑁))
69		simp3 1135	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 gcd 𝑁) = 1)
70	68, 69	eqtrd 2766	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑁 gcd 𝑀) = 1)
71	70	ad2antrr 723	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 gcd 𝑀) = 1)
72	64, 71	jca 511	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 ∥ (𝑀 · 𝑄) ∧ (𝑁 gcd 𝑀) = 1))
73		coprmdvds 16595	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ) → ((𝑁 ∥ (𝑀 · 𝑄) ∧ (𝑁 gcd 𝑀) = 1) → 𝑁 ∥ 𝑄))
74	58, 72, 73	sylc 65	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∥ 𝑄)
75		dvdsle 16258	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑄 ∈ ℕ) → (𝑁 ∥ 𝑄 → 𝑁 ≤ 𝑄))
76	51, 74, 75	sylc 65	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ≤ 𝑄)
77		simp2 1134	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℕ)
78	55, 77	anim12i 612	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1)) → (𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ))
79	78	ancoms 458	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ))
80	79	adantr 480	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ))
81		simpr1 1191	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑃 ∈ ℤ)
82	56, 81, 52	3jca 1125	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 𝑁 ∈ ℤ))
83	82	adantr 480	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 𝑁 ∈ ℤ))
84		simp1 1133	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑀 ∈ ℤ)
85		dvdsmul2 16227	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑄 ∈ ℤ) → 𝑄 ∥ (𝑀 · 𝑄))
86	84, 55, 85	syl2an 595	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑄 ∥ (𝑀 · 𝑄))
87	86	adantr 480	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∥ (𝑀 · 𝑄))
88	10	3ad2ant1 1130	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑃 ∈ ℂ)
89		mulcom 11195	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℂ ∧ 𝑃 ∈ ℂ) → (𝑁 · 𝑃) = (𝑃 · 𝑁))
90	19, 88, 89	syl2an 595	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑁 · 𝑃) = (𝑃 · 𝑁))
91	90	adantr 480	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 · 𝑃) = (𝑃 · 𝑁))
92	63, 91	eqtrd 2766	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑀 · 𝑄) = (𝑃 · 𝑁))
93	87, 92	breqtrd 5167	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∥ (𝑃 · 𝑁))
94		gcdcom 16459	. . . . . . . . . . . . . 14 ⊢ ((𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
95	54, 94	sylan 579	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ ℕ ∧ 𝑃 ∈ ℤ) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
96	95	ancoms 458	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
97	96	3adant3 1129	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑄 gcd 𝑃) = (𝑃 gcd 𝑄))
98		simp3 1135	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑃 gcd 𝑄) = 1)
99	97, 98	eqtrd 2766	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → (𝑄 gcd 𝑃) = 1)
100	99	ad2antlr 724	. . . . . . . . 9 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 gcd 𝑃) = 1)
101	93, 100	jca 511	. . . . . . . 8 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑄 ∥ (𝑃 · 𝑁) ∧ (𝑄 gcd 𝑃) = 1))
102		coprmdvds 16595	. . . . . . . 8 ⊢ ((𝑄 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑄 ∥ (𝑃 · 𝑁) ∧ (𝑄 gcd 𝑃) = 1) → 𝑄 ∥ 𝑁))
103	83, 101, 102	sylc 65	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∥ 𝑁)
104		dvdsle 16258	. . . . . . 7 ⊢ ((𝑄 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑄 ∥ 𝑁 → 𝑄 ≤ 𝑁))
105	80, 103, 104	sylc 65	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ≤ 𝑁)
106		nnre 12220	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ)
107	106	3ad2ant2 1131	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → 𝑁 ∈ ℝ)
108	107	ad2antrr 723	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 ∈ ℝ)
109		nnre 12220	. . . . . . . . 9 ⊢ (𝑄 ∈ ℕ → 𝑄 ∈ ℝ)
110	109	3ad2ant2 1131	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) → 𝑄 ∈ ℝ)
111	110	ad2antlr 724	. . . . . . 7 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑄 ∈ ℝ)
112	108, 111	letri3d 11357	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 = 𝑄 ↔ (𝑁 ≤ 𝑄 ∧ 𝑄 ≤ 𝑁)))
113	76, 105, 112	mpbir2and 710	. . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → 𝑁 = 𝑄)
114		oveq2 7412	. . . . . . . . . 10 ⊢ (𝑁 = 𝑄 → (𝑀 · 𝑁) = (𝑀 · 𝑄))
115	114	eqeq1d 2728	. . . . . . . . 9 ⊢ (𝑁 = 𝑄 → ((𝑀 · 𝑁) = (𝑁 · 𝑃) ↔ (𝑀 · 𝑄) = (𝑁 · 𝑃)))
116	115	anbi2d 628	. . . . . . . 8 ⊢ (𝑁 = 𝑄 → ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑁) = (𝑁 · 𝑃)) ↔ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃))))
117		mulcom 11195	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
118	1, 3, 117	syl2an 595	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
119	118	3adant3 1129	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
120	119	adantr 480	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → (𝑀 · 𝑁) = (𝑁 · 𝑀))
121	120	eqeq1d 2728	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑁) = (𝑁 · 𝑃) ↔ (𝑁 · 𝑀) = (𝑁 · 𝑃)))
122	88	adantl 481	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → 𝑃 ∈ ℂ)
123	30, 122, 20, 22	mulcand 11848	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑁 · 𝑀) = (𝑁 · 𝑃) ↔ 𝑀 = 𝑃))
124	121, 123	bitrd 279	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑁) = (𝑁 · 𝑃) ↔ 𝑀 = 𝑃))
125	124	biimpa 476	. . . . . . . 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 551	. . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑁 = 𝑄 → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄)))
129	113, 128	mpd 15	. . . 4 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) ∧ (𝑀 · 𝑄) = (𝑁 · 𝑃)) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄))
130	129	ex 412	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 · 𝑄) = (𝑁 · 𝑃) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄)))
131	46, 130	sylbid 239	. 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1)) → ((𝑀 / 𝑁) = (𝑃 / 𝑄) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄)))
132	131	3impia 1114	1 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ ∧ (𝑀 gcd 𝑁) = 1) ∧ (𝑃 ∈ ℤ ∧ 𝑄 ∈ ℕ ∧ (𝑃 gcd 𝑄) = 1) ∧ (𝑀 / 𝑁) = (𝑃 / 𝑄)) → (𝑀 = 𝑃 ∧ 𝑁 = 𝑄))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2934 class class class wbr 5141 (class class class)co 7404 ℂcc 11107 ℝcr 11108 0cc0 11109 1c1 11110 · cmul 11114 ≤ cle 11250 / cdiv 11872 ℕcn 12213 ℤcz 12559 ∥ cdvds 16202 gcd cgcd 16440

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 ax-pre-sup 11187

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6293 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7852 df-2nd 7972 df-frecs 8264 df-wrecs 8295 df-recs 8369 df-rdg 8408 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-sup 9436 df-inf 9437 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11447 df-neg 11448 df-div 11873 df-nn 12214 df-2 12276 df-3 12277 df-n0 12474 df-z 12560 df-uz 12824 df-rp 12978 df-fl 13760 df-mod 13838 df-seq 13970 df-exp 14031 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-dvds 16203 df-gcd 16441

This theorem is referenced by: qredeu 16600

W3C validator