Theorem lcmval 11995

Description: Value of the lcm operator. (𝑀 lcm 𝑁) is the least common multiple of 𝑀 and 𝑁. If either 𝑀 or 𝑁 is 0, the result is defined conventionally as 0. Contrast with df-gcd 11876 and gcdval 11892. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Revised by AV, 16-Sep-2020.)

Assertion

Ref	Expression
lcmval	⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))

Distinct variable groups:   𝑛,𝑀   𝑛,𝑁

Proof of Theorem lcmval

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-lcm 11993	. . 3 ⊢ lcm = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )))
2	1	a1i 9	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → lcm = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ))))
3		eqeq1 2172	. . . . . 6 ⊢ (𝑥 = 𝑀 → (𝑥 = 0 ↔ 𝑀 = 0))
4	3	orbi1d 781	. . . . 5 ⊢ (𝑥 = 𝑀 → ((𝑥 = 0 ∨ 𝑦 = 0) ↔ (𝑀 = 0 ∨ 𝑦 = 0)))
5		breq1 3985	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → (𝑥 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛))
6	5	anbi1d 461	. . . . . . 7 ⊢ (𝑥 = 𝑀 → ((𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛) ↔ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)))
7	6	rabbidv 2715	. . . . . 6 ⊢ (𝑥 = 𝑀 → {𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)})
8	7	infeq1d 6977	. . . . 5 ⊢ (𝑥 = 𝑀 → inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ))
9	4, 8	ifbieq2d 3544	. . . 4 ⊢ (𝑥 = 𝑀 → if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )))
10		eqeq1 2172	. . . . . 6 ⊢ (𝑦 = 𝑁 → (𝑦 = 0 ↔ 𝑁 = 0))
11	10	orbi2d 780	. . . . 5 ⊢ (𝑦 = 𝑁 → ((𝑀 = 0 ∨ 𝑦 = 0) ↔ (𝑀 = 0 ∨ 𝑁 = 0)))
12		breq1 3985	. . . . . . . 8 ⊢ (𝑦 = 𝑁 → (𝑦 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛))
13	12	anbi2d 460	. . . . . . 7 ⊢ (𝑦 = 𝑁 → ((𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛) ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)))
14	13	rabbidv 2715	. . . . . 6 ⊢ (𝑦 = 𝑁 → {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
15	14	infeq1d 6977	. . . . 5 ⊢ (𝑦 = 𝑁 → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))
16	11, 15	ifbieq2d 3544	. . . 4 ⊢ (𝑦 = 𝑁 → if((𝑀 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))
17	9, 16	sylan9eq 2219	. . 3 ⊢ ((𝑥 = 𝑀 ∧ 𝑦 = 𝑁) → if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))
18	17	adantl 275	. 2 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 = 𝑀 ∧ 𝑦 = 𝑁)) → if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))
19		simpl 108	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℤ)
20		simpr 109	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℤ)
21		c0ex 7893	. . . 4 ⊢ 0 ∈ V
22	21	a1i 9	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 0 ∈ V)
23		1zzd 9218	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 1 ∈ ℤ)
24		nnuz 9501	. . . . . 6 ⊢ ℕ = (ℤ≥‘1)
25		rabeq 2718	. . . . . 6 ⊢ (ℕ = (ℤ≥‘1) → {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ (ℤ≥‘1) ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
26	24, 25	ax-mp 5	. . . . 5 ⊢ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ (ℤ≥‘1) ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}
27		dvdsmul1 11753	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∥ (𝑀 · 𝑁))
28	27	adantr 274	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (𝑀 · 𝑁))
29		simpll 519	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∈ ℤ)
30		simplr 520	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∈ ℤ)
31	29, 30	zmulcld 9319	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 · 𝑁) ∈ ℤ)
32		dvdsabsb 11750	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (𝑀 ∥ (𝑀 · 𝑁) ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
33	29, 31, 32	syl2anc 409	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 ∥ (𝑀 · 𝑁) ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
34	28, 33	mpbid 146	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (abs‘(𝑀 · 𝑁)))
35		dvdsmul2 11754	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∥ (𝑀 · 𝑁))
36	35	adantr 274	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (𝑀 · 𝑁))
37		dvdsabsb 11750	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (𝑁 ∥ (𝑀 · 𝑁) ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
38	30, 31, 37	syl2anc 409	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑁 ∥ (𝑀 · 𝑁) ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
39	36, 38	mpbid 146	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (abs‘(𝑀 · 𝑁)))
40	29	zcnd 9314	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∈ ℂ)
41	30	zcnd 9314	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∈ ℂ)
42	40, 41	absmuld 11136	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) = ((abs‘𝑀) · (abs‘𝑁)))
43		simpr 109	. . . . . . . . . . . . 13 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ¬ (𝑀 = 0 ∨ 𝑁 = 0))
44		ioran 742	. . . . . . . . . . . . 13 ⊢ (¬ (𝑀 = 0 ∨ 𝑁 = 0) ↔ (¬ 𝑀 = 0 ∧ ¬ 𝑁 = 0))
45	43, 44	sylib 121	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (¬ 𝑀 = 0 ∧ ¬ 𝑁 = 0))
46	45	simpld 111	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ¬ 𝑀 = 0)
47	46	neqned 2343	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ≠ 0)
48		nnabscl 11042	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) ∈ ℕ)
49	29, 47, 48	syl2anc 409	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘𝑀) ∈ ℕ)
50	45	simprd 113	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ¬ 𝑁 = 0)
51	50	neqned 2343	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ≠ 0)
52		nnabscl 11042	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (abs‘𝑁) ∈ ℕ)
53	30, 51, 52	syl2anc 409	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘𝑁) ∈ ℕ)
54	49, 53	nnmulcld 8906	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ((abs‘𝑀) · (abs‘𝑁)) ∈ ℕ)
55	42, 54	eqeltrd 2243	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) ∈ ℕ)
56		breq2 3986	. . . . . . . . 9 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → (𝑀 ∥ 𝑛 ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
57		breq2 3986	. . . . . . . . 9 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → (𝑁 ∥ 𝑛 ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
58	56, 57	anbi12d 465	. . . . . . . 8 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → ((𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛) ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
59	58	elrab3 2883	. . . . . . 7 ⊢ ((abs‘(𝑀 · 𝑁)) ∈ ℕ → ((abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
60	55, 59	syl 14	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ((abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
61	34, 39, 60	mpbir2and 934	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
62		elfzelz 9960	. . . . . . 7 ⊢ (𝑛 ∈ (1...(abs‘(𝑀 · 𝑁))) → 𝑛 ∈ ℤ)
63		zdvdsdc 11752	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ) → DECID 𝑀 ∥ 𝑛)
64	29, 62, 63	syl2an 287	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID 𝑀 ∥ 𝑛)
65		zdvdsdc 11752	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑛 ∈ ℤ) → DECID 𝑁 ∥ 𝑛)
66	30, 62, 65	syl2an 287	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID 𝑁 ∥ 𝑛)
67		dcan2 924	. . . . . 6 ⊢ (DECID 𝑀 ∥ 𝑛 → (DECID 𝑁 ∥ 𝑛 → DECID (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)))
68	64, 66, 67	sylc 62	. . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))
69	23, 26, 61, 68	infssuzcldc 11884	. . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
70	69	elexd 2739	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) ∈ V)
71		lcmmndc 11994	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID (𝑀 = 0 ∨ 𝑁 = 0))
72	22, 70, 71	ifcldadc 3549	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) ∈ V)
73	2, 18, 19, 20, 72	ovmpod 5969	1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 698  DECID wdc 824   = wceq 1343   ∈ wcel 2136   ≠ wne 2336  {crab 2448  Vcvv 2726  ifcif 3520   class class class wbr 3982  ‘cfv 5188  (class class class)co 5842   ∈ cmpo 5844  infcinf 6948  ℝcr 7752  0cc0 7753  1c1 7754   · cmul 7758   < clt 7933  ℕcn 8857  ℤcz 9191  ℤ_≥cuz 9466  ...cfz 9944  abscabs 10939   ∥ cdvds 11727   lcm clcm 11992

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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871  ax-arch 7872  ax-caucvg 7873

This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rmo 2452  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-isom 5197  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-frec 6359  df-sup 6949  df-inf 6950  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480  df-div 8569  df-inn 8858  df-2 8916  df-3 8917  df-4 8918  df-n0 9115  df-z 9192  df-uz 9467  df-q 9558  df-rp 9590  df-fz 9945  df-fzo 10078  df-fl 10205  df-mod 10258  df-seqfrec 10381  df-exp 10455  df-cj 10784  df-re 10785  df-im 10786  df-rsqrt 10940  df-abs 10941  df-dvds 11728  df-lcm 11993

This theorem is referenced by:  lcmcom  11996  lcm0val  11997  lcmn0val  11998  lcmass  12017