Metamath Proof Explorer


Theorem prmdvdsncoprmbd

Description: Two positive integers are not coprime iff a prime divides both integers. Deduction version of ncoprmgcdne1b with the existential quantifier over the primes instead of integers greater than or equal to 2. (Contributed by SN, 24-Aug-2024)

Ref Expression
Hypotheses prmdvdsncoprmbd.a ⊢ φ → A ∈ ℕ
prmdvdsncoprmbd.b ⊢ φ → B ∈ ℕ
Assertion prmdvdsncoprmbd ⊢ φ → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B ↔ A gcd B ≠ 1

Proof

Step Hyp Ref Expression
1 prmdvdsncoprmbd.a ⊢ φ → A ∈ ℕ
2 prmdvdsncoprmbd.b ⊢ φ → B ∈ ℕ
3 prmuz2 ⊢ p ∈ ℙ → p ∈ ℤ ≥ 2
4 3 a1i ⊢ φ → p ∈ ℙ → p ∈ ℤ ≥ 2
5 4 anim1d ⊢ φ → p ∈ ℙ ∧ p ∥ A ∧ p ∥ B → p ∈ ℤ ≥ 2 ∧ p ∥ A ∧ p ∥ B
6 5 reximdv2 ⊢ φ → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B → ∃ p ∈ ℤ ≥ 2 p ∥ A ∧ p ∥ B
7 breq1 ⊢ p = i → p ∥ A ↔ i ∥ A
8 breq1 ⊢ p = i → p ∥ B ↔ i ∥ B
9 7 8 anbi12d ⊢ p = i → p ∥ A ∧ p ∥ B ↔ i ∥ A ∧ i ∥ B
10 9 cbvrexvw ⊢ ∃ p ∈ ℤ ≥ 2 p ∥ A ∧ p ∥ B ↔ ∃ i ∈ ℤ ≥ 2 i ∥ A ∧ i ∥ B
11 6 10 imbitrdi ⊢ φ → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B → ∃ i ∈ ℤ ≥ 2 i ∥ A ∧ i ∥ B
12 exprmfct ⊢ i ∈ ℤ ≥ 2 → ∃ p ∈ ℙ p ∥ i
13 12 ad2antrl ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B → ∃ p ∈ ℙ p ∥ i
14 prmnn ⊢ p ∈ ℙ → p ∈ ℕ
15 14 ad2antlr ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → p ∈ ℕ
16 15 nnzd ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → p ∈ ℤ
17 eluzelz ⊢ i ∈ ℤ ≥ 2 → i ∈ ℤ
18 17 ad2antrr ⊢ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∥ i → i ∈ ℤ
19 18 ad4ant24 ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → i ∈ ℤ
20 1 ad3antrrr ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → A ∈ ℕ
21 20 nnzd ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → A ∈ ℤ
22 simpr ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → p ∥ i
23 simprrl ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B → i ∥ A
24 23 ad2antrr ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → i ∥ A
25 16 19 21 22 24 dvdstrd ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → p ∥ A
26 2 ad3antrrr ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → B ∈ ℕ
27 26 nnzd ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → B ∈ ℤ
28 simprrr ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B → i ∥ B
29 28 ad2antrr ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → i ∥ B
30 16 19 27 22 29 dvdstrd ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → p ∥ B
31 25 30 jca ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ ∧ p ∥ i → p ∥ A ∧ p ∥ B
32 31 ex ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B ∧ p ∈ ℙ → p ∥ i → p ∥ A ∧ p ∥ B
33 32 reximdva ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B → ∃ p ∈ ℙ p ∥ i → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B
34 13 33 mpd ⊢ φ ∧ i ∈ ℤ ≥ 2 ∧ i ∥ A ∧ i ∥ B → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B
35 34 rexlimdvaa ⊢ φ → ∃ i ∈ ℤ ≥ 2 i ∥ A ∧ i ∥ B → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B
36 11 35 impbid ⊢ φ → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B ↔ ∃ i ∈ ℤ ≥ 2 i ∥ A ∧ i ∥ B
37 ncoprmgcdne1b ⊢ A ∈ ℕ ∧ B ∈ ℕ → ∃ i ∈ ℤ ≥ 2 i ∥ A ∧ i ∥ B ↔ A gcd B ≠ 1
38 1 2 37 syl2anc ⊢ φ → ∃ i ∈ ℤ ≥ 2 i ∥ A ∧ i ∥ B ↔ A gcd B ≠ 1
39 36 38 bitrd ⊢ φ → ∃ p ∈ ℙ p ∥ A ∧ p ∥ B ↔ A gcd B ≠ 1