Theorem lcmval 11744

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 11636 and gcdval 11648. (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 11742	. . 3 ⊢ lcm = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )))
2	1	a1i 9	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → lcm = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ))))
3		eqeq1 2146	. . . . . 6 ⊢ (𝑥 = 𝑀 → (𝑥 = 0 ↔ 𝑀 = 0))
4	3	orbi1d 780	. . . . 5 ⊢ (𝑥 = 𝑀 → ((𝑥 = 0 ∨ 𝑦 = 0) ↔ (𝑀 = 0 ∨ 𝑦 = 0)))
5		breq1 3932	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → (𝑥 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛))
6	5	anbi1d 460	. . . . . . 7 ⊢ (𝑥 = 𝑀 → ((𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛) ↔ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)))
7	6	rabbidv 2675	. . . . . 6 ⊢ (𝑥 = 𝑀 → {𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)})
8	7	infeq1d 6899	. . . . 5 ⊢ (𝑥 = 𝑀 → inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ))
9	4, 8	ifbieq2d 3496	. . . 4 ⊢ (𝑥 = 𝑀 → if((𝑥 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑥 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )))
10		eqeq1 2146	. . . . . 6 ⊢ (𝑦 = 𝑁 → (𝑦 = 0 ↔ 𝑁 = 0))
11	10	orbi2d 779	. . . . 5 ⊢ (𝑦 = 𝑁 → ((𝑀 = 0 ∨ 𝑦 = 0) ↔ (𝑀 = 0 ∨ 𝑁 = 0)))
12		breq1 3932	. . . . . . . 8 ⊢ (𝑦 = 𝑁 → (𝑦 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛))
13	12	anbi2d 459	. . . . . . 7 ⊢ (𝑦 = 𝑁 → ((𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛) ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)))
14	13	rabbidv 2675	. . . . . 6 ⊢ (𝑦 = 𝑁 → {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
15	14	infeq1d 6899	. . . . 5 ⊢ (𝑦 = 𝑁 → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))
16	11, 15	ifbieq2d 3496	. . . 4 ⊢ (𝑦 = 𝑁 → if((𝑀 = 0 ∨ 𝑦 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑦 ∥ 𝑛)}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))
17	9, 16	sylan9eq 2192	. . 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 7760	. . . 4 ⊢ 0 ∈ V
22	21	a1i 9	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑀 = 0 ∨ 𝑁 = 0)) → 0 ∈ V)
23		1zzd 9081	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 1 ∈ ℤ)
24		nnuz 9361	. . . . . 6 ⊢ ℕ = (ℤ≥‘1)
25		rabeq 2678	. . . . . 6 ⊢ (ℕ = (ℤ≥‘1) → {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ (ℤ≥‘1) ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
26	24, 25	ax-mp 5	. . . . 5 ⊢ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ (ℤ≥‘1) ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}
27		dvdsmul1 11515	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∥ (𝑀 · 𝑁))
28	27	adantr 274	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (𝑀 · 𝑁))
29		simpll 518	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∈ ℤ)
30		simplr 519	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∈ ℤ)
31	29, 30	zmulcld 9179	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 · 𝑁) ∈ ℤ)
32		dvdsabsb 11512	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (𝑀 ∥ (𝑀 · 𝑁) ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
33	29, 31, 32	syl2anc 408	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑀 ∥ (𝑀 · 𝑁) ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
34	28, 33	mpbid 146	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∥ (abs‘(𝑀 · 𝑁)))
35		dvdsmul2 11516	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∥ (𝑀 · 𝑁))
36	35	adantr 274	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (𝑀 · 𝑁))
37		dvdsabsb 11512	. . . . . . . 8 ⊢ ((𝑁 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (𝑁 ∥ (𝑀 · 𝑁) ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
38	30, 31, 37	syl2anc 408	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (𝑁 ∥ (𝑀 · 𝑁) ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
39	36, 38	mpbid 146	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∥ (abs‘(𝑀 · 𝑁)))
40	29	zcnd 9174	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ∈ ℂ)
41	30	zcnd 9174	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ∈ ℂ)
42	40, 41	absmuld 10966	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) = ((abs‘𝑀) · (abs‘𝑁)))
43		simpr 109	. . . . . . . . . . . . 13 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ¬ (𝑀 = 0 ∨ 𝑁 = 0))
44		ioran 741	. . . . . . . . . . . . 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 2315	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑀 ≠ 0)
48		nnabscl 10872	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0) → (abs‘𝑀) ∈ ℕ)
49	29, 47, 48	syl2anc 408	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘𝑀) ∈ ℕ)
50	45	simprd 113	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ¬ 𝑁 = 0)
51	50	neqned 2315	. . . . . . . . . 10 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → 𝑁 ≠ 0)
52		nnabscl 10872	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (abs‘𝑁) ∈ ℕ)
53	30, 51, 52	syl2anc 408	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘𝑁) ∈ ℕ)
54	49, 53	nnmulcld 8769	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ((abs‘𝑀) · (abs‘𝑁)) ∈ ℕ)
55	42, 54	eqeltrd 2216	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) ∈ ℕ)
56		breq2 3933	. . . . . . . . 9 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → (𝑀 ∥ 𝑛 ↔ 𝑀 ∥ (abs‘(𝑀 · 𝑁))))
57		breq2 3933	. . . . . . . . 9 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → (𝑁 ∥ 𝑛 ↔ 𝑁 ∥ (abs‘(𝑀 · 𝑁))))
58	56, 57	anbi12d 464	. . . . . . . 8 ⊢ (𝑛 = (abs‘(𝑀 · 𝑁)) → ((𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛) ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
59	58	elrab3 2841	. . . . . . 7 ⊢ ((abs‘(𝑀 · 𝑁)) ∈ ℕ → ((abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
60	55, 59	syl 14	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → ((abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} ↔ (𝑀 ∥ (abs‘(𝑀 · 𝑁)) ∧ 𝑁 ∥ (abs‘(𝑀 · 𝑁)))))
61	34, 39, 60	mpbir2and 928	. . . . 5 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → (abs‘(𝑀 · 𝑁)) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
62		elfzelz 9806	. . . . . . 7 ⊢ (𝑛 ∈ (1...(abs‘(𝑀 · 𝑁))) → 𝑛 ∈ ℤ)
63		zdvdsdc 11514	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ) → DECID 𝑀 ∥ 𝑛)
64	29, 62, 63	syl2an 287	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID 𝑀 ∥ 𝑛)
65		zdvdsdc 11514	. . . . . . 7 ⊢ ((𝑁 ∈ ℤ ∧ 𝑛 ∈ ℤ) → DECID 𝑁 ∥ 𝑛)
66	30, 62, 65	syl2an 287	. . . . . 6 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID 𝑁 ∥ 𝑛)
67		dcan 918	. . . . . 6 ⊢ (DECID 𝑀 ∥ 𝑛 → (DECID 𝑁 ∥ 𝑛 → DECID (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)))
68	64, 66, 67	sylc 62	. . . . 5 ⊢ ((((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) ∧ 𝑛 ∈ (1...(abs‘(𝑀 · 𝑁)))) → DECID (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))
69	23, 26, 61, 68	infssuzcldc 11644	. . . 4 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) ∈ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)})
70	69	elexd 2699	. . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝑀 = 0 ∨ 𝑁 = 0)) → inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) ∈ V)
71		lcmmndc 11743	. . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID (𝑀 = 0 ∨ 𝑁 = 0))
72	22, 70, 71	ifcldadc 3501	. 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) ∈ V)
73	2, 18, 19, 20, 72	ovmpod 5898	1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 697  DECID wdc 819   = wceq 1331   ∈ wcel 1480   ≠ wne 2308  {crab 2420  Vcvv 2686  ifcif 3474   class class class wbr 3929  ‘cfv 5123  (class class class)co 5774   ∈ cmpo 5776  infcinf 6870  ℝcr 7619  0cc0 7620  1c1 7621   · cmul 7625   < clt 7800  ℕcn 8720  ℤcz 9054  ℤ_≥cuz 9326  ...cfz 9790  abscabs 10769   ∥ cdvds 11493   lcm clcm 11741

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-mulrcl 7719  ax-addcom 7720  ax-mulcom 7721  ax-addass 7722  ax-mulass 7723  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-1rid 7727  ax-0id 7728  ax-rnegex 7729  ax-precex 7730  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-apti 7735  ax-pre-ltadd 7736  ax-pre-mulgt0 7737  ax-pre-mulext 7738  ax-arch 7739  ax-caucvg 7740

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rmo 2424  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-po 4218  df-iso 4219  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-isom 5132  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-sup 6871  df-inf 6872  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-reap 8337  df-ap 8344  df-div 8433  df-inn 8721  df-2 8779  df-3 8780  df-4 8781  df-n0 8978  df-z 9055  df-uz 9327  df-q 9412  df-rp 9442  df-fz 9791  df-fzo 9920  df-fl 10043  df-mod 10096  df-seqfrec 10219  df-exp 10293  df-cj 10614  df-re 10615  df-im 10616  df-rsqrt 10770  df-abs 10771  df-dvds 11494  df-lcm 11742

This theorem is referenced by:  lcmcom  11745  lcm0val  11746  lcmn0val  11747  lcmass  11766