6lcm4e12 - Intuitionistic Logic Explorer

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

Theorem 6lcm4e12 12890

Description: The least common multiple of six and four is twelve. (Contributed by AV, 27-Aug-2020.)

**Assertion**
Ref	Expression
6lcm4e12	⊢ (6 lcm 4) = ;12

**Proof of Theorem 6lcm4e12**
Step	Hyp	Ref	Expression
1		6cn 9395	. . . 4 ⊢ 6 ∈ ℂ
2		4cn 9391	. . . 4 ⊢ 4 ∈ ℂ
3	1, 2	mulcli 8337	. . 3 ⊢ (6 · 4) ∈ ℂ
4		6nn0 9595	. . . . 5 ⊢ 6 ∈ ℕ₀
5	4	nn0zi 9677	. . . 4 ⊢ 6 ∈ ℤ
6		4z 9685	. . . 4 ⊢ 4 ∈ ℤ
7		lcmcl 12875	. . . . 5 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 lcm 4) ∈ ℕ₀)
8	7	nn0cnd 9633	. . . 4 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 lcm 4) ∈ ℂ)
9	5, 6, 8	mp2an 430	. . 3 ⊢ (6 lcm 4) ∈ ℂ
10		gcdcl 12768	. . . . . 6 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) ∈ ℕ₀)
11	10	nn0cnd 9633	. . . . 5 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) ∈ ℂ)
12	5, 6, 11	mp2an 430	. . . 4 ⊢ (6 gcd 4) ∈ ℂ
13	5, 6	pm3.2i 272	. . . . . . 7 ⊢ (6 ∈ ℤ ∧ 4 ∈ ℤ)
14		4ne0 9411	. . . . . . . . 9 ⊢ 4 ≠ 0
15	14	neii 2422	. . . . . . . 8 ⊢ ¬ 4 = 0
16	15	intnan 941	. . . . . . 7 ⊢ ¬ (6 = 0 ∧ 4 = 0)
17		gcdn0cl 12764	. . . . . . 7 ⊢ (((6 ∈ ℤ ∧ 4 ∈ ℤ) ∧ ¬ (6 = 0 ∧ 4 = 0)) → (6 gcd 4) ∈ ℕ)
18	13, 16, 17	mp2an 430	. . . . . 6 ⊢ (6 gcd 4) ∈ ℕ
19	18	nnne0i 9345	. . . . 5 ⊢ (6 gcd 4) ≠ 0
20	18	nnzi 9676	. . . . . 6 ⊢ (6 gcd 4) ∈ ℤ
21		0z 9666	. . . . . 6 ⊢ 0 ∈ ℤ
22		zapne 9730	. . . . . 6 ⊢ (((6 gcd 4) ∈ ℤ ∧ 0 ∈ ℤ) → ((6 gcd 4) # 0 ↔ (6 gcd 4) ≠ 0))
23	20, 21, 22	mp2an 430	. . . . 5 ⊢ ((6 gcd 4) # 0 ↔ (6 gcd 4) ≠ 0)
24	19, 23	mpbir 146	. . . 4 ⊢ (6 gcd 4) # 0
25	12, 24	pm3.2i 272	. . 3 ⊢ ((6 gcd 4) ∈ ℂ ∧ (6 gcd 4) # 0)
26		6nn 9481	. . . . . . . 8 ⊢ 6 ∈ ℕ
27		4nn 9479	. . . . . . . 8 ⊢ 4 ∈ ℕ
28	26, 27	pm3.2i 272	. . . . . . 7 ⊢ (6 ∈ ℕ ∧ 4 ∈ ℕ)
29		lcmgcdnn 12885	. . . . . . 7 ⊢ ((6 ∈ ℕ ∧ 4 ∈ ℕ) → ((6 lcm 4) · (6 gcd 4)) = (6 · 4))
30	28, 29	mp1i 10	. . . . . 6 ⊢ (((6 · 4) ∈ ℂ ∧ (6 lcm 4) ∈ ℂ ∧ ((6 gcd 4) ∈ ℂ ∧ (6 gcd 4) # 0)) → ((6 lcm 4) · (6 gcd 4)) = (6 · 4))
31	30	eqcomd 2244	. . . . 5 ⊢ (((6 · 4) ∈ ℂ ∧ (6 lcm 4) ∈ ℂ ∧ ((6 gcd 4) ∈ ℂ ∧ (6 gcd 4) # 0)) → (6 · 4) = ((6 lcm 4) · (6 gcd 4)))
32		divmulap3 9015	. . . . 5 ⊢ (((6 · 4) ∈ ℂ ∧ (6 lcm 4) ∈ ℂ ∧ ((6 gcd 4) ∈ ℂ ∧ (6 gcd 4) # 0)) → (((6 · 4) / (6 gcd 4)) = (6 lcm 4) ↔ (6 · 4) = ((6 lcm 4) · (6 gcd 4))))
33	31, 32	mpbird 167	. . . 4 ⊢ (((6 · 4) ∈ ℂ ∧ (6 lcm 4) ∈ ℂ ∧ ((6 gcd 4) ∈ ℂ ∧ (6 gcd 4) # 0)) → ((6 · 4) / (6 gcd 4)) = (6 lcm 4))
34	33	eqcomd 2244	. . 3 ⊢ (((6 · 4) ∈ ℂ ∧ (6 lcm 4) ∈ ℂ ∧ ((6 gcd 4) ∈ ℂ ∧ (6 gcd 4) # 0)) → (6 lcm 4) = ((6 · 4) / (6 gcd 4)))
35	3, 9, 25, 34	mp3an 1378	. 2 ⊢ (6 lcm 4) = ((6 · 4) / (6 gcd 4))
36		6gcd4e2 12797	. . 3 ⊢ (6 gcd 4) = 2
37	36	oveq2i 6099	. 2 ⊢ ((6 · 4) / (6 gcd 4)) = ((6 · 4) / 2)
38		2cn 9384	. . . 4 ⊢ 2 ∈ ℂ
39		2ap0 9406	. . . 4 ⊢ 2 # 0
40	1, 2, 38, 39	divassapi 9106	. . 3 ⊢ ((6 · 4) / 2) = (6 · (4 / 2))
41		4d2e2 9476	. . . 4 ⊢ (4 / 2) = 2
42	41	oveq2i 6099	. . 3 ⊢ (6 · (4 / 2)) = (6 · 2)
43		6t2e12 9896	. . 3 ⊢ (6 · 2) = ;12
44	40, 42, 43	3eqtri 2263	. 2 ⊢ ((6 · 4) / 2) = ;12
45	35, 37, 44	3eqtri 2263	1 ⊢ (6 lcm 4) = ;12

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 class class class wbr 4131 (class class class)co 6088 ℂcc 8183 0cc0 8185 1c1 8186 · cmul 8190 # cap 8917 / cdiv 9010 ℕcn 9313 2c2 9364 4c4 9366 6c6 9368 ℤcz 9655 cdc 9788 gcd cgcd 12755 lcm clcm 12863

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 ax-arch 8304 ax-caucvg 8305

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-frec 6666 df-sup 7330 df-inf 7331 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-5 9375 df-6 9376 df-7 9377 df-8 9378 df-9 9379 df-n0 9575 df-z 9656 df-dec 9789 df-uz 9938 df-q 10036 df-rp 10072 df-fz 10429 df-fzo 10567 df-fl 10722 df-mod 10781 df-seqfrec 10906 df-exp 10997 df-cj 11629 df-re 11630 df-im 11631 df-rsqrt 11786 df-abs 11787 df-dvds 12580 df-gcd 12756 df-lcm 12864

This theorem is used by: (None)

W3C validator