Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dvdslcm | GIF version |
Description: The lcm of two integers is divisible by each of them. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
Ref | Expression |
---|---|
dvdslcm | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dvds0 11768 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∥ 0) | |
2 | 1 | ad2antrr 485 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ 0) |
3 | oveq1 5860 | . . . . . . 7 ⊢ (𝑀 = 0 → (𝑀 lcm 𝑁) = (0 lcm 𝑁)) | |
4 | 0z 9223 | . . . . . . . . 9 ⊢ 0 ∈ ℤ | |
5 | lcmcom 12018 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → (𝑁 lcm 0) = (0 lcm 𝑁)) | |
6 | 4, 5 | mpan2 423 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (𝑁 lcm 0) = (0 lcm 𝑁)) |
7 | lcm0val 12019 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (𝑁 lcm 0) = 0) | |
8 | 6, 7 | eqtr3d 2205 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (0 lcm 𝑁) = 0) |
9 | 3, 8 | sylan9eqr 2225 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 = 0) → (𝑀 lcm 𝑁) = 0) |
10 | 9 | adantll 473 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑀 = 0) → (𝑀 lcm 𝑁) = 0) |
11 | oveq2 5861 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝑀 lcm 𝑁) = (𝑀 lcm 0)) | |
12 | lcm0val 12019 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀 lcm 0) = 0) | |
13 | 11, 12 | sylan9eqr 2225 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 = 0) → (𝑀 lcm 𝑁) = 0) |
14 | 13 | adantlr 474 | . . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 = 0) → (𝑀 lcm 𝑁) = 0) |
15 | 10, 14 | jaodan 792 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 lcm 𝑁) = 0) |
16 | 2, 15 | breqtrrd 4017 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (𝑀 lcm 𝑁)) |
17 | dvds0 11768 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∥ 0) | |
18 | 17 | ad2antlr 486 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ 0) |
19 | 18, 15 | breqtrrd 4017 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (𝑀 lcm 𝑁)) |
20 | 16, 19 | jca 304 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁))) |
21 | lcmcllem 12021 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 lcm 𝑁) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}) | |
22 | lcmn0cl 12022 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 lcm 𝑁) ∈ ℕ) | |
23 | breq2 3993 | . . . . . 6 ⊢ (𝑛 = (𝑀 lcm 𝑁) → (𝑀 ∥ 𝑛 ↔ 𝑀 ∥ (𝑀 lcm 𝑁))) | |
24 | breq2 3993 | . . . . . 6 ⊢ (𝑛 = (𝑀 lcm 𝑁) → (𝑁 ∥ 𝑛 ↔ 𝑁 ∥ (𝑀 lcm 𝑁))) | |
25 | 23, 24 | anbi12d 470 | . . . . 5 ⊢ (𝑛 = (𝑀 lcm 𝑁) → ((𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛) ↔ (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁)))) |
26 | 25 | elrab3 2887 | . . . 4 ⊢ ((𝑀 lcm 𝑁) ∈ ℕ → ((𝑀 lcm 𝑁) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁)))) |
27 | 22, 26 | syl 14 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ((𝑀 lcm 𝑁) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁)))) |
28 | 21, 27 | mpbid 146 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁))) |
29 | lcmmndc 12016 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID (𝑀 = 0 ∨ 𝑁 = 0)) | |
30 | exmiddc 831 | . . 3 ⊢ (DECID (𝑀 = 0 ∨ 𝑁 = 0) → ((𝑀 = 0 ∨ 𝑁 = 0) ∨ ¬ (𝑀 = 0 ∨ 𝑁 = 0))) | |
31 | 29, 30 | syl 14 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 = 0 ∨ 𝑁 = 0) ∨ ¬ (𝑀 = 0 ∨ 𝑁 = 0))) |
32 | 20, 28, 31 | mpjaodan 793 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 703 DECID wdc 829 = wceq 1348 ∈ wcel 2141 {crab 2452 class class class wbr 3989 (class class class)co 5853 0cc0 7774 ℕcn 8878 ℤcz 9212 ∥ cdvds 11749 lcm clcm 12014 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4104 ax-sep 4107 ax-nul 4115 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-iinf 4572 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-mulrcl 7873 ax-addcom 7874 ax-mulcom 7875 ax-addass 7876 ax-mulass 7877 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-1rid 7881 ax-0id 7882 ax-rnegex 7883 ax-precex 7884 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 ax-pre-mulgt0 7891 ax-pre-mulext 7892 ax-arch 7893 ax-caucvg 7894 |
This theorem depends on definitions: df-bi 116 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-if 3527 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-iun 3875 df-br 3990 df-opab 4051 df-mpt 4052 df-tr 4088 df-id 4278 df-po 4281 df-iso 4282 df-iord 4351 df-on 4353 df-ilim 4354 df-suc 4356 df-iom 4575 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 df-fo 5204 df-f1o 5205 df-fv 5206 df-isom 5207 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-1st 6119 df-2nd 6120 df-recs 6284 df-frec 6370 df-sup 6961 df-inf 6962 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-sub 8092 df-neg 8093 df-reap 8494 df-ap 8501 df-div 8590 df-inn 8879 df-2 8937 df-3 8938 df-4 8939 df-n0 9136 df-z 9213 df-uz 9488 df-q 9579 df-rp 9611 df-fz 9966 df-fzo 10099 df-fl 10226 df-mod 10279 df-seqfrec 10402 df-exp 10476 df-cj 10806 df-re 10807 df-im 10808 df-rsqrt 10962 df-abs 10963 df-dvds 11750 df-lcm 12015 |
This theorem is referenced by: gcddvdslcm 12027 lcmneg 12028 lcmgcdeq 12037 lcmdvdsb 12038 |
Copyright terms: Public domain | W3C validator |