| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ncoprmgcdne1b | Structured version Visualization version GIF version | ||
| Description: Two positive integers are not coprime, i.e. there is an integer greater than 1 which divides both integers, iff their greatest common divisor is not 1. See prmdvdsncoprmbd 16947 for a version where the existential quantifier is restricted to primes. (Contributed by AV, 9-Aug-2020.) |
| Ref | Expression |
|---|---|
| ncoprmgcdne1b | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (∃𝑖 ∈ (ℤ≥‘2)(𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ↔ (𝐴 gcd 𝐵) ≠ 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluz2nn 13055 | . . . . . 6 ⊢ (𝑖 ∈ (ℤ≥‘2) → 𝑖 ∈ ℕ) | |
| 2 | 1 | adantr 486 | . . . . 5 ⊢ ((𝑖 ∈ (ℤ≥‘2) ∧ (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵)) → 𝑖 ∈ ℕ) |
| 3 | eluz2b3 13089 | . . . . . . 7 ⊢ (𝑖 ∈ (ℤ≥‘2) ↔ (𝑖 ∈ ℕ ∧ 𝑖 ≠ 1)) | |
| 4 | neneq 2965 | . . . . . . 7 ⊢ (𝑖 ≠ 1 → ¬ 𝑖 = 1) | |
| 5 | 3, 4 | simplbiim 514 | . . . . . 6 ⊢ (𝑖 ∈ (ℤ≥‘2) → ¬ 𝑖 = 1) |
| 6 | 5 | anim1ci 628 | . . . . 5 ⊢ ((𝑖 ∈ (ℤ≥‘2) ∧ (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵)) → ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1)) |
| 7 | 2, 6 | jca 521 | . . . 4 ⊢ ((𝑖 ∈ (ℤ≥‘2) ∧ (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵)) → (𝑖 ∈ ℕ ∧ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1))) |
| 8 | neqne 2967 | . . . . . . . . . . . 12 ⊢ (¬ 𝑖 = 1 → 𝑖 ≠ 1) | |
| 9 | 8 | anim1ci 628 | . . . . . . . . . . 11 ⊢ ((¬ 𝑖 = 1 ∧ 𝑖 ∈ ℕ) → (𝑖 ∈ ℕ ∧ 𝑖 ≠ 1)) |
| 10 | 9, 3 | sylibr 237 | . . . . . . . . . 10 ⊢ ((¬ 𝑖 = 1 ∧ 𝑖 ∈ ℕ) → 𝑖 ∈ (ℤ≥‘2)) |
| 11 | 10 | ex 418 | . . . . . . . . 9 ⊢ (¬ 𝑖 = 1 → (𝑖 ∈ ℕ → 𝑖 ∈ (ℤ≥‘2))) |
| 12 | 11 | adantl 487 | . . . . . . . 8 ⊢ (((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1) → (𝑖 ∈ ℕ → 𝑖 ∈ (ℤ≥‘2))) |
| 13 | 12 | impcom 413 | . . . . . . 7 ⊢ ((𝑖 ∈ ℕ ∧ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1)) → 𝑖 ∈ (ℤ≥‘2)) |
| 14 | 13 | adantl 487 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝑖 ∈ ℕ ∧ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1))) → 𝑖 ∈ (ℤ≥‘2)) |
| 15 | simprrl 793 | . . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝑖 ∈ ℕ ∧ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1))) → (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵)) | |
| 16 | 14, 15 | jca 521 | . . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝑖 ∈ ℕ ∧ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1))) → (𝑖 ∈ (ℤ≥‘2) ∧ (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵))) |
| 17 | 16 | ex 418 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝑖 ∈ ℕ ∧ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1)) → (𝑖 ∈ (ℤ≥‘2) ∧ (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵)))) |
| 18 | 7, 17 | impbid2 229 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝑖 ∈ (ℤ≥‘2) ∧ (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵)) ↔ (𝑖 ∈ ℕ ∧ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1)))) |
| 19 | 18 | rexbidv2 3186 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (∃𝑖 ∈ (ℤ≥‘2)(𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ↔ ∃𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1))) |
| 20 | rexanali 3120 | . . 3 ⊢ (∃𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1) ↔ ¬ ∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1)) | |
| 21 | 20 | a1i 11 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (∃𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ∧ ¬ 𝑖 = 1) ↔ ¬ ∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1))) |
| 22 | coprmgcdb 16868 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1) ↔ (𝐴 gcd 𝐵) = 1)) | |
| 23 | 22 | necon3bbid 2996 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (¬ ∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1) ↔ (𝐴 gcd 𝐵) ≠ 1)) |
| 24 | 19, 21, 23 | 3bitrd 308 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (∃𝑖 ∈ (ℤ≥‘2)(𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) ↔ (𝐴 gcd 𝐵) ≠ 1)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 1c1 11240 ℕcn 12375 2c2 12437 ℤ≥cuz 13005 ∥ cdvds 16466 gcd cgcd 16708 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-dvds 16467 df-gcd 16709 |
| This theorem is used by: ncoprmgcdgt1b 16870 prmdvdsncoprmbd 16947 |
| Copyright terms: Public domain | W3C validator |