lighneallem4b - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lighneallem4b		Structured version Visualization version GIF version

Theorem lighneallem4b 48499

Description: Lemma 2 for lighneallem4 48500. (Contributed by AV, 16-Aug-2021.)

**Assertion**
Ref	Expression
lighneallem4b	⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ (ℤ_≥‘2))

Distinct variable groups: 𝐴,𝑘 𝑘,𝑀

**Proof of Theorem lighneallem4b**
Step	Hyp	Ref	Expression
1		2z 12653	. . 3 ⊢ 2 ∈ ℤ
2	1	a1i 11	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 2 ∈ ℤ)
3		fzfid 14039	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (0...(𝑀 − 1)) ∈ Fin)
4		neg1z 12657	. . . . . . 7 ⊢ -1 ∈ ℤ
5		elfznn0 13677	. . . . . . 7 ⊢ (𝑘 ∈ (0...(𝑀 − 1)) → 𝑘 ∈ ℕ₀)
6		zexpcl 14142	. . . . . . 7 ⊢ ((-1 ∈ ℤ ∧ 𝑘 ∈ ℕ₀) → (-1↑𝑘) ∈ ℤ)
7	4, 5, 6	sylancr 599	. . . . . 6 ⊢ (𝑘 ∈ (0...(𝑀 − 1)) → (-1↑𝑘) ∈ ℤ)
8	7	adantl 487	. . . . 5 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (-1↑𝑘) ∈ ℤ)
9		eluzge2nn0 12944	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℕ₀)
10	9	adantr 486	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → 𝐴 ∈ ℕ₀)
11	10	adantr 486	. . . . . . 7 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → 𝐴 ∈ ℕ₀)
12	5	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → 𝑘 ∈ ℕ₀)
13	11, 12	nn0expcld 14312	. . . . . 6 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (𝐴↑𝑘) ∈ ℕ₀)
14	13	nn0zd 12643	. . . . 5 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (𝐴↑𝑘) ∈ ℤ)
15	8, 14	zmulcld 12734	. . . 4 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → ((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
16	3, 15	fsumzcl 15823	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
17	16	3adant3 1150	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
18		simp1 1154	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝐴 ∈ (ℤ_≥‘2))
19		3z 12654	. . . . 5 ⊢ 3 ∈ ℤ
20	19	a1i 11	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ∈ ℤ)
21		eluzelz 12900	. . . . 5 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℤ)
22	21	3ad2ant2 1152	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
23		eluz2 12896	. . . . . . 7 ⊢ (𝑀 ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 2 ≤ 𝑀))
24		2re 12342	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ
25	24	a1i 11	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 2 ∈ ℝ)
26		zre 12622	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
27	25, 26	leloed 11380	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (2 ≤ 𝑀 ↔ (2 < 𝑀 ∨ 2 = 𝑀)))
28		zltp1le 12671	. . . . . . . . . . . . . . . . 17 ⊢ ((2 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (2 < 𝑀 ↔ (2 + 1) ≤ 𝑀))
29	1, 28	mpan 703	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 ↔ (2 + 1) ≤ 𝑀))
30	29	biimpd 232	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 → (2 + 1) ≤ 𝑀))
31		df-3 12331	. . . . . . . . . . . . . . . 16 ⊢ 3 = (2 + 1)
32	31	breq1i 5114	. . . . . . . . . . . . . . 15 ⊢ (3 ≤ 𝑀 ↔ (2 + 1) ≤ 𝑀)
33	30, 32	imbitrrdi 255	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 → 3 ≤ 𝑀))
34	33	a1i 11	. . . . . . . . . . . . 13 ⊢ (¬ 2 ∥ 𝑀 → (𝑀 ∈ ℤ → (2 < 𝑀 → 3 ≤ 𝑀)))
35	34	com13 89	. . . . . . . . . . . 12 ⊢ (2 < 𝑀 → (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
36		z2even 16464	. . . . . . . . . . . . . . 15 ⊢ 2 ∥ 2
37		breq2 5111	. . . . . . . . . . . . . . 15 ⊢ (2 = 𝑀 → (2 ∥ 2 ↔ 2 ∥ 𝑀))
38	36, 37	mpbii 236	. . . . . . . . . . . . . 14 ⊢ (2 = 𝑀 → 2 ∥ 𝑀)
39	38	pm2.24d 152	. . . . . . . . . . . . 13 ⊢ (2 = 𝑀 → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
40	39	a1d 26	. . . . . . . . . . . 12 ⊢ (2 = 𝑀 → (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
41	35, 40	jaoi 871	. . . . . . . . . . 11 ⊢ ((2 < 𝑀 ∨ 2 = 𝑀) → (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
42	41	com12 33	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → ((2 < 𝑀 ∨ 2 = 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
43	27, 42	sylbid 243	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (2 ≤ 𝑀 → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
44	43	imp 412	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 2 ≤ 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
45	44	3adant1 1148	. . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 2 ≤ 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
46	23, 45	sylbi 220	. . . . . 6 ⊢ (𝑀 ∈ (ℤ_≥‘2) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
47	46	imp 412	. . . . 5 ⊢ ((𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ≤ 𝑀)
48	47	3adant1 1148	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ≤ 𝑀)
49		eluz2 12896	. . . 4 ⊢ (𝑀 ∈ (ℤ_≥‘3) ↔ (3 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 3 ≤ 𝑀))
50	20, 22, 48, 49	syl3anbrc 1362	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ (ℤ_≥‘3))
51		eluzelcn 12902	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℂ)
52	51	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝐴 ∈ ℂ)
53		eluz2nn 12940	. . . . . . . 8 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℕ)
54	53	3ad2ant2 1152	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℕ)
55		simp3 1156	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ¬ 2 ∥ 𝑀)
56	52, 54, 55	oddpwp1fsum 16486	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴↑𝑀) + 1) = ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))))
57	56	eqcomd 2768	. . . . 5 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1))
58		eluzge2nn0 12944	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℕ₀)
59	58	adantl 487	. . . . . . . . . 10 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → 𝑀 ∈ ℕ₀)
60	10, 59	nn0expcld 14312	. . . . . . . . 9 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (𝐴↑𝑀) ∈ ℕ₀)
61	60	nn0cnd 12594	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (𝐴↑𝑀) ∈ ℂ)
62		peano2cn 11409	. . . . . . . 8 ⊢ ((𝐴↑𝑀) ∈ ℂ → ((𝐴↑𝑀) + 1) ∈ ℂ)
63	61, 62	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → ((𝐴↑𝑀) + 1) ∈ ℂ)
64	63	3adant3 1150	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴↑𝑀) + 1) ∈ ℂ)
65	17	zcnd 12729	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℂ)
66		eluz2nn 12940	. . . . . . . . . 10 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℕ)
67	66	peano2nnd 12277	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ∈ ℕ)
68	67	nncnd 12276	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ∈ ℂ)
69	67	nnne0d 12313	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ≠ 0)
70	68, 69	jca 521	. . . . . . 7 ⊢ (𝐴 ∈ (ℤ_≥‘2) → ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0))
71	70	3ad2ant1 1151	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0))
72		divmul 11902	. . . . . 6 ⊢ ((((𝐴↑𝑀) + 1) ∈ ℂ ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℂ ∧ ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0)) → ((((𝐴↑𝑀) + 1) / (𝐴 + 1)) = Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ↔ ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1)))
73	64, 65, 71, 72	syl3anc 1398	. . . . 5 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((((𝐴↑𝑀) + 1) / (𝐴 + 1)) = Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ↔ ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1)))
74	57, 73	mpbird 260	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → (((𝐴↑𝑀) + 1) / (𝐴 + 1)) = Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
75	74	eqcomd 2768	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) = (((𝐴↑𝑀) + 1) / (𝐴 + 1)))
76		lighneallem4a 48498	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘3) ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) = (((𝐴↑𝑀) + 1) / (𝐴 + 1))) → 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
77	18, 50, 75, 76	syl3anc 1398	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
78		eluz2 12896	. 2 ⊢ (Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ ∧ 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))))
79	2, 17, 77, 78	syl3anbrc 1362	1 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ (ℤ_≥‘2))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 class class class wbr 5107 ‘cfv 6537 (class class class)co 7416 ℂcc 11125 ℝcr 11126 0cc0 11127 1c1 11128 + caddc 11130 · cmul 11132 < clt 11270 ≤ cle 11271 − cmin 11468 -cneg 11469 / cdiv 11898 ℕcn 12260 2c2 12322 3c3 12323 ℕ₀cn0 12531 ℤcz 12618 ℤ_≥cuz 12890 ...cfz 13563 ↑cexp 14127 Σcsu 15775 ∥ cdvds 16346

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-inf2 9623 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-sup 9415 df-oi 9485 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13045 df-fz 13564 df-fzo 13712 df-seq 14068 df-exp 14128 df-hash 14397 df-cj 15188 df-re 15189 df-im 15190 df-sqrt 15324 df-abs 15325 df-clim 15577 df-sum 15776 df-dvds 16347

This theorem is used by: lighneallem4 48500

W3C validator