Proof of Theorem divcoprmndiv
| Step | Hyp | Ref
| Expression |
| 1 | | eluzelz 13014 |
. . . . . . . . . . . . . 14
⊢ (𝑁 ∈
(ℤ≥‘2) → 𝑁 ∈ ℤ) |
| 2 | 1 | adantr 486 |
. . . . . . . . . . . . 13
⊢ ((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) → 𝑁 ∈ ℤ) |
| 3 | 2 | anim1i 627 |
. . . . . . . . . . . 12
⊢ (((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) → (𝑁 ∈ ℤ ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ))) |
| 4 | | 3anass 1112 |
. . . . . . . . . . . 12
⊢ ((𝑁 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ↔ (𝑁 ∈ ℤ ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈
ℤ))) |
| 5 | 3, 4 | sylibr 237 |
. . . . . . . . . . 11
⊢ (((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) → (𝑁 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) |
| 6 | 5 | adantr 486 |
. . . . . . . . . 10
⊢ ((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) → (𝑁 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) |
| 7 | 6 | adantr 486 |
. . . . . . . . 9
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → (𝑁 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) |
| 8 | | ax-1ne0 11307 |
. . . . . . . . . . . . 13
⊢ 1 ≠
0 |
| 9 | 8 | neii 2964 |
. . . . . . . . . . . 12
⊢ ¬ 1
= 0 |
| 10 | | eqeq1 2770 |
. . . . . . . . . . . 12
⊢ ((𝐴 gcd 𝐵) = 1 → ((𝐴 gcd 𝐵) = 0 ↔ 1 = 0)) |
| 11 | 9, 10 | mtbiri 330 |
. . . . . . . . . . 11
⊢ ((𝐴 gcd 𝐵) = 1 → ¬ (𝐴 gcd 𝐵) = 0) |
| 12 | 11 | adantl 487 |
. . . . . . . . . 10
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → ¬ (𝐴 gcd 𝐵) = 0) |
| 13 | | gcdeq0 16731 |
. . . . . . . . . . . 12
⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
| 14 | 13 | notbid 321 |
. . . . . . . . . . 11
⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (¬
(𝐴 gcd 𝐵) = 0 ↔ ¬ (𝐴 = 0 ∧ 𝐵 = 0))) |
| 15 | 14 | ad3antlr 744 |
. . . . . . . . . 10
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → (¬ (𝐴 gcd 𝐵) = 0 ↔ ¬ (𝐴 = 0 ∧ 𝐵 = 0))) |
| 16 | 12, 15 | mpbid 235 |
. . . . . . . . 9
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → ¬ (𝐴 = 0 ∧ 𝐵 = 0)) |
| 17 | | simplr 781 |
. . . . . . . . . . 11
⊢ (((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) → 𝑁 ∥ 𝐴) |
| 18 | 17 | anim1i 627 |
. . . . . . . . . 10
⊢ ((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) → (𝑁 ∥ 𝐴 ∧ 𝑁 ∥ 𝐵)) |
| 19 | 18 | adantr 486 |
. . . . . . . . 9
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → (𝑁 ∥ 𝐴 ∧ 𝑁 ∥ 𝐵)) |
| 20 | | dvdslegcd 16716 |
. . . . . . . . . 10
⊢ (((𝑁 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ ¬
(𝐴 = 0 ∧ 𝐵 = 0)) → ((𝑁 ∥ 𝐴 ∧ 𝑁 ∥ 𝐵) → 𝑁 ≤ (𝐴 gcd 𝐵))) |
| 21 | 20 | imp 412 |
. . . . . . . . 9
⊢ ((((𝑁 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ ¬
(𝐴 = 0 ∧ 𝐵 = 0)) ∧ (𝑁 ∥ 𝐴 ∧ 𝑁 ∥ 𝐵)) → 𝑁 ≤ (𝐴 gcd 𝐵)) |
| 22 | 7, 16, 19, 21 | syl21anc 851 |
. . . . . . . 8
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → 𝑁 ≤ (𝐴 gcd 𝐵)) |
| 23 | | breq2 5111 |
. . . . . . . . . 10
⊢ ((𝐴 gcd 𝐵) = 1 → (𝑁 ≤ (𝐴 gcd 𝐵) ↔ 𝑁 ≤ 1)) |
| 24 | 23 | adantl 487 |
. . . . . . . . 9
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → (𝑁 ≤ (𝐴 gcd 𝐵) ↔ 𝑁 ≤ 1)) |
| 25 | | eluz2 13010 |
. . . . . . . . . . 11
⊢ (𝑁 ∈
(ℤ≥‘2) ↔ (2 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 2 ≤
𝑁)) |
| 26 | | 1zzd 12766 |
. . . . . . . . . . . . . . . 16
⊢ (𝑁 ∈ ℤ → 1 ∈
ℤ) |
| 27 | | id 23 |
. . . . . . . . . . . . . . . 16
⊢ (𝑁 ∈ ℤ → 𝑁 ∈
ℤ) |
| 28 | 26, 27 | zltp1led 12790 |
. . . . . . . . . . . . . . 15
⊢ (𝑁 ∈ ℤ → (1 <
𝑁 ↔ (1 + 1) ≤ 𝑁)) |
| 29 | | 1p1e2 12505 |
. . . . . . . . . . . . . . . . 17
⊢ (1 + 1) =
2 |
| 30 | 29 | a1i 11 |
. . . . . . . . . . . . . . . 16
⊢ (𝑁 ∈ ℤ → (1 + 1) =
2) |
| 31 | 30 | breq1d 5117 |
. . . . . . . . . . . . . . 15
⊢ (𝑁 ∈ ℤ → ((1 + 1)
≤ 𝑁 ↔ 2 ≤ 𝑁)) |
| 32 | 28, 31 | bitrd 282 |
. . . . . . . . . . . . . 14
⊢ (𝑁 ∈ ℤ → (1 <
𝑁 ↔ 2 ≤ 𝑁)) |
| 33 | | 1red 11347 |
. . . . . . . . . . . . . . . 16
⊢ (𝑁 ∈ ℤ → 1 ∈
ℝ) |
| 34 | | zre 12736 |
. . . . . . . . . . . . . . . 16
⊢ (𝑁 ∈ ℤ → 𝑁 ∈
ℝ) |
| 35 | 33, 34 | ltnled 11495 |
. . . . . . . . . . . . . . 15
⊢ (𝑁 ∈ ℤ → (1 <
𝑁 ↔ ¬ 𝑁 ≤ 1)) |
| 36 | | pm2.21 124 |
. . . . . . . . . . . . . . 15
⊢ (¬
𝑁 ≤ 1 → (𝑁 ≤ 1 → ¬ 𝑁 ∥ 𝐵)) |
| 37 | 35, 36 | biimtrdi 256 |
. . . . . . . . . . . . . 14
⊢ (𝑁 ∈ ℤ → (1 <
𝑁 → (𝑁 ≤ 1 → ¬ 𝑁 ∥ 𝐵))) |
| 38 | 32, 37 | sylbird 263 |
. . . . . . . . . . . . 13
⊢ (𝑁 ∈ ℤ → (2 ≤
𝑁 → (𝑁 ≤ 1 → ¬ 𝑁 ∥ 𝐵))) |
| 39 | 38 | imp 412 |
. . . . . . . . . . . 12
⊢ ((𝑁 ∈ ℤ ∧ 2 ≤
𝑁) → (𝑁 ≤ 1 → ¬ 𝑁 ∥ 𝐵)) |
| 40 | 39 | 3adant1 1149 |
. . . . . . . . . . 11
⊢ ((2
∈ ℤ ∧ 𝑁
∈ ℤ ∧ 2 ≤ 𝑁) → (𝑁 ≤ 1 → ¬ 𝑁 ∥ 𝐵)) |
| 41 | 25, 40 | sylbi 220 |
. . . . . . . . . 10
⊢ (𝑁 ∈
(ℤ≥‘2) → (𝑁 ≤ 1 → ¬ 𝑁 ∥ 𝐵)) |
| 42 | 41 | ad4antr 745 |
. . . . . . . . 9
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → (𝑁 ≤ 1 → ¬ 𝑁 ∥ 𝐵)) |
| 43 | 24, 42 | sylbid 243 |
. . . . . . . 8
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → (𝑁 ≤ (𝐴 gcd 𝐵) → ¬ 𝑁 ∥ 𝐵)) |
| 44 | 22, 43 | mpd 16 |
. . . . . . 7
⊢
(((((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) ∧ 𝑁 ∥ 𝐵) ∧ (𝐴 gcd 𝐵) = 1) → ¬ 𝑁 ∥ 𝐵) |
| 45 | 44 | exp31 425 |
. . . . . 6
⊢ (((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) → (𝑁 ∥ 𝐵 → ((𝐴 gcd 𝐵) = 1 → ¬ 𝑁 ∥ 𝐵))) |
| 46 | 45 | com23 87 |
. . . . 5
⊢ (((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) ∧ (𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ)) → ((𝐴 gcd 𝐵) = 1 → (𝑁 ∥ 𝐵 → ¬ 𝑁 ∥ 𝐵))) |
| 47 | 46 | ex 418 |
. . . 4
⊢ ((𝑁 ∈
(ℤ≥‘2) ∧ 𝑁 ∥ 𝐴) → ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 1 → (𝑁 ∥ 𝐵 → ¬ 𝑁 ∥ 𝐵)))) |
| 48 | 47 | com14 97 |
. . 3
⊢ (𝑁 ∥ 𝐵 → ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 1 → ((𝑁 ∈ (ℤ≥‘2)
∧ 𝑁 ∥ 𝐴) → ¬ 𝑁 ∥ 𝐵)))) |
| 49 | 48 | 3impd 1369 |
. 2
⊢ (𝑁 ∥ 𝐵 → (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐴 gcd 𝐵) = 1 ∧ (𝑁 ∈ (ℤ≥‘2)
∧ 𝑁 ∥ 𝐴)) → ¬ 𝑁 ∥ 𝐵)) |
| 50 | | ax-1 6 |
. 2
⊢ (¬
𝑁 ∥ 𝐵 → (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐴 gcd 𝐵) = 1 ∧ (𝑁 ∈ (ℤ≥‘2)
∧ 𝑁 ∥ 𝐴)) → ¬ 𝑁 ∥ 𝐵)) |
| 51 | 49, 50 | pm2.61i 184 |
1
⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐴 gcd 𝐵) = 1 ∧ (𝑁 ∈ (ℤ≥‘2)
∧ 𝑁 ∥ 𝐴)) → ¬ 𝑁 ∥ 𝐵) |