Theorem lcmval 11955

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 11842 and gcdval 11858. (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 11953	. . 3 ⊢ lcm = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )))
2	1	a1i 9	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → lcm = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ))))
3		eqeq1 2164	. . . . . 6 ⊢ (𝑥 = 𝑀 → (𝑥 = 0 ↔ 𝑀 = 0))
4	3	orbi1d 781	. . . . 5 ⊢ (𝑥 = 𝑀 → ((𝑥 = 0 ∨ 𝑦 = 0) ↔ (𝑀 = 0 ∨ 𝑦 = 0)))
5		breq1 3970	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → (𝑥 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛))
6	5	anbi1d 461	. . . . . . 7 ⊢ (𝑥 = 𝑀 → ((𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛) ↔ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)))
7	6	rabbidv 2701	. . . . . 6 ⊢ (𝑥 = 𝑀 → {𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)})
8	7	infeq1d 6958	. . . . 5 ⊢ (𝑥 = 𝑀 → inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ))
9	4, 8	ifbieq2d 3530	. . . 4 ⊢ (𝑥 = 𝑀 → if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )))
10		eqeq1 2164	. . . . . 6 ⊢ (𝑦 = 𝑁 → (𝑦 = 0 ↔ 𝑁 = 0))
11	10	orbi2d 780	. . . . 5 ⊢ (𝑦 = 𝑁 → ((𝑀 = 0 ∨ 𝑦 = 0) ↔ (𝑀 = 0 ∨ 𝑁 = 0)))
12		breq1 3970	. . . . . . . 8 ⊢ (𝑦 = 𝑁 → (𝑦 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛))
13	12	anbi2d 460	. . . . . . 7 ⊢ (𝑦 = 𝑁 → ((𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛) ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)))
14	13	rabbidv 2701	. . . . . 6 ⊢ (𝑦 = 𝑁 → {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
15	14	infeq1d 6958	. . . . 5 ⊢ (𝑦 = 𝑁 → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))
16	11, 15	ifbieq2d 3530	. . . 4 ⊢ (𝑦 = 𝑁 → if((𝑀 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))
17	9, 16	sylan9eq 2210	. . 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 7874	. . . 4 ⊢ 0 ∈ V
22	21	a1i 9	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 0 ∈ V)
23		1zzd 9199	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 1 ∈ ℤ)
24		nnuz 9479	. . . . . 6 ⊢ ℕ = (ℤ≥‘1)
25		rabeq 2704	. . . . . 6 ⊢ (ℕ = (ℤ≥‘1) → {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ (ℤ≥‘1) ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
26	24, 25	ax-mp 5	. . . . 5 ⊢ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ (ℤ≥‘1) ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}
27		dvdsmul1 11720	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∥ (𝑀 · 𝑁))
28	27	adantr 274	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (𝑀 · 𝑁))
29		simpll 519	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∈ ℤ)
30		simplr 520	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∈ ℤ)
31	29, 30	zmulcld 9297	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 · 𝑁) ∈ ℤ)
32		dvdsabsb 11717	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (𝑀 ∥ (𝑀 · 𝑁) ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
33	29, 31, 32	syl2anc 409	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 ∥ (𝑀 · 𝑁) ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
34	28, 33	mpbid 146	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (abs‘(𝑀 · 𝑁)))
35		dvdsmul2 11721	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∥ (𝑀 · 𝑁))
36	35	adantr 274	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (𝑀 · 𝑁))
37		dvdsabsb 11717	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (𝑁 ∥ (𝑀 · 𝑁) ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
38	30, 31, 37	syl2anc 409	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑁 ∥ (𝑀 · 𝑁) ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
39	36, 38	mpbid 146	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (abs‘(𝑀 · 𝑁)))
40	29	zcnd 9292	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∈ ℂ)
41	30	zcnd 9292	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∈ ℂ)
42	40, 41	absmuld 11105	. . . . . . . 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 2334	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ≠ 0)
48		nnabscl 11011	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) ∈ ℕ)
49	29, 47, 48	syl2anc 409	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘𝑀) ∈ ℕ)
50	45	simprd 113	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ¬ 𝑁 = 0)
51	50	neqned 2334	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ≠ 0)
52		nnabscl 11011	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (abs‘𝑁) ∈ ℕ)
53	30, 51, 52	syl2anc 409	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘𝑁) ∈ ℕ)
54	49, 53	nnmulcld 8887	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ((abs‘𝑀) · (abs‘𝑁)) ∈ ℕ)
55	42, 54	eqeltrd 2234	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) ∈ ℕ)
56		breq2 3971	. . . . . . . . 9 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → (𝑀 ∥ 𝑛 ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
57		breq2 3971	. . . . . . . . 9 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → (𝑁 ∥ 𝑛 ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
58	56, 57	anbi12d 465	. . . . . . . 8 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → ((𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛) ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
59	58	elrab3 2869	. . . . . . 7 ⊢ ((abs‘(𝑀 · 𝑁)) ∈ ℕ → ((abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
60	55, 59	syl 14	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ((abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
61	34, 39, 60	mpbir2and 929	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
62		elfzelz 9934	. . . . . . 7 ⊢ (𝑛 ∈ (1...(abs‘(𝑀 · 𝑁))) → 𝑛 ∈ ℤ)
63		zdvdsdc 11719	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ) → DECID 𝑀 ∥ 𝑛)
64	29, 62, 63	syl2an 287	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID 𝑀 ∥ 𝑛)
65		zdvdsdc 11719	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑛 ∈ ℤ) → DECID 𝑁 ∥ 𝑛)
66	30, 62, 65	syl2an 287	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID 𝑁 ∥ 𝑛)
67		dcan 919	. . . . . 6 ⊢ (DECID 𝑀 ∥ 𝑛 → (DECID 𝑁 ∥ 𝑛 → DECID (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)))
68	64, 66, 67	sylc 62	. . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))
69	23, 26, 61, 68	infssuzcldc 11850	. . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
70	69	elexd 2725	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) ∈ V)
71		lcmmndc 11954	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID (𝑀 = 0 ∨ 𝑁 = 0))
72	22, 70, 71	ifcldadc 3535	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) ∈ V)
73	2, 18, 19, 20, 72	ovmpod 5950	1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 698  DECID wdc 820   = wceq 1335   ∈ wcel 2128   ≠ wne 2327  {crab 2439  Vcvv 2712  ifcif 3506   class class class wbr 3967  ‘cfv 5172  (class class class)co 5826   ∈ cmpo 5828  infcinf 6929  ℝcr 7733  0cc0 7734  1c1 7735   · cmul 7739   < clt 7914  ℕcn 8838  ℤcz 9172  ℤ_≥cuz 9444  ...cfz 9918  abscabs 10908   ∥ cdvds 11694   lcm clcm 11952

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 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-coll 4081  ax-sep 4084  ax-nul 4092  ax-pow 4137  ax-pr 4171  ax-un 4395  ax-setind 4498  ax-iinf 4549  ax-cnex 7825  ax-resscn 7826  ax-1cn 7827  ax-1re 7828  ax-icn 7829  ax-addcl 7830  ax-addrcl 7831  ax-mulcl 7832  ax-mulrcl 7833  ax-addcom 7834  ax-mulcom 7835  ax-addass 7836  ax-mulass 7837  ax-distr 7838  ax-i2m1 7839  ax-0lt1 7840  ax-1rid 7841  ax-0id 7842  ax-rnegex 7843  ax-precex 7844  ax-cnre 7845  ax-pre-ltirr 7846  ax-pre-ltwlin 7847  ax-pre-lttrn 7848  ax-pre-apti 7849  ax-pre-ltadd 7850  ax-pre-mulgt0 7851  ax-pre-mulext 7852  ax-arch 7853  ax-caucvg 7854

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-nel 2423  df-ral 2440  df-rex 2441  df-reu 2442  df-rmo 2443  df-rab 2444  df-v 2714  df-sbc 2938  df-csb 3032  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3396  df-if 3507  df-pw 3546  df-sn 3567  df-pr 3568  df-op 3570  df-uni 3775  df-int 3810  df-iun 3853  df-br 3968  df-opab 4028  df-mpt 4029  df-tr 4065  df-id 4255  df-po 4258  df-iso 4259  df-iord 4328  df-on 4330  df-ilim 4331  df-suc 4333  df-iom 4552  df-xp 4594  df-rel 4595  df-cnv 4596  df-co 4597  df-dm 4598  df-rn 4599  df-res 4600  df-ima 4601  df-iota 5137  df-fun 5174  df-fn 5175  df-f 5176  df-f1 5177  df-fo 5178  df-f1o 5179  df-fv 5180  df-isom 5181  df-riota 5782  df-ov 5829  df-oprab 5830  df-mpo 5831  df-1st 6090  df-2nd 6091  df-recs 6254  df-frec 6340  df-sup 6930  df-inf 6931  df-pnf 7916  df-mnf 7917  df-xr 7918  df-ltxr 7919  df-le 7920  df-sub 8052  df-neg 8053  df-reap 8454  df-ap 8461  df-div 8550  df-inn 8839  df-2 8897  df-3 8898  df-4 8899  df-n0 9096  df-z 9173  df-uz 9445  df-q 9535  df-rp 9567  df-fz 9919  df-fzo 10051  df-fl 10178  df-mod 10231  df-seqfrec 10354  df-exp 10428  df-cj 10753  df-re 10754  df-im 10755  df-rsqrt 10909  df-abs 10910  df-dvds 11695  df-lcm 11953

This theorem is referenced by:  lcmcom  11956  lcm0val  11957  lcmn0val  11958  lcmass  11977