Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > gcdzeq | GIF version |
Description: A positive integer 𝐴 is equal to its gcd with an integer 𝐵 if and only if 𝐴 divides 𝐵. Generalization of gcdeq 10412. (Contributed by AV, 1-Jul-2020.) |
Ref | Expression |
---|---|
gcdzeq | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 𝐴 ↔ 𝐴 ∥ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnz 8370 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
2 | gcddvds 10355 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) ∥ 𝐴 ∧ (𝐴 gcd 𝐵) ∥ 𝐵)) | |
3 | 1, 2 | sylan 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) ∥ 𝐴 ∧ (𝐴 gcd 𝐵) ∥ 𝐵)) |
4 | 3 | simprd 112 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∥ 𝐵) |
5 | breq1 3788 | . . 3 ⊢ ((𝐴 gcd 𝐵) = 𝐴 → ((𝐴 gcd 𝐵) ∥ 𝐵 ↔ 𝐴 ∥ 𝐵)) | |
6 | 4, 5 | syl5ibcom 153 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 𝐴 → 𝐴 ∥ 𝐵)) |
7 | 1 | adantr 270 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℤ) |
8 | iddvds 10208 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → 𝐴 ∥ 𝐴) | |
9 | 7, 8 | syl 14 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → 𝐴 ∥ 𝐴) |
10 | simpr 108 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ) | |
11 | nnne0 8067 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ≠ 0) | |
12 | simpl 107 | . . . . . . . . 9 ⊢ ((𝐴 = 0 ∧ 𝐵 = 0) → 𝐴 = 0) | |
13 | 12 | necon3ai 2294 | . . . . . . . 8 ⊢ (𝐴 ≠ 0 → ¬ (𝐴 = 0 ∧ 𝐵 = 0)) |
14 | 11, 13 | syl 14 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → ¬ (𝐴 = 0 ∧ 𝐵 = 0)) |
15 | 14 | adantr 270 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ¬ (𝐴 = 0 ∧ 𝐵 = 0)) |
16 | dvdslegcd 10356 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → ((𝐴 ∥ 𝐴 ∧ 𝐴 ∥ 𝐵) → 𝐴 ≤ (𝐴 gcd 𝐵))) | |
17 | 7, 7, 10, 15, 16 | syl31anc 1172 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ((𝐴 ∥ 𝐴 ∧ 𝐴 ∥ 𝐵) → 𝐴 ≤ (𝐴 gcd 𝐵))) |
18 | 9, 17 | mpand 419 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 ∥ 𝐵 → 𝐴 ≤ (𝐴 gcd 𝐵))) |
19 | 3 | simpld 110 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∥ 𝐴) |
20 | gcdcl 10358 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∈ ℕ0) | |
21 | 1, 20 | sylan 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∈ ℕ0) |
22 | 21 | nn0zd 8467 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∈ ℤ) |
23 | simpl 107 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℕ) | |
24 | dvdsle 10244 | . . . . . 6 ⊢ (((𝐴 gcd 𝐵) ∈ ℤ ∧ 𝐴 ∈ ℕ) → ((𝐴 gcd 𝐵) ∥ 𝐴 → (𝐴 gcd 𝐵) ≤ 𝐴)) | |
25 | 22, 23, 24 | syl2anc 403 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) ∥ 𝐴 → (𝐴 gcd 𝐵) ≤ 𝐴)) |
26 | 19, 25 | mpd 13 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ≤ 𝐴) |
27 | 18, 26 | jctild 309 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 ∥ 𝐵 → ((𝐴 gcd 𝐵) ≤ 𝐴 ∧ 𝐴 ≤ (𝐴 gcd 𝐵)))) |
28 | 21 | nn0red 8342 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) ∈ ℝ) |
29 | nnre 8046 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
30 | 29 | adantr 270 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → 𝐴 ∈ ℝ) |
31 | 28, 30 | letri3d 7226 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 𝐴 ↔ ((𝐴 gcd 𝐵) ≤ 𝐴 ∧ 𝐴 ≤ (𝐴 gcd 𝐵)))) |
32 | 27, 31 | sylibrd 167 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → (𝐴 ∥ 𝐵 → (𝐴 gcd 𝐵) = 𝐴)) |
33 | 6, 32 | impbid 127 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℤ) → ((𝐴 gcd 𝐵) = 𝐴 ↔ 𝐴 ∥ 𝐵)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 102 ↔ wb 103 = wceq 1284 ∈ wcel 1433 ≠ wne 2245 class class class wbr 3785 (class class class)co 5532 ℝcr 6980 0cc0 6981 ≤ cle 7154 ℕcn 8039 ℕ0cn0 8288 ℤcz 8351 ∥ cdvds 10195 gcd cgcd 10338 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-mulrcl 7075 ax-addcom 7076 ax-mulcom 7077 ax-addass 7078 ax-mulass 7079 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-1rid 7083 ax-0id 7084 ax-rnegex 7085 ax-precex 7086 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-apti 7091 ax-pre-ltadd 7092 ax-pre-mulgt0 7093 ax-pre-mulext 7094 ax-arch 7095 ax-caucvg 7096 |
This theorem depends on definitions: df-bi 115 df-dc 776 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rmo 2356 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-if 3352 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-id 4048 df-po 4051 df-iso 4052 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-frec 6001 df-sup 6397 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-reap 7675 df-ap 7682 df-div 7761 df-inn 8040 df-2 8098 df-3 8099 df-4 8100 df-n0 8289 df-z 8352 df-uz 8620 df-q 8705 df-rp 8735 df-fz 9030 df-fzo 9153 df-fl 9274 df-mod 9325 df-iseq 9432 df-iexp 9476 df-cj 9729 df-re 9730 df-im 9731 df-rsqrt 9884 df-abs 9885 df-dvds 10196 df-gcd 10339 |
This theorem is referenced by: gcdeq 10412 isevengcd2 10537 |
Copyright terms: Public domain | W3C validator |