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

Theorem fvprmselgcd1 16358
Description: The greatest common divisor of two values of the prime selection function for different arguments is 1. (Contributed by AV, 19-Aug-2020.)
Hypothesis
Ref Expression
fvprmselelfz.f 𝐹 = (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))
Assertion
Ref Expression
fvprmselgcd1 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
Distinct variable groups:   𝑚,𝑁   𝑚,𝑋   𝑚,𝑌
Allowed substitution hint:   𝐹(𝑚)

Proof of Theorem fvprmselgcd1
StepHypRef Expression
1 fvprmselelfz.f . . . . . 6 𝐹 = (𝑚 ∈ ℕ ↦ if(𝑚 ∈ ℙ, 𝑚, 1))
2 eleq1 2899 . . . . . . . 8 (𝑚 = 𝑋 → (𝑚 ∈ ℙ ↔ 𝑋 ∈ ℙ))
3 id 22 . . . . . . . 8 (𝑚 = 𝑋𝑚 = 𝑋)
42, 3ifbieq1d 4463 . . . . . . 7 (𝑚 = 𝑋 → if(𝑚 ∈ ℙ, 𝑚, 1) = if(𝑋 ∈ ℙ, 𝑋, 1))
5 iftrue 4446 . . . . . . . 8 (𝑋 ∈ ℙ → if(𝑋 ∈ ℙ, 𝑋, 1) = 𝑋)
65ad2antrr 725 . . . . . . 7 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 𝑋)
74, 6sylan9eqr 2878 . . . . . 6 ((((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑋)
8 elfznn 12919 . . . . . . . 8 (𝑋 ∈ (1...𝑁) → 𝑋 ∈ ℕ)
983ad2ant1 1130 . . . . . . 7 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → 𝑋 ∈ ℕ)
109adantl 485 . . . . . 6 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
111, 7, 10, 10fvmptd2 6749 . . . . 5 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 𝑋)
12 eleq1 2899 . . . . . . . 8 (𝑚 = 𝑌 → (𝑚 ∈ ℙ ↔ 𝑌 ∈ ℙ))
13 id 22 . . . . . . . 8 (𝑚 = 𝑌𝑚 = 𝑌)
1412, 13ifbieq1d 4463 . . . . . . 7 (𝑚 = 𝑌 → if(𝑚 ∈ ℙ, 𝑚, 1) = if(𝑌 ∈ ℙ, 𝑌, 1))
15 iftrue 4446 . . . . . . . 8 (𝑌 ∈ ℙ → if(𝑌 ∈ ℙ, 𝑌, 1) = 𝑌)
1615ad2antlr 726 . . . . . . 7 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 𝑌)
1714, 16sylan9eqr 2878 . . . . . 6 ((((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑌)
18 elfznn 12919 . . . . . . . 8 (𝑌 ∈ (1...𝑁) → 𝑌 ∈ ℕ)
19183ad2ant2 1131 . . . . . . 7 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → 𝑌 ∈ ℕ)
2019adantl 485 . . . . . 6 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
211, 17, 20, 20fvmptd2 6749 . . . . 5 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 𝑌)
2211, 21oveq12d 7148 . . . 4 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (𝑋 gcd 𝑌))
23 prmrp 16033 . . . . . . 7 ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → ((𝑋 gcd 𝑌) = 1 ↔ 𝑋𝑌))
2423biimprcd 253 . . . . . 6 (𝑋𝑌 → ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → (𝑋 gcd 𝑌) = 1))
25243ad2ant3 1132 . . . . 5 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → (𝑋 gcd 𝑌) = 1))
2625impcom 411 . . . 4 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝑋 gcd 𝑌) = 1)
2722, 26eqtrd 2856 . . 3 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
2827ex 416 . 2 ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
295ad2antrr 725 . . . . . . 7 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 𝑋)
304, 29sylan9eqr 2878 . . . . . 6 ((((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑋)
319adantl 485 . . . . . 6 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
321, 30, 31, 31fvmptd2 6749 . . . . 5 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 𝑋)
33 iffalse 4449 . . . . . . . 8 𝑌 ∈ ℙ → if(𝑌 ∈ ℙ, 𝑌, 1) = 1)
3433ad2antlr 726 . . . . . . 7 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 1)
3514, 34sylan9eqr 2878 . . . . . 6 ((((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
3619adantl 485 . . . . . 6 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
37 1nn 11626 . . . . . . 7 1 ∈ ℕ
3837a1i 11 . . . . . 6 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 1 ∈ ℕ)
391, 35, 36, 38fvmptd2 6749 . . . . 5 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 1)
4032, 39oveq12d 7148 . . . 4 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (𝑋 gcd 1))
41 prmz 15996 . . . . . 6 (𝑋 ∈ ℙ → 𝑋 ∈ ℤ)
42 gcd1 15853 . . . . . 6 (𝑋 ∈ ℤ → (𝑋 gcd 1) = 1)
4341, 42syl 17 . . . . 5 (𝑋 ∈ ℙ → (𝑋 gcd 1) = 1)
4443ad2antrr 725 . . . 4 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝑋 gcd 1) = 1)
4540, 44eqtrd 2856 . . 3 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
4645ex 416 . 2 ((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
47 iffalse 4449 . . . . . . . 8 𝑋 ∈ ℙ → if(𝑋 ∈ ℙ, 𝑋, 1) = 1)
4847ad2antrr 725 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 1)
494, 48sylan9eqr 2878 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
509adantl 485 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
5137a1i 11 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 1 ∈ ℕ)
521, 49, 50, 51fvmptd2 6749 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 1)
5315ad2antlr 726 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 𝑌)
5414, 53sylan9eqr 2878 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑌)
5519adantl 485 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
561, 54, 55, 55fvmptd2 6749 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 𝑌)
5752, 56oveq12d 7148 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (1 gcd 𝑌))
58 prmz 15996 . . . . . 6 (𝑌 ∈ ℙ → 𝑌 ∈ ℤ)
59 1gcd 15858 . . . . . 6 (𝑌 ∈ ℤ → (1 gcd 𝑌) = 1)
6058, 59syl 17 . . . . 5 (𝑌 ∈ ℙ → (1 gcd 𝑌) = 1)
6160ad2antlr 726 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (1 gcd 𝑌) = 1)
6257, 61eqtrd 2856 . . 3 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
6362ex 416 . 2 ((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
6447ad2antrr 725 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 1)
654, 64sylan9eqr 2878 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
669adantl 485 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
6737a1i 11 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 1 ∈ ℕ)
681, 65, 66, 67fvmptd2 6749 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 1)
6933ad2antlr 726 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 1)
7014, 69sylan9eqr 2878 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
7119adantl 485 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
721, 70, 71, 67fvmptd2 6749 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 1)
7368, 72oveq12d 7148 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (1 gcd 1))
74 1z 11990 . . . . 5 1 ∈ ℤ
75 1gcd 15858 . . . . 5 (1 ∈ ℤ → (1 gcd 1) = 1)
7674, 75mp1i 13 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (1 gcd 1) = 1)
7773, 76eqtrd 2856 . . 3 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
7877ex 416 . 2 ((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
7928, 46, 63, 784cases 1036 1 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1084   = wceq 1538  wcel 2115  wne 3007  ifcif 4440  cmpt 5119  cfv 6328  (class class class)co 7130  1c1 10515  cn 11615  cz 11959  ...cfz 12875   gcd cgcd 15820  cprime 15992
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436  ax-cnex 10570  ax-resscn 10571  ax-1cn 10572  ax-icn 10573  ax-addcl 10574  ax-addrcl 10575  ax-mulcl 10576  ax-mulrcl 10577  ax-mulcom 10578  ax-addass 10579  ax-mulass 10580  ax-distr 10581  ax-i2m1 10582  ax-1ne0 10583  ax-1rid 10584  ax-rnegex 10585  ax-rrecex 10586  ax-cnre 10587  ax-pre-lttri 10588  ax-pre-lttrn 10589  ax-pre-ltadd 10590  ax-pre-mulgt0 10591  ax-pre-sup 10592
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-nel 3112  df-ral 3131  df-rex 3132  df-reu 3133  df-rmo 3134  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-tp 4545  df-op 4547  df-uni 4812  df-iun 4894  df-br 5040  df-opab 5102  df-mpt 5120  df-tr 5146  df-id 5433  df-eprel 5438  df-po 5447  df-so 5448  df-fr 5487  df-we 5489  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-pred 6121  df-ord 6167  df-on 6168  df-lim 6169  df-suc 6170  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-riota 7088  df-ov 7133  df-oprab 7134  df-mpo 7135  df-om 7556  df-1st 7664  df-2nd 7665  df-wrecs 7922  df-recs 7983  df-rdg 8021  df-1o 8077  df-2o 8078  df-er 8264  df-en 8485  df-dom 8486  df-sdom 8487  df-fin 8488  df-sup 8882  df-inf 8883  df-pnf 10654  df-mnf 10655  df-xr 10656  df-ltxr 10657  df-le 10658  df-sub 10849  df-neg 10850  df-div 11275  df-nn 11616  df-2 11678  df-3 11679  df-n0 11876  df-z 11960  df-uz 12222  df-rp 12368  df-fz 12876  df-seq 13353  df-exp 13414  df-cj 14437  df-re 14438  df-im 14439  df-sqrt 14573  df-abs 14574  df-dvds 15587  df-gcd 15821  df-prm 15993
This theorem is referenced by:  prmodvdslcmf  16360
  Copyright terms: Public domain W3C validator