6lcm4e12 - Intuitionistic Logic Explorer

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

Theorem 6lcm4e12 12720

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 9268	. . . 4 ⊢ 6 ∈ ℂ
2		4cn 9264	. . . 4 ⊢ 4 ∈ ℂ
3	1, 2	mulcli 8227	. . 3 ⊢ (6 · 4) ∈ ℂ
4		6nn0 9466	. . . . 5 ⊢ 6 ∈ ℕ₀
5	4	nn0zi 9544	. . . 4 ⊢ 6 ∈ ℤ
6		4z 9552	. . . 4 ⊢ 4 ∈ ℤ
7		lcmcl 12705	. . . . 5 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 lcm 4) ∈ ℕ₀)
8	7	nn0cnd 9500	. . . 4 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 lcm 4) ∈ ℂ)
9	5, 6, 8	mp2an 426	. . 3 ⊢ (6 lcm 4) ∈ ℂ
10		gcdcl 12598	. . . . . 6 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) ∈ ℕ₀)
11	10	nn0cnd 9500	. . . . 5 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) ∈ ℂ)
12	5, 6, 11	mp2an 426	. . . 4 ⊢ (6 gcd 4) ∈ ℂ
13	5, 6	pm3.2i 272	. . . . . . 7 ⊢ (6 ∈ ℤ ∧ 4 ∈ ℤ)
14		4ne0 9284	. . . . . . . . 9 ⊢ 4 ≠ 0
15	14	neii 2405	. . . . . . . 8 ⊢ ¬ 4 = 0
16	15	intnan 937	. . . . . . 7 ⊢ ¬ (6 = 0 ∧ 4 = 0)
17		gcdn0cl 12594	. . . . . . 7 ⊢ (((6 ∈ ℤ ∧ 4 ∈ ℤ) ∧ ¬ (6 = 0 ∧ 4 = 0)) → (6 gcd 4) ∈ ℕ)
18	13, 16, 17	mp2an 426	. . . . . 6 ⊢ (6 gcd 4) ∈ ℕ
19	18	nnne0i 9218	. . . . 5 ⊢ (6 gcd 4) ≠ 0
20	18	nnzi 9543	. . . . . 6 ⊢ (6 gcd 4) ∈ ℤ
21		0z 9533	. . . . . 6 ⊢ 0 ∈ ℤ
22		zapne 9597	. . . . . 6 ⊢ (((6 gcd 4) ∈ ℤ ∧ 0 ∈ ℤ) → ((6 gcd 4) # 0 ↔ (6 gcd 4) ≠ 0))
23	20, 21, 22	mp2an 426	. . . . 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 9352	. . . . . . . 8 ⊢ 6 ∈ ℕ
27		4nn 9350	. . . . . . . 8 ⊢ 4 ∈ ℕ
28	26, 27	pm3.2i 272	. . . . . . 7 ⊢ (6 ∈ ℕ ∧ 4 ∈ ℕ)
29		lcmgcdnn 12715	. . . . . . 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 2237	. . . . 5 ⊢ (((6 · 4) ∈ ℂ ∧ (6 lcm 4) ∈ ℂ ∧ ((6 gcd 4) ∈ ℂ ∧ (6 gcd 4) # 0)) → (6 · 4) = ((6 lcm 4) · (6 gcd 4)))
32		divmulap3 8900	. . . . 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 2237	. . 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 1374	. 2 ⊢ (6 lcm 4) = ((6 · 4) / (6 gcd 4))
36		6gcd4e2 12627	. . 3 ⊢ (6 gcd 4) = 2
37	36	oveq2i 6039	. 2 ⊢ ((6 · 4) / (6 gcd 4)) = ((6 · 4) / 2)
38		2cn 9257	. . . 4 ⊢ 2 ∈ ℂ
39		2ap0 9279	. . . 4 ⊢ 2 # 0
40	1, 2, 38, 39	divassapi 8991	. . 3 ⊢ ((6 · 4) / 2) = (6 · (4 / 2))
41		4d2e2 9347	. . . 4 ⊢ (4 / 2) = 2
42	41	oveq2i 6039	. . 3 ⊢ (6 · (4 / 2)) = (6 · 2)
43		6t2e12 9757	. . 3 ⊢ (6 · 2) = ;12
44	40, 42, 43	3eqtri 2256	. 2 ⊢ ((6 · 4) / 2) = ;12
45	35, 37, 44	3eqtri 2256	1 ⊢ (6 lcm 4) = ;12

Colors of variables: wff set class

Syntax hints: ¬ wn 3 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ≠ wne 2403 class class class wbr 4093 (class class class)co 6028 ℂcc 8073 0cc0 8075 1c1 8076 · cmul 8080 # cap 8804 / cdiv 8895 ℕcn 9186 2c2 9237 4c4 9239 6c6 9241 ℤcz 9522 cdc 9654 gcd cgcd 12585 lcm clcm 12693

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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195

This theorem depends on definitions: df-bi 117 df-stab 839 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-isom 5342 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-sup 7226 df-inf 7227 df-pnf 8259 df-mnf 8260 df-xr 8261 df-ltxr 8262 df-le 8263 df-sub 8395 df-neg 8396 df-reap 8798 df-ap 8805 df-div 8896 df-inn 9187 df-2 9245 df-3 9246 df-4 9247 df-5 9248 df-6 9249 df-7 9250 df-8 9251 df-9 9252 df-n0 9446 df-z 9523 df-dec 9655 df-uz 9799 df-q 9897 df-rp 9932 df-fz 10287 df-fzo 10421 df-fl 10574 df-mod 10629 df-seqfrec 10754 df-exp 10845 df-cj 11463 df-re 11464 df-im 11465 df-rsqrt 11619 df-abs 11620 df-dvds 12410 df-gcd 12586 df-lcm 12694

This theorem is referenced by: (None)

W3C validator