![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > gcdmultipled | GIF version |
Description: The greatest common divisor of a nonnegative integer 𝑀 and a multiple of it is 𝑀 itself. (Contributed by Rohan Ridenour, 3-Aug-2023.) |
Ref | Expression |
---|---|
gcdmultipled.1 | ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
gcdmultipled.2 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
Ref | Expression |
---|---|
gcdmultipled | ⊢ (𝜑 → (𝑀 gcd (𝑁 · 𝑀)) = 𝑀) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gcdmultipled.2 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
2 | gcdmultipled.1 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ0) | |
3 | 2 | nn0zd 9423 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
4 | 0zd 9315 | . . 3 ⊢ (𝜑 → 0 ∈ ℤ) | |
5 | gcdaddm 12095 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 0 ∈ ℤ) → (𝑀 gcd 0) = (𝑀 gcd (0 + (𝑁 · 𝑀)))) | |
6 | 1, 3, 4, 5 | syl3anc 1249 | . 2 ⊢ (𝜑 → (𝑀 gcd 0) = (𝑀 gcd (0 + (𝑁 · 𝑀)))) |
7 | nn0gcdid0 12092 | . . 3 ⊢ (𝑀 ∈ ℕ0 → (𝑀 gcd 0) = 𝑀) | |
8 | 2, 7 | syl 14 | . 2 ⊢ (𝜑 → (𝑀 gcd 0) = 𝑀) |
9 | 1, 3 | zmulcld 9431 | . . . . 5 ⊢ (𝜑 → (𝑁 · 𝑀) ∈ ℤ) |
10 | 9 | zcnd 9426 | . . . 4 ⊢ (𝜑 → (𝑁 · 𝑀) ∈ ℂ) |
11 | 10 | addlidd 8155 | . . 3 ⊢ (𝜑 → (0 + (𝑁 · 𝑀)) = (𝑁 · 𝑀)) |
12 | 11 | oveq2d 5922 | . 2 ⊢ (𝜑 → (𝑀 gcd (0 + (𝑁 · 𝑀))) = (𝑀 gcd (𝑁 · 𝑀))) |
13 | 6, 8, 12 | 3eqtr3rd 2231 | 1 ⊢ (𝜑 → (𝑀 gcd (𝑁 · 𝑀)) = 𝑀) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 ∈ wcel 2160 (class class class)co 5906 0cc0 7858 + caddc 7861 · cmul 7863 ℕ0cn0 9226 ℤcz 9303 gcd cgcd 12053 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4140 ax-sep 4143 ax-nul 4151 ax-pow 4199 ax-pr 4234 ax-un 4458 ax-setind 4561 ax-iinf 4612 ax-cnex 7949 ax-resscn 7950 ax-1cn 7951 ax-1re 7952 ax-icn 7953 ax-addcl 7954 ax-addrcl 7955 ax-mulcl 7956 ax-mulrcl 7957 ax-addcom 7958 ax-mulcom 7959 ax-addass 7960 ax-mulass 7961 ax-distr 7962 ax-i2m1 7963 ax-0lt1 7964 ax-1rid 7965 ax-0id 7966 ax-rnegex 7967 ax-precex 7968 ax-cnre 7969 ax-pre-ltirr 7970 ax-pre-ltwlin 7971 ax-pre-lttrn 7972 ax-pre-apti 7973 ax-pre-ltadd 7974 ax-pre-mulgt0 7975 ax-pre-mulext 7976 ax-arch 7977 ax-caucvg 7978 |
This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2758 df-sbc 2982 df-csb 3077 df-dif 3151 df-un 3153 df-in 3155 df-ss 3162 df-nul 3443 df-if 3554 df-pw 3599 df-sn 3620 df-pr 3621 df-op 3623 df-uni 3832 df-int 3867 df-iun 3910 df-br 4026 df-opab 4087 df-mpt 4088 df-tr 4124 df-id 4318 df-po 4321 df-iso 4322 df-iord 4391 df-on 4393 df-ilim 4394 df-suc 4396 df-iom 4615 df-xp 4657 df-rel 4658 df-cnv 4659 df-co 4660 df-dm 4661 df-rn 4662 df-res 4663 df-ima 4664 df-iota 5203 df-fun 5244 df-fn 5245 df-f 5246 df-f1 5247 df-fo 5248 df-f1o 5249 df-fv 5250 df-riota 5861 df-ov 5909 df-oprab 5910 df-mpo 5911 df-1st 6180 df-2nd 6181 df-recs 6345 df-frec 6431 df-sup 7029 df-pnf 8042 df-mnf 8043 df-xr 8044 df-ltxr 8045 df-le 8046 df-sub 8178 df-neg 8179 df-reap 8580 df-ap 8587 df-div 8678 df-inn 8969 df-2 9027 df-3 9028 df-4 9029 df-n0 9227 df-z 9304 df-uz 9579 df-q 9671 df-rp 9706 df-fz 10061 df-fzo 10195 df-fl 10325 df-mod 10380 df-seqfrec 10505 df-exp 10584 df-cj 10960 df-re 10961 df-im 10962 df-rsqrt 11116 df-abs 11117 df-dvds 11905 df-gcd 12054 |
This theorem is referenced by: dvdsgcdidd 12105 |
Copyright terms: Public domain | W3C validator |