lcmid - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > lcmid		GIF version

Theorem lcmid 10462

Description: The lcm of an integer and itself is its absolute value. (Contributed by Steve Rodriguez, 20-Jan-2020.)

**Assertion**
Ref	Expression
lcmid	⊢ (𝑀 ∈ ℤ → (𝑀 lcm 𝑀) = (abs‘𝑀))

**Proof of Theorem lcmid**
Step	Hyp	Ref	Expression
1		lcm0val 10447	. . . 4 ⊢ (𝑀 ∈ ℤ → (𝑀 lcm 0) = 0)
2	1	adantr 270	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 = 0) → (𝑀 lcm 0) = 0)
3		oveq2 5540	. . . . 5 ⊢ (𝑀 = 0 → (𝑀 lcm 𝑀) = (𝑀 lcm 0))
4		fveq2 5198	. . . . . 6 ⊢ (𝑀 = 0 → (abs‘𝑀) = (abs‘0))
5		abs0 9944	. . . . . 6 ⊢ (abs‘0) = 0
6	4, 5	syl6eq 2129	. . . . 5 ⊢ (𝑀 = 0 → (abs‘𝑀) = 0)
7	3, 6	eqeq12d 2095	. . . 4 ⊢ (𝑀 = 0 → ((𝑀 lcm 𝑀) = (abs‘𝑀) ↔ (𝑀 lcm 0) = 0))
8	7	adantl 271	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 = 0) → ((𝑀 lcm 𝑀) = (abs‘𝑀) ↔ (𝑀 lcm 0) = 0))
9	2, 8	mpbird 165	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 = 0) → (𝑀 lcm 𝑀) = (abs‘𝑀))
10		df-ne 2246	. . 3 ⊢ (𝑀 ≠ 0 ↔ ¬ 𝑀 = 0)
11		lcmcl 10454	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 lcm 𝑀) ∈ ℕ₀)
12	11	nn0cnd 8343	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 lcm 𝑀) ∈ ℂ)
13	12	anidms 389	. . . . 5 ⊢ (𝑀 ∈ ℤ → (𝑀 lcm 𝑀) ∈ ℂ)
14	13	adantr 270	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (𝑀 lcm 𝑀) ∈ ℂ)
15		zabscl 9972	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (abs‘𝑀) ∈ ℤ)
16	15	zcnd 8470	. . . . 5 ⊢ (𝑀 ∈ ℤ → (abs‘𝑀) ∈ ℂ)
17	16	adantr 270	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) ∈ ℂ)
18		zcn 8356	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
19	18	adantr 270	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → 𝑀 ∈ ℂ)
20		simpr 108	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → 𝑀 ≠ 0)
21	19, 20	absne0d 10073	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) ≠ 0)
22		0zd 8363	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → 0 ∈ ℤ)
23		zapne 8422	. . . . . 6 ⊢ (((abs‘𝑀) ∈ ℤ ∧ 0 ∈ ℤ) → ((abs‘𝑀) # 0 ↔ (abs‘𝑀) ≠ 0))
24	15, 22, 23	syl2an2r 559	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → ((abs‘𝑀) # 0 ↔ (abs‘𝑀) ≠ 0))
25	21, 24	mpbird 165	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) # 0)
26		lcmgcd 10460	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝑀 lcm 𝑀) · (𝑀 gcd 𝑀)) = (abs‘(𝑀 · 𝑀)))
27	26	anidms 389	. . . . . 6 ⊢ (𝑀 ∈ ℤ → ((𝑀 lcm 𝑀) · (𝑀 gcd 𝑀)) = (abs‘(𝑀 · 𝑀)))
28		gcdid 10377	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀 gcd 𝑀) = (abs‘𝑀))
29	28	oveq2d 5548	. . . . . 6 ⊢ (𝑀 ∈ ℤ → ((𝑀 lcm 𝑀) · (𝑀 gcd 𝑀)) = ((𝑀 lcm 𝑀) · (abs‘𝑀)))
30	18, 18	absmuld 10080	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (abs‘(𝑀 · 𝑀)) = ((abs‘𝑀) · (abs‘𝑀)))
31	27, 29, 30	3eqtr3d 2121	. . . . 5 ⊢ (𝑀 ∈ ℤ → ((𝑀 lcm 𝑀) · (abs‘𝑀)) = ((abs‘𝑀) · (abs‘𝑀)))
32	31	adantr 270	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → ((𝑀 lcm 𝑀) · (abs‘𝑀)) = ((abs‘𝑀) · (abs‘𝑀)))
33	14, 17, 17, 25, 32	mulcanap2ad 7754	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (𝑀 lcm 𝑀) = (abs‘𝑀))
34	10, 33	sylan2br 282	. 2 ⊢ ((𝑀 ∈ ℤ ∧ ¬ 𝑀 = 0) → (𝑀 lcm 𝑀) = (abs‘𝑀))
35		0z 8362	. . . 4 ⊢ 0 ∈ ℤ
36		zdceq 8423	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑀 = 0)
37	35, 36	mpan2 415	. . 3 ⊢ (𝑀 ∈ ℤ → DECID 𝑀 = 0)
38		exmiddc 777	. . 3 ⊢ (DECID 𝑀 = 0 → (𝑀 = 0 ∨ ¬ 𝑀 = 0))
39	37, 38	syl 14	. 2 ⊢ (𝑀 ∈ ℤ → (𝑀 = 0 ∨ ¬ 𝑀 = 0))
40	9, 34, 39	mpjaodan 744	1 ⊢ (𝑀 ∈ ℤ → (𝑀 lcm 𝑀) = (abs‘𝑀))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 102 ↔ wb 103 ∨ wo 661 DECID wdc 775 = wceq 1284 ∈ wcel 1433 ≠ wne 2245 class class class wbr 3785 ‘cfv 4922 (class class class)co 5532 ℂcc 6979 0cc0 6981 · cmul 6986 # cap 7681 ℤcz 8351 abscabs 9883 gcd cgcd 10338 lcm clcm 10442

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-isom 4931 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-inf 6398 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 df-lcm 10443

This theorem is referenced by: lcmgcdeq 10465

W3C validator