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 48223

Description: Lemma 2 for lighneallem4 48224. (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 12605	. . 3 ⊢ 2 ∈ ℤ
2	1	a1i 11	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 2 ∈ ℤ)
3		fzfid 13988	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (0...(𝑀 − 1)) ∈ Fin)
4		neg1z 12609	. . . . . . 7 ⊢ -1 ∈ ℤ
5		elfznn0 13627	. . . . . . 7 ⊢ (𝑘 ∈ (0...(𝑀 − 1)) → 𝑘 ∈ ℕ₀)
6		zexpcl 14091	. . . . . . 7 ⊢ ((-1 ∈ ℤ ∧ 𝑘 ∈ ℕ₀) → (-1↑𝑘) ∈ ℤ)
7	4, 5, 6	sylancr 596	. . . . . 6 ⊢ (𝑘 ∈ (0...(𝑀 − 1)) → (-1↑𝑘) ∈ ℤ)
8	7	adantl 485	. . . . 5 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (-1↑𝑘) ∈ ℤ)
9		eluzge2nn0 12895	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℕ₀)
10	9	adantr 484	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → 𝐴 ∈ ℕ₀)
11	10	adantr 484	. . . . . . 7 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → 𝐴 ∈ ℕ₀)
12	5	adantl 485	. . . . . . 7 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → 𝑘 ∈ ℕ₀)
13	11, 12	nn0expcld 14261	. . . . . 6 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (𝐴↑𝑘) ∈ ℕ₀)
14	13	nn0zd 12595	. . . . 5 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (𝐴↑𝑘) ∈ ℤ)
15	8, 14	zmulcld 12685	. . . 4 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → ((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
16	3, 15	fsumzcl 15764	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
17	16	3adant3 1146	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
18		simp1 1150	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝐴 ∈ (ℤ_≥‘2))
19		3z 12606	. . . . 5 ⊢ 3 ∈ ℤ
20	19	a1i 11	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ∈ ℤ)
21		eluzelz 12851	. . . . 5 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℤ)
22	21	3ad2ant2 1148	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
23		eluz2 12847	. . . . . . 7 ⊢ (𝑀 ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 2 ≤ 𝑀))
24		2re 12294	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ
25	24	a1i 11	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 2 ∈ ℝ)
26		zre 12574	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
27	25, 26	leloed 11328	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (2 ≤ 𝑀 ↔ (2 < 𝑀 ∨ 2 = 𝑀)))
28		zltp1le 12623	. . . . . . . . . . . . . . . . 17 ⊢ ((2 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (2 < 𝑀 ↔ (2 + 1) ≤ 𝑀))
29	1, 28	mpan 700	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 ↔ (2 + 1) ≤ 𝑀))
30	29	biimpd 231	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 → (2 + 1) ≤ 𝑀))
31		df-3 12283	. . . . . . . . . . . . . . . 16 ⊢ 3 = (2 + 1)
32	31	breq1i 5109	. . . . . . . . . . . . . . 15 ⊢ (3 ≤ 𝑀 ↔ (2 + 1) ≤ 𝑀)
33	30, 32	imbitrrdi 254	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 → 3 ≤ 𝑀))
34	33	a1i 11	. . . . . . . . . . . . 13 ⊢ (¬ 2 ∥ 𝑀 → (𝑀 ∈ ℤ → (2 < 𝑀 → 3 ≤ 𝑀)))
35	34	com13 88	. . . . . . . . . . . 12 ⊢ (2 < 𝑀 → (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
36		z2even 16406	. . . . . . . . . . . . . . 15 ⊢ 2 ∥ 2
37		breq2 5106	. . . . . . . . . . . . . . 15 ⊢ (2 = 𝑀 → (2 ∥ 2 ↔ 2 ∥ 𝑀))
38	36, 37	mpbii 235	. . . . . . . . . . . . . 14 ⊢ (2 = 𝑀 → 2 ∥ 𝑀)
39	38	pm2.24d 151	. . . . . . . . . . . . 13 ⊢ (2 = 𝑀 → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
40	39	a1d 25	. . . . . . . . . . . 12 ⊢ (2 = 𝑀 → (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
41	35, 40	jaoi 868	. . . . . . . . . . 11 ⊢ ((2 < 𝑀 ∨ 2 = 𝑀) → (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
42	41	com12 32	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → ((2 < 𝑀 ∨ 2 = 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
43	27, 42	sylbid 242	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (2 ≤ 𝑀 → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀)))
44	43	imp 410	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 2 ≤ 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
45	44	3adant1 1144	. . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 2 ≤ 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
46	23, 45	sylbi 219	. . . . . 6 ⊢ (𝑀 ∈ (ℤ_≥‘2) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
47	46	imp 410	. . . . 5 ⊢ ((𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ≤ 𝑀)
48	47	3adant1 1144	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ≤ 𝑀)
49		eluz2 12847	. . . 4 ⊢ (𝑀 ∈ (ℤ_≥‘3) ↔ (3 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 3 ≤ 𝑀))
50	20, 22, 48, 49	syl3anbrc 1358	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ (ℤ_≥‘3))
51		eluzelcn 12853	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℂ)
52	51	3ad2ant1 1147	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝐴 ∈ ℂ)
53		eluz2nn 12891	. . . . . . . 8 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℕ)
54	53	3ad2ant2 1148	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℕ)
55		simp3 1152	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ¬ 2 ∥ 𝑀)
56	52, 54, 55	oddpwp1fsum 16428	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴↑𝑀) + 1) = ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))))
57	56	eqcomd 2770	. . . . 5 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1))
58		eluzge2nn0 12895	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℕ₀)
59	58	adantl 485	. . . . . . . . . 10 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → 𝑀 ∈ ℕ₀)
60	10, 59	nn0expcld 14261	. . . . . . . . 9 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (𝐴↑𝑀) ∈ ℕ₀)
61	60	nn0cnd 12546	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (𝐴↑𝑀) ∈ ℂ)
62		peano2cn 11357	. . . . . . . 8 ⊢ ((𝐴↑𝑀) ∈ ℂ → ((𝐴↑𝑀) + 1) ∈ ℂ)
63	61, 62	syl 17	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → ((𝐴↑𝑀) + 1) ∈ ℂ)
64	63	3adant3 1146	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴↑𝑀) + 1) ∈ ℂ)
65	17	zcnd 12680	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℂ)
66		eluz2nn 12891	. . . . . . . . . 10 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℕ)
67	66	peano2nnd 12229	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ∈ ℕ)
68	67	nncnd 12228	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ∈ ℂ)
69	67	nnne0d 12265	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ≠ 0)
70	68, 69	jca 519	. . . . . . 7 ⊢ (𝐴 ∈ (ℤ_≥‘2) → ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0))
71	70	3ad2ant1 1147	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0))
72		divmul 11850	. . . . . 6 ⊢ ((((𝐴↑𝑀) + 1) ∈ ℂ ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℂ ∧ ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0)) → ((((𝐴↑𝑀) + 1) / (𝐴 + 1)) = Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ↔ ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1)))
73	64, 65, 71, 72	syl3anc 1392	. . . . 5 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((((𝐴↑𝑀) + 1) / (𝐴 + 1)) = Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ↔ ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1)))
74	57, 73	mpbird 259	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → (((𝐴↑𝑀) + 1) / (𝐴 + 1)) = Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
75	74	eqcomd 2770	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) = (((𝐴↑𝑀) + 1) / (𝐴 + 1)))
76		lighneallem4a 48222	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘3) ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) = (((𝐴↑𝑀) + 1) / (𝐴 + 1))) → 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
77	18, 50, 75, 76	syl3anc 1392	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
78		eluz2 12847	. 2 ⊢ (Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ ∧ 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))))
79	2, 17, 77, 78	syl3anbrc 1358	1 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ (ℤ_≥‘2))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ≠ wne 2959 class class class wbr 5102 ‘cfv 6523 (class class class)co 7398 ℂcc 11073 ℝcr 11074 0cc0 11075 1c1 11076 + caddc 11078 · cmul 11080 < clt 11218 ≤ cle 11219 − cmin 11416 -cneg 11417 / cdiv 11846 ℕcn 12212 2c2 12274 3c3 12275 ℕ₀cn0 12483 ℤcz 12570 ℤ_≥cuz 12841 ...cfz 13514 ↑cexp 14076 Σcsu 15715 ∥ cdvds 16288

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-inf2 9598 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-se 5603 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-isom 6532 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1st 7972 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-1o 8439 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-fin 8933 df-sup 9390 df-oi 9460 df-card 9899 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-div 11847 df-nn 12213 df-2 12282 df-3 12283 df-4 12284 df-n0 12484 df-z 12571 df-uz 12842 df-rp 12996 df-fz 13515 df-fzo 13662 df-seq 14017 df-exp 14077 df-hash 14346 df-cj 15128 df-re 15129 df-im 15130 df-sqrt 15264 df-abs 15265 df-clim 15517 df-sum 15716 df-dvds 16289

This theorem is referenced by: lighneallem4 48224

W3C validator