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

Theorem fvprmselgcd1 16974
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 2821 . . . . . . . 8 (𝑚 = 𝑋 → (𝑚 ∈ ℙ ↔ 𝑋 ∈ ℙ))
3 id 22 . . . . . . . 8 (𝑚 = 𝑋𝑚 = 𝑋)
42, 3ifbieq1d 4551 . . . . . . 7 (𝑚 = 𝑋 → if(𝑚 ∈ ℙ, 𝑚, 1) = if(𝑋 ∈ ℙ, 𝑋, 1))
5 iftrue 4533 . . . . . . . 8 (𝑋 ∈ ℙ → if(𝑋 ∈ ℙ, 𝑋, 1) = 𝑋)
65ad2antrr 724 . . . . . . 7 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 𝑋)
74, 6sylan9eqr 2794 . . . . . 6 ((((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑋)
8 elfznn 13526 . . . . . . . 8 (𝑋 ∈ (1...𝑁) → 𝑋 ∈ ℕ)
983ad2ant1 1133 . . . . . . 7 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → 𝑋 ∈ ℕ)
109adantl 482 . . . . . 6 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
111, 7, 10, 10fvmptd2 7003 . . . . 5 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 𝑋)
12 eleq1 2821 . . . . . . . 8 (𝑚 = 𝑌 → (𝑚 ∈ ℙ ↔ 𝑌 ∈ ℙ))
13 id 22 . . . . . . . 8 (𝑚 = 𝑌𝑚 = 𝑌)
1412, 13ifbieq1d 4551 . . . . . . 7 (𝑚 = 𝑌 → if(𝑚 ∈ ℙ, 𝑚, 1) = if(𝑌 ∈ ℙ, 𝑌, 1))
15 iftrue 4533 . . . . . . . 8 (𝑌 ∈ ℙ → if(𝑌 ∈ ℙ, 𝑌, 1) = 𝑌)
1615ad2antlr 725 . . . . . . 7 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 𝑌)
1714, 16sylan9eqr 2794 . . . . . 6 ((((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑌)
18 elfznn 13526 . . . . . . . 8 (𝑌 ∈ (1...𝑁) → 𝑌 ∈ ℕ)
19183ad2ant2 1134 . . . . . . 7 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → 𝑌 ∈ ℕ)
2019adantl 482 . . . . . 6 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
211, 17, 20, 20fvmptd2 7003 . . . . 5 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 𝑌)
2211, 21oveq12d 7423 . . . 4 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (𝑋 gcd 𝑌))
23 prmrp 16645 . . . . . . 7 ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → ((𝑋 gcd 𝑌) = 1 ↔ 𝑋𝑌))
2423biimprcd 249 . . . . . 6 (𝑋𝑌 → ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → (𝑋 gcd 𝑌) = 1))
25243ad2ant3 1135 . . . . 5 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → (𝑋 gcd 𝑌) = 1))
2625impcom 408 . . . 4 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝑋 gcd 𝑌) = 1)
2722, 26eqtrd 2772 . . 3 (((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
2827ex 413 . 2 ((𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
295ad2antrr 724 . . . . . . 7 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 𝑋)
304, 29sylan9eqr 2794 . . . . . 6 ((((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑋)
319adantl 482 . . . . . 6 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
321, 30, 31, 31fvmptd2 7003 . . . . 5 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 𝑋)
33 iffalse 4536 . . . . . . . 8 𝑌 ∈ ℙ → if(𝑌 ∈ ℙ, 𝑌, 1) = 1)
3433ad2antlr 725 . . . . . . 7 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 1)
3514, 34sylan9eqr 2794 . . . . . 6 ((((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
3619adantl 482 . . . . . 6 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
37 1nn 12219 . . . . . . 7 1 ∈ ℕ
3837a1i 11 . . . . . 6 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 1 ∈ ℕ)
391, 35, 36, 38fvmptd2 7003 . . . . 5 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 1)
4032, 39oveq12d 7423 . . . 4 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (𝑋 gcd 1))
41 prmz 16608 . . . . . 6 (𝑋 ∈ ℙ → 𝑋 ∈ ℤ)
42 gcd1 16465 . . . . . 6 (𝑋 ∈ ℤ → (𝑋 gcd 1) = 1)
4341, 42syl 17 . . . . 5 (𝑋 ∈ ℙ → (𝑋 gcd 1) = 1)
4443ad2antrr 724 . . . 4 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝑋 gcd 1) = 1)
4540, 44eqtrd 2772 . . 3 (((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
4645ex 413 . 2 ((𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
47 iffalse 4536 . . . . . . . 8 𝑋 ∈ ℙ → if(𝑋 ∈ ℙ, 𝑋, 1) = 1)
4847ad2antrr 724 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 1)
494, 48sylan9eqr 2794 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
509adantl 482 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
5137a1i 11 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 1 ∈ ℕ)
521, 49, 50, 51fvmptd2 7003 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 1)
5315ad2antlr 725 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 𝑌)
5414, 53sylan9eqr 2794 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 𝑌)
5519adantl 482 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
561, 54, 55, 55fvmptd2 7003 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 𝑌)
5752, 56oveq12d 7423 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (1 gcd 𝑌))
58 prmz 16608 . . . . . 6 (𝑌 ∈ ℙ → 𝑌 ∈ ℤ)
59 1gcd 16471 . . . . . 6 (𝑌 ∈ ℤ → (1 gcd 𝑌) = 1)
6058, 59syl 17 . . . . 5 (𝑌 ∈ ℙ → (1 gcd 𝑌) = 1)
6160ad2antlr 725 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (1 gcd 𝑌) = 1)
6257, 61eqtrd 2772 . . 3 (((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
6362ex 413 . 2 ((¬ 𝑋 ∈ ℙ ∧ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
6447ad2antrr 724 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑋 ∈ ℙ, 𝑋, 1) = 1)
654, 64sylan9eqr 2794 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑋) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
669adantl 482 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑋 ∈ ℕ)
6737a1i 11 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 1 ∈ ℕ)
681, 65, 66, 67fvmptd2 7003 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑋) = 1)
6933ad2antlr 725 . . . . . . 7 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → if(𝑌 ∈ ℙ, 𝑌, 1) = 1)
7014, 69sylan9eqr 2794 . . . . . 6 ((((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) ∧ 𝑚 = 𝑌) → if(𝑚 ∈ ℙ, 𝑚, 1) = 1)
7119adantl 482 . . . . . 6 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → 𝑌 ∈ ℕ)
721, 70, 71, 67fvmptd2 7003 . . . . 5 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (𝐹𝑌) = 1)
7368, 72oveq12d 7423 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = (1 gcd 1))
74 1z 12588 . . . . 5 1 ∈ ℤ
75 1gcd 16471 . . . . 5 (1 ∈ ℤ → (1 gcd 1) = 1)
7674, 75mp1i 13 . . . 4 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → (1 gcd 1) = 1)
7773, 76eqtrd 2772 . . 3 (((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) ∧ (𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌)) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
7877ex 413 . 2 ((¬ 𝑋 ∈ ℙ ∧ ¬ 𝑌 ∈ ℙ) → ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1))
7928, 46, 63, 784cases 1039 1 ((𝑋 ∈ (1...𝑁) ∧ 𝑌 ∈ (1...𝑁) ∧ 𝑋𝑌) → ((𝐹𝑋) gcd (𝐹𝑌)) = 1)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wne 2940  ifcif 4527  cmpt 5230  cfv 6540  (class class class)co 7405  1c1 11107  cn 12208  cz 12554  ...cfz 13480   gcd cgcd 16431  cprime 16604
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  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 theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-1st 7971  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-1o 8462  df-2o 8463  df-er 8699  df-en 8936  df-dom 8937  df-sdom 8938  df-fin 8939  df-sup 9433  df-inf 9434  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-div 11868  df-nn 12209  df-2 12271  df-3 12272  df-n0 12469  df-z 12555  df-uz 12819  df-rp 12971  df-fz 13481  df-seq 13963  df-exp 14024  df-cj 15042  df-re 15043  df-im 15044  df-sqrt 15178  df-abs 15179  df-dvds 16194  df-gcd 16432  df-prm 16605
This theorem is referenced by:  prmodvdslcmf  16976
  Copyright terms: Public domain W3C validator