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 48099

Description: Lemma 2 for lighneallem4 48100. (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 12554	. . 3 ⊢ 2 ∈ ℤ
2	1	a1i 11	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 2 ∈ ℤ)
3		fzfid 13930	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (0...(𝑀 − 1)) ∈ Fin)
4		neg1z 12558	. . . . . . 7 ⊢ -1 ∈ ℤ
5		elfznn0 13569	. . . . . . 7 ⊢ (𝑘 ∈ (0...(𝑀 − 1)) → 𝑘 ∈ ℕ₀)
6		zexpcl 14033	. . . . . . 7 ⊢ ((-1 ∈ ℤ ∧ 𝑘 ∈ ℕ₀) → (-1↑𝑘) ∈ ℤ)
7	4, 5, 6	sylancr 594	. . . . . 6 ⊢ (𝑘 ∈ (0...(𝑀 − 1)) → (-1↑𝑘) ∈ ℤ)
8	7	adantl 483	. . . . 5 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (-1↑𝑘) ∈ ℤ)
9		eluzge2nn0 12837	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℕ₀)
10	9	adantr 482	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → 𝐴 ∈ ℕ₀)
11	10	adantr 482	. . . . . . 7 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → 𝐴 ∈ ℕ₀)
12	5	adantl 483	. . . . . . 7 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → 𝑘 ∈ ℕ₀)
13	11, 12	nn0expcld 14203	. . . . . 6 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (𝐴↑𝑘) ∈ ℕ₀)
14	13	nn0zd 12544	. . . . 5 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → (𝐴↑𝑘) ∈ ℤ)
15	8, 14	zmulcld 12634	. . . 4 ⊢ (((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) ∧ 𝑘 ∈ (0...(𝑀 − 1))) → ((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
16	3, 15	fsumzcl 15692	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
17	16	3adant3 1139	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ)
18		simp1 1143	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝐴 ∈ (ℤ_≥‘2))
19		3z 12555	. . . . 5 ⊢ 3 ∈ ℤ
20	19	a1i 11	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ∈ ℤ)
21		eluzelz 12793	. . . . 5 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℤ)
22	21	3ad2ant2 1141	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
23		eluz2 12789	. . . . . . 7 ⊢ (𝑀 ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 2 ≤ 𝑀))
24		2re 12250	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ
25	24	a1i 11	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 2 ∈ ℝ)
26		zre 12523	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
27	25, 26	leloed 11285	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (2 ≤ 𝑀 ↔ (2 < 𝑀 ∨ 2 = 𝑀)))
28		zltp1le 12572	. . . . . . . . . . . . . . . . 17 ⊢ ((2 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (2 < 𝑀 ↔ (2 + 1) ≤ 𝑀))
29	1, 28	mpan 697	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 ↔ (2 + 1) ≤ 𝑀))
30	29	biimpd 231	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ ℤ → (2 < 𝑀 → (2 + 1) ≤ 𝑀))
31		df-3 12240	. . . . . . . . . . . . . . . 16 ⊢ 3 = (2 + 1)
32	31	breq1i 5081	. . . . . . . . . . . . . . 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 16334	. . . . . . . . . . . . . . 15 ⊢ 2 ∥ 2
37		breq2 5078	. . . . . . . . . . . . . . 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 864	. . . . . . . . . . 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 408	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 2 ≤ 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
45	44	3adant1 1137	. . . . . . 7 ⊢ ((2 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 2 ≤ 𝑀) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
46	23, 45	sylbi 219	. . . . . 6 ⊢ (𝑀 ∈ (ℤ_≥‘2) → (¬ 2 ∥ 𝑀 → 3 ≤ 𝑀))
47	46	imp 408	. . . . 5 ⊢ ((𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ≤ 𝑀)
48	47	3adant1 1137	. . . 4 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 3 ≤ 𝑀)
49		eluz2 12789	. . . 4 ⊢ (𝑀 ∈ (ℤ_≥‘3) ↔ (3 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 3 ≤ 𝑀))
50	20, 22, 48, 49	syl3anbrc 1351	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ (ℤ_≥‘3))
51		eluzelcn 12795	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℂ)
52	51	3ad2ant1 1140	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝐴 ∈ ℂ)
53		eluz2nn 12833	. . . . . . . 8 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℕ)
54	53	3ad2ant2 1141	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℕ)
55		simp3 1145	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ¬ 2 ∥ 𝑀)
56	52, 54, 55	oddpwp1fsum 16356	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴↑𝑀) + 1) = ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))))
57	56	eqcomd 2747	. . . . 5 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1))
58		eluzge2nn0 12837	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘2) → 𝑀 ∈ ℕ₀)
59	58	adantl 483	. . . . . . . . . 10 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → 𝑀 ∈ ℕ₀)
60	10, 59	nn0expcld 14203	. . . . . . . . 9 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (𝐴↑𝑀) ∈ ℕ₀)
61	60	nn0cnd 12495	. . . . . . . 8 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → (𝐴↑𝑀) ∈ ℂ)
62		peano2cn 11314	. . . . . . . 8 ⊢ ((𝐴↑𝑀) ∈ ℂ → ((𝐴↑𝑀) + 1) ∈ ℂ)
63	61, 62	syl 17	. . . . . . 7 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2)) → ((𝐴↑𝑀) + 1) ∈ ℂ)
64	63	3adant3 1139	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴↑𝑀) + 1) ∈ ℂ)
65	17	zcnd 12629	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℂ)
66		eluz2nn 12833	. . . . . . . . . 10 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℕ)
67	66	peano2nnd 12186	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ∈ ℕ)
68	67	nncnd 12185	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ∈ ℂ)
69	67	nnne0d 12222	. . . . . . . 8 ⊢ (𝐴 ∈ (ℤ_≥‘2) → (𝐴 + 1) ≠ 0)
70	68, 69	jca 517	. . . . . . 7 ⊢ (𝐴 ∈ (ℤ_≥‘2) → ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0))
71	70	3ad2ant1 1140	. . . . . 6 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0))
72		divmul 11807	. . . . . 6 ⊢ ((((𝐴↑𝑀) + 1) ∈ ℂ ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℂ ∧ ((𝐴 + 1) ∈ ℂ ∧ (𝐴 + 1) ≠ 0)) → ((((𝐴↑𝑀) + 1) / (𝐴 + 1)) = Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ↔ ((𝐴 + 1) · Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))) = ((𝐴↑𝑀) + 1)))
73	64, 65, 71, 72	syl3anc 1380	. . . . 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 2747	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) = (((𝐴↑𝑀) + 1) / (𝐴 + 1)))
76		lighneallem4a 48098	. . 3 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘3) ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) = (((𝐴↑𝑀) + 1) / (𝐴 + 1))) → 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
77	18, 50, 75, 76	syl3anc 1380	. 2 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)))
78		eluz2 12789	. 2 ⊢ (Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ (ℤ_≥‘2) ↔ (2 ∈ ℤ ∧ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ ℤ ∧ 2 ≤ Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘))))
79	2, 17, 77, 78	syl3anbrc 1351	1 ⊢ ((𝐴 ∈ (ℤ_≥‘2) ∧ 𝑀 ∈ (ℤ_≥‘2) ∧ ¬ 2 ∥ 𝑀) → Σ𝑘 ∈ (0...(𝑀 − 1))((-1↑𝑘) · (𝐴↑𝑘)) ∈ (ℤ_≥‘2))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 397 ∨ wo 854 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 class class class wbr 5074 ‘cfv 6488 (class class class)co 7359 ℂcc 11032 ℝcr 11033 0cc0 11034 1c1 11035 + caddc 11037 · cmul 11039 < clt 11175 ≤ cle 11176 − cmin 11373 -cneg 11374 / cdiv 11803 ℕcn 12169 2c2 12231 3c3 12232 ℕ₀cn0 12432 ℤcz 12519 ℤ_≥cuz 12783 ...cfz 13456 ↑cexp 14018 Σcsu 15643 ∥ cdvds 16216

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-inf2 9557 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-isom 6497 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7933 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-oi 9419 df-card 9858 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-div 11804 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-fz 13457 df-fzo 13604 df-seq 13959 df-exp 14019 df-hash 14288 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193 df-clim 15445 df-sum 15644 df-dvds 16217

This theorem is referenced by: lighneallem4 48100

W3C validator