lcmid - Intuitionistic Logic Explorer

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

Theorem lcmid 12623

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 12608	. . . 4 ⊢ (𝑀 ∈ ℤ → (𝑀 lcm 0) = 0)
2	1	adantr 276	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 = 0) → (𝑀 lcm 0) = 0)
3		oveq2 6018	. . . . 5 ⊢ (𝑀 = 0 → (𝑀 lcm 𝑀) = (𝑀 lcm 0))
4		fveq2 5632	. . . . . 6 ⊢ (𝑀 = 0 → (abs‘𝑀) = (abs‘0))
5		abs0 11590	. . . . . 6 ⊢ (abs‘0) = 0
6	4, 5	eqtrdi 2278	. . . . 5 ⊢ (𝑀 = 0 → (abs‘𝑀) = 0)
7	3, 6	eqeq12d 2244	. . . 4 ⊢ (𝑀 = 0 → ((𝑀 lcm 𝑀) = (abs‘𝑀) ↔ (𝑀 lcm 0) = 0))
8	7	adantl 277	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 = 0) → ((𝑀 lcm 𝑀) = (abs‘𝑀) ↔ (𝑀 lcm 0) = 0))
9	2, 8	mpbird 167	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 = 0) → (𝑀 lcm 𝑀) = (abs‘𝑀))
10		df-ne 2401	. . 3 ⊢ (𝑀 ≠ 0 ↔ ¬ 𝑀 = 0)
11		lcmcl 12615	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 lcm 𝑀) ∈ ℕ₀)
12	11	nn0cnd 9440	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 lcm 𝑀) ∈ ℂ)
13	12	anidms 397	. . . . 5 ⊢ (𝑀 ∈ ℤ → (𝑀 lcm 𝑀) ∈ ℂ)
14	13	adantr 276	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (𝑀 lcm 𝑀) ∈ ℂ)
15		zabscl 11618	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (abs‘𝑀) ∈ ℤ)
16	15	zcnd 9586	. . . . 5 ⊢ (𝑀 ∈ ℤ → (abs‘𝑀) ∈ ℂ)
17	16	adantr 276	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) ∈ ℂ)
18		zcn 9467	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
19	18	adantr 276	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → 𝑀 ∈ ℂ)
20		simpr 110	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → 𝑀 ≠ 0)
21	19, 20	absne0d 11719	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) ≠ 0)
22		0zd 9474	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → 0 ∈ ℤ)
23		zapne 9537	. . . . . 6 ⊢ (((abs‘𝑀) ∈ ℤ ∧ 0 ∈ ℤ) → ((abs‘𝑀) # 0 ↔ (abs‘𝑀) ≠ 0))
24	15, 22, 23	syl2an2r 597	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → ((abs‘𝑀) # 0 ↔ (abs‘𝑀) ≠ 0))
25	21, 24	mpbird 167	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) # 0)
26		lcmgcd 12621	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ∈ ℤ) → ((𝑀 lcm 𝑀) · (𝑀 gcd 𝑀)) = (abs‘(𝑀 · 𝑀)))
27	26	anidms 397	. . . . . 6 ⊢ (𝑀 ∈ ℤ → ((𝑀 lcm 𝑀) · (𝑀 gcd 𝑀)) = (abs‘(𝑀 · 𝑀)))
28		gcdid 12528	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀 gcd 𝑀) = (abs‘𝑀))
29	28	oveq2d 6026	. . . . . 6 ⊢ (𝑀 ∈ ℤ → ((𝑀 lcm 𝑀) · (𝑀 gcd 𝑀)) = ((𝑀 lcm 𝑀) · (abs‘𝑀)))
30	18, 18	absmuld 11726	. . . . . 6 ⊢ (𝑀 ∈ ℤ → (abs‘(𝑀 · 𝑀)) = ((abs‘𝑀) · (abs‘𝑀)))
31	27, 29, 30	3eqtr3d 2270	. . . . 5 ⊢ (𝑀 ∈ ℤ → ((𝑀 lcm 𝑀) · (abs‘𝑀)) = ((abs‘𝑀) · (abs‘𝑀)))
32	31	adantr 276	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → ((𝑀 lcm 𝑀) · (abs‘𝑀)) = ((abs‘𝑀) · (abs‘𝑀)))
33	14, 17, 17, 25, 32	mulcanap2ad 8827	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (𝑀 lcm 𝑀) = (abs‘𝑀))
34	10, 33	sylan2br 288	. 2 ⊢ ((𝑀 ∈ ℤ ∧ ¬ 𝑀 = 0) → (𝑀 lcm 𝑀) = (abs‘𝑀))
35		0z 9473	. . . 4 ⊢ 0 ∈ ℤ
36		zdceq 9538	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 0 ∈ ℤ) → DECID 𝑀 = 0)
37	35, 36	mpan2 425	. . 3 ⊢ (𝑀 ∈ ℤ → DECID 𝑀 = 0)
38		exmiddc 841	. . 3 ⊢ (DECID 𝑀 = 0 → (𝑀 = 0 ∨ ¬ 𝑀 = 0))
39	37, 38	syl 14	. 2 ⊢ (𝑀 ∈ ℤ → (𝑀 = 0 ∨ ¬ 𝑀 = 0))
40	9, 34, 39	mpjaodan 803	1 ⊢ (𝑀 ∈ ℤ → (𝑀 lcm 𝑀) = (abs‘𝑀))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 DECID wdc 839 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 class class class wbr 4083 ‘cfv 5321 (class class class)co 6010 ℂcc 8013 0cc0 8015 · cmul 8020 # cap 8744 ℤcz 9462 abscabs 11529 gcd cgcd 12495 lcm clcm 12603

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-iinf 4681 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-mulrcl 8114 ax-addcom 8115 ax-mulcom 8116 ax-addass 8117 ax-mulass 8118 ax-distr 8119 ax-i2m1 8120 ax-0lt1 8121 ax-1rid 8122 ax-0id 8123 ax-rnegex 8124 ax-precex 8125 ax-cnre 8126 ax-pre-ltirr 8127 ax-pre-ltwlin 8128 ax-pre-lttrn 8129 ax-pre-apti 8130 ax-pre-ltadd 8131 ax-pre-mulgt0 8132 ax-pre-mulext 8133 ax-arch 8134 ax-caucvg 8135

This theorem depends on definitions: df-bi 117 df-stab 836 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4385 df-po 4388 df-iso 4389 df-iord 4458 df-on 4460 df-ilim 4461 df-suc 4463 df-iom 4684 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-isom 5330 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-recs 6462 df-frec 6548 df-sup 7167 df-inf 7168 df-pnf 8199 df-mnf 8200 df-xr 8201 df-ltxr 8202 df-le 8203 df-sub 8335 df-neg 8336 df-reap 8738 df-ap 8745 df-div 8836 df-inn 9127 df-2 9185 df-3 9186 df-4 9187 df-n0 9386 df-z 9463 df-uz 9739 df-q 9832 df-rp 9867 df-fz 10222 df-fzo 10356 df-fl 10507 df-mod 10562 df-seqfrec 10687 df-exp 10778 df-cj 11374 df-re 11375 df-im 11376 df-rsqrt 11530 df-abs 11531 df-dvds 12320 df-gcd 12496 df-lcm 12604

This theorem is referenced by: lcmgcdeq 12626

W3C validator