Metamath Proof Explorer


Theorem divgcdoddALTV

Description: Either A / ( A gcd B ) is odd or B / ( A gcd B ) is odd. (Contributed by Scott Fenton, 19-Apr-2014) (Revised by AV, 21-Jun-2020)

Ref Expression
Assertion divgcdoddALTV ⊢ A ∈ ℕ ∧ B ∈ ℕ → A A gcd B ∈ Odd ∨ B A gcd B ∈ Odd

Proof

Step Hyp Ref Expression
1 divgcdodd ⊢ A ∈ ℕ ∧ B ∈ ℕ → ¬ 2 ∥ A A gcd B ∨ ¬ 2 ∥ B A gcd B
2 nnz ⊢ A ∈ ℕ → A ∈ ℤ
3 nnz ⊢ B ∈ ℕ → B ∈ ℤ
4 gcddvds ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∥ A ∧ A gcd B ∥ B
5 2 3 4 syl2an ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∥ A ∧ A gcd B ∥ B
6 5 simpld ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∥ A
7 2 3 anim12i ⊢ A ∈ ℕ ∧ B ∈ ℕ → A ∈ ℤ ∧ B ∈ ℤ
8 nnne0 ⊢ A ∈ ℕ → A ≠ 0
9 8 neneqd ⊢ A ∈ ℕ → ¬ A = 0
10 9 intnanrd ⊢ A ∈ ℕ → ¬ A = 0 ∧ B = 0
11 10 adantr ⊢ A ∈ ℕ ∧ B ∈ ℕ → ¬ A = 0 ∧ B = 0
12 gcdn0cl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ ¬ A = 0 ∧ B = 0 → A gcd B ∈ ℕ
13 7 11 12 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∈ ℕ
14 13 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∈ ℤ
15 13 nnne0d ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ≠ 0
16 2 adantr ⊢ A ∈ ℕ ∧ B ∈ ℕ → A ∈ ℤ
17 dvdsval2 ⊢ A gcd B ∈ ℤ ∧ A gcd B ≠ 0 ∧ A ∈ ℤ → A gcd B ∥ A ↔ A A gcd B ∈ ℤ
18 14 15 16 17 syl3anc ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∥ A ↔ A A gcd B ∈ ℤ
19 6 18 mpbid ⊢ A ∈ ℕ ∧ B ∈ ℕ → A A gcd B ∈ ℤ
20 19 biantrurd ⊢ A ∈ ℕ ∧ B ∈ ℕ → ¬ 2 ∥ A A gcd B ↔ A A gcd B ∈ ℤ ∧ ¬ 2 ∥ A A gcd B
21 5 simprd ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∥ B
22 3 adantl ⊢ A ∈ ℕ ∧ B ∈ ℕ → B ∈ ℤ
23 dvdsval2 ⊢ A gcd B ∈ ℤ ∧ A gcd B ≠ 0 ∧ B ∈ ℤ → A gcd B ∥ B ↔ B A gcd B ∈ ℤ
24 14 15 22 23 syl3anc ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B ∥ B ↔ B A gcd B ∈ ℤ
25 21 24 mpbid ⊢ A ∈ ℕ ∧ B ∈ ℕ → B A gcd B ∈ ℤ
26 25 biantrurd ⊢ A ∈ ℕ ∧ B ∈ ℕ → ¬ 2 ∥ B A gcd B ↔ B A gcd B ∈ ℤ ∧ ¬ 2 ∥ B A gcd B
27 20 26 orbi12d ⊢ A ∈ ℕ ∧ B ∈ ℕ → ¬ 2 ∥ A A gcd B ∨ ¬ 2 ∥ B A gcd B ↔ A A gcd B ∈ ℤ ∧ ¬ 2 ∥ A A gcd B ∨ B A gcd B ∈ ℤ ∧ ¬ 2 ∥ B A gcd B
28 1 27 mpbid ⊢ A ∈ ℕ ∧ B ∈ ℕ → A A gcd B ∈ ℤ ∧ ¬ 2 ∥ A A gcd B ∨ B A gcd B ∈ ℤ ∧ ¬ 2 ∥ B A gcd B
29 isodd3 ⊢ A A gcd B ∈ Odd ↔ A A gcd B ∈ ℤ ∧ ¬ 2 ∥ A A gcd B
30 isodd3 ⊢ B A gcd B ∈ Odd ↔ B A gcd B ∈ ℤ ∧ ¬ 2 ∥ B A gcd B
31 29 30 orbi12i ⊢ A A gcd B ∈ Odd ∨ B A gcd B ∈ Odd ↔ A A gcd B ∈ ℤ ∧ ¬ 2 ∥ A A gcd B ∨ B A gcd B ∈ ℤ ∧ ¬ 2 ∥ B A gcd B
32 28 31 sylibr ⊢ A ∈ ℕ ∧ B ∈ ℕ → A A gcd B ∈ Odd ∨ B A gcd B ∈ Odd