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 11755 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∥ 0) | |
2 | 1 | ad2antrr 485 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ 0) |
3 | oveq1 5857 | . . . . . . 7 ⊢ (𝑀 = 0 → (𝑀 lcm 𝑁) = (0 lcm 𝑁)) | |
4 | 0z 9210 | . . . . . . . . 9 ⊢ 0 ∈ ℤ | |
5 | lcmcom 12005 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → (𝑁 lcm 0) = (0 lcm 𝑁)) | |
6 | 4, 5 | mpan2 423 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (𝑁 lcm 0) = (0 lcm 𝑁)) |
7 | lcm0val 12006 | . . . . . . . 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 5858 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝑀 lcm 𝑁) = (𝑀 lcm 0)) | |
12 | lcm0val 12006 | . . . . . . 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 4015 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (𝑀 lcm 𝑁)) |
17 | dvds0 11755 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∥ 0) | |
18 | 17 | ad2antlr 486 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ 0) |
19 | 18, 15 | breqtrrd 4015 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (𝑀 lcm 𝑁)) |
20 | 16, 19 | jca 304 | . 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 ∥ (𝑀 lcm 𝑁) ∧ 𝑁 ∥ (𝑀 lcm 𝑁))) |
21 | lcmcllem 12008 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 lcm 𝑁) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}) | |
22 | lcmn0cl 12009 | . . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 lcm 𝑁) ∈ ℕ) | |
23 | breq2 3991 | . . . . . 6 ⊢ (𝑛 = (𝑀 lcm 𝑁) → (𝑀 ∥ 𝑛 ↔ 𝑀 ∥ (𝑀 lcm 𝑁))) | |
24 | breq2 3991 | . . . . . 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 12003 | . . 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 3987 (class class class)co 5850 0cc0 7761 ℕcn 8865 ℤcz 9199 ∥ cdvds 11736 lcm clcm 12001 |
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 4102 ax-sep 4105 ax-nul 4113 ax-pow 4158 ax-pr 4192 ax-un 4416 ax-setind 4519 ax-iinf 4570 ax-cnex 7852 ax-resscn 7853 ax-1cn 7854 ax-1re 7855 ax-icn 7856 ax-addcl 7857 ax-addrcl 7858 ax-mulcl 7859 ax-mulrcl 7860 ax-addcom 7861 ax-mulcom 7862 ax-addass 7863 ax-mulass 7864 ax-distr 7865 ax-i2m1 7866 ax-0lt1 7867 ax-1rid 7868 ax-0id 7869 ax-rnegex 7870 ax-precex 7871 ax-cnre 7872 ax-pre-ltirr 7873 ax-pre-ltwlin 7874 ax-pre-lttrn 7875 ax-pre-apti 7876 ax-pre-ltadd 7877 ax-pre-mulgt0 7878 ax-pre-mulext 7879 ax-arch 7880 ax-caucvg 7881 |
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 3526 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-int 3830 df-iun 3873 df-br 3988 df-opab 4049 df-mpt 4050 df-tr 4086 df-id 4276 df-po 4279 df-iso 4280 df-iord 4349 df-on 4351 df-ilim 4352 df-suc 4354 df-iom 4573 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-rn 4620 df-res 4621 df-ima 4622 df-iota 5158 df-fun 5198 df-fn 5199 df-f 5200 df-f1 5201 df-fo 5202 df-f1o 5203 df-fv 5204 df-isom 5205 df-riota 5806 df-ov 5853 df-oprab 5854 df-mpo 5855 df-1st 6116 df-2nd 6117 df-recs 6281 df-frec 6367 df-sup 6957 df-inf 6958 df-pnf 7943 df-mnf 7944 df-xr 7945 df-ltxr 7946 df-le 7947 df-sub 8079 df-neg 8080 df-reap 8481 df-ap 8488 df-div 8577 df-inn 8866 df-2 8924 df-3 8925 df-4 8926 df-n0 9123 df-z 9200 df-uz 9475 df-q 9566 df-rp 9598 df-fz 9953 df-fzo 10086 df-fl 10213 df-mod 10266 df-seqfrec 10389 df-exp 10463 df-cj 10793 df-re 10794 df-im 10795 df-rsqrt 10949 df-abs 10950 df-dvds 11737 df-lcm 12002 |
This theorem is referenced by: gcddvdslcm 12014 lcmneg 12015 lcmgcdeq 12024 lcmdvdsb 12025 |
Copyright terms: Public domain | W3C validator |