| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gcdle1d | Structured version Visualization version GIF version | ||
| Description: The greatest common divisor of a positive integer and another integer is less than or equal to the positive integer. (Contributed by SN, 25-Aug-2024.) |
| Ref | Expression |
|---|---|
| gcdle1d.m | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| gcdle1d.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| Ref | Expression |
|---|---|
| gcdle1d | ⊢ (𝜑 → (𝑀 gcd 𝑁) ≤ 𝑀) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gcdle1d.m | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
| 2 | 1 | nnzd 12712 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 3 | gcdle1d.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 4 | gcddvds 16666 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) | |
| 5 | 2, 3, 4 | syl2anc 596 | . . 3 ⊢ (𝜑 → ((𝑀 gcd 𝑁) ∥ 𝑀 ∧ (𝑀 gcd 𝑁) ∥ 𝑁)) |
| 6 | 5 | simpld 500 | . 2 ⊢ (𝜑 → (𝑀 gcd 𝑁) ∥ 𝑀) |
| 7 | 2, 3 | gcdcld 16671 | . . . 4 ⊢ (𝜑 → (𝑀 gcd 𝑁) ∈ ℕ0) |
| 8 | 7 | nn0zd 12711 | . . 3 ⊢ (𝜑 → (𝑀 gcd 𝑁) ∈ ℤ) |
| 9 | dvdsle 16473 | . . 3 ⊢ (((𝑀 gcd 𝑁) ∈ ℤ ∧ 𝑀 ∈ ℕ) → ((𝑀 gcd 𝑁) ∥ 𝑀 → (𝑀 gcd 𝑁) ≤ 𝑀)) | |
| 10 | 8, 1, 9 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝑀 gcd 𝑁) ∥ 𝑀 → (𝑀 gcd 𝑁) ≤ 𝑀)) |
| 11 | 6, 10 | mpd 16 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) ≤ 𝑀) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2145 class class class wbr 5103 (class class class)co 7418 ≤ cle 11337 ℕcn 12328 ℤcz 12686 ∥ cdvds 16415 gcd cgcd 16657 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-sup 9427 df-inf 9428 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-seq 14138 df-exp 14198 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 df-dvds 16416 df-gcd 16658 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |