Theorem plyco0 26165

Description: Two ways to say that a function on the nonnegative integers has finite support. (Contributed by Mario Carneiro, 22-Jul-2014.)

Assertion

Ref	Expression
plyco0	⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)))

Distinct variable groups:   𝐴,𝑘   𝑘,𝑁

Proof of Theorem plyco0

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprr 773	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝐴‘𝑘) ≠ 0)
2		ffun 6673	. . . . . . . . . . . 12 ⊢ (𝐴:ℕ0⟶ℂ → Fun 𝐴)
3	2	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → Fun 𝐴)
4		peano2nn0 12453	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
5	4	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝑁 + 1) ∈ ℕ0)
6		eluznn0 12842	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 + 1) ∈ ℕ0 ∧ 𝑘 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑘 ∈ ℕ0)
7	6	ex 412	. . . . . . . . . . . . . 14 ⊢ ((𝑁 + 1) ∈ ℕ0 → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → 𝑘 ∈ ℕ0))
8	5, 7	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → 𝑘 ∈ ℕ0))
9	8	ssrdv 3941	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (ℤ≥‘(𝑁 + 1)) ⊆ ℕ0)
10		fdm 6679	. . . . . . . . . . . . 13 ⊢ (𝐴:ℕ0⟶ℂ → dom 𝐴 = ℕ0)
11	10	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → dom 𝐴 = ℕ0)
12	9, 11	sseqtrrd 3973	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (ℤ≥‘(𝑁 + 1)) ⊆ dom 𝐴)
13		funfvima2 7187	. . . . . . . . . . 11 ⊢ ((Fun 𝐴 ∧ (ℤ≥‘(𝑁 + 1)) ⊆ dom 𝐴) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1)))))
14	3, 12, 13	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1)))))
15	14	ad2antrr 727	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) → (𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1)))))
16		nn0z 12524	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ)
17	16	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → 𝑁 ∈ ℤ)
18	17	peano2zd 12611	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝑁 + 1) ∈ ℤ)
19	18	ad2antrr 727	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝑁 + 1) ∈ ℤ)
20		nn0z 12524	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ)
21	20	ad2antrl 729	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → 𝑘 ∈ ℤ)
22		eluz 12777	. . . . . . . . . 10 ⊢ (((𝑁 + 1) ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) ↔ (𝑁 + 1) ≤ 𝑘))
23	19, 21, 22	syl2anc 585	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝑘 ∈ (ℤ≥‘(𝑁 + 1)) ↔ (𝑁 + 1) ≤ 𝑘))
24		simplr 769	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0})
25	24	eleq2d 2823	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → ((𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1))) ↔ (𝐴‘𝑘) ∈ {0}))
26		fvex 6855	. . . . . . . . . . 11 ⊢ (𝐴‘𝑘) ∈ V
27	26	elsn 4597	. . . . . . . . . 10 ⊢ ((𝐴‘𝑘) ∈ {0} ↔ (𝐴‘𝑘) = 0)
28	25, 27	bitrdi 287	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → ((𝐴‘𝑘) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1))) ↔ (𝐴‘𝑘) = 0))
29	15, 23, 28	3imtr3d 293	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → ((𝑁 + 1) ≤ 𝑘 → (𝐴‘𝑘) = 0))
30	29	necon3ad 2946	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → ((𝐴‘𝑘) ≠ 0 → ¬ (𝑁 + 1) ≤ 𝑘))
31	1, 30	mpd 15	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → ¬ (𝑁 + 1) ≤ 𝑘)
32		nn0re 12422	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℝ)
33	32	ad2antrl 729	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → 𝑘 ∈ ℝ)
34	18	zred 12608	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝑁 + 1) ∈ ℝ)
35	34	ad2antrr 727	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝑁 + 1) ∈ ℝ)
36	33, 35	ltnled 11292	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝑘 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑘))
37	31, 36	mpbird 257	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → 𝑘 < (𝑁 + 1))
38	17	ad2antrr 727	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → 𝑁 ∈ ℤ)
39		zleltp1 12554	. . . . . 6 ⊢ ((𝑘 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑘 ≤ 𝑁 ↔ 𝑘 < (𝑁 + 1)))
40	21, 38, 39	syl2anc 585	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → (𝑘 ≤ 𝑁 ↔ 𝑘 < (𝑁 + 1)))
41	37, 40	mpbird 257	. . . 4 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ (𝑘 ∈ ℕ0 ∧ (𝐴‘𝑘) ≠ 0)) → 𝑘 ≤ 𝑁)
42	41	expr 456	. . 3 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))
43	42	ralrimiva 3130	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) → ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))
44		simpr 484	. . . . . . . 8 ⊢ ((∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))
45		eluznn0 12842	. . . . . . . 8 ⊢ (((𝑁 + 1) ∈ ℕ0 ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1))) → 𝑛 ∈ ℕ0)
46	5, 44, 45	syl2an 597	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → 𝑛 ∈ ℕ0)
47		nn0re 12422	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ)
48	47	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → 𝑁 ∈ ℝ)
49	48	adantr 480	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → 𝑁 ∈ ℝ)
50	34	adantr 480	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → (𝑁 + 1) ∈ ℝ)
51	46	nn0red 12475	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → 𝑛 ∈ ℝ)
52	49	ltp1d 12084	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → 𝑁 < (𝑁 + 1))
53		eluzle 12776	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘(𝑁 + 1)) → (𝑁 + 1) ≤ 𝑛)
54	53	ad2antll 730	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → (𝑁 + 1) ≤ 𝑛)
55	49, 50, 51, 52, 54	ltletrd 11305	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → 𝑁 < 𝑛)
56	49, 51	ltnled 11292	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → (𝑁 < 𝑛 ↔ ¬ 𝑛 ≤ 𝑁))
57	55, 56	mpbid 232	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → ¬ 𝑛 ≤ 𝑁)
58		fveq2 6842	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑛 → (𝐴‘𝑘) = (𝐴‘𝑛))
59	58	neeq1d 2992	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑛 → ((𝐴‘𝑘) ≠ 0 ↔ (𝐴‘𝑛) ≠ 0))
60		breq1 5103	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑛 → (𝑘 ≤ 𝑁 ↔ 𝑛 ≤ 𝑁))
61	59, 60	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑘 = 𝑛 → (((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ↔ ((𝐴‘𝑛) ≠ 0 → 𝑛 ≤ 𝑁)))
62		simprl 771	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))
63	61, 62, 46	rspcdva 3579	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → ((𝐴‘𝑛) ≠ 0 → 𝑛 ≤ 𝑁))
64	63	necon1bd 2951	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → (¬ 𝑛 ≤ 𝑁 → (𝐴‘𝑛) = 0))
65	57, 64	mpd 15	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → (𝐴‘𝑛) = 0)
66		ffn 6670	. . . . . . . . 9 ⊢ (𝐴:ℕ0⟶ℂ → 𝐴 Fn ℕ0)
67	66	ad2antlr 728	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → 𝐴 Fn ℕ0)
68		fniniseg 7014	. . . . . . . 8 ⊢ (𝐴 Fn ℕ0 → (𝑛 ∈ (◡𝐴 “ {0}) ↔ (𝑛 ∈ ℕ0 ∧ (𝐴‘𝑛) = 0)))
69	67, 68	syl 17	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → (𝑛 ∈ (◡𝐴 “ {0}) ↔ (𝑛 ∈ ℕ0 ∧ (𝐴‘𝑛) = 0)))
70	46, 65, 69	mpbir2and 714	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ (∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ∧ 𝑛 ∈ (ℤ≥‘(𝑁 + 1)))) → 𝑛 ∈ (◡𝐴 “ {0}))
71	70	expr 456	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → (𝑛 ∈ (ℤ≥‘(𝑁 + 1)) → 𝑛 ∈ (◡𝐴 “ {0})))
72	71	ssrdv 3941	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → (ℤ≥‘(𝑁 + 1)) ⊆ (◡𝐴 “ {0}))
73		funimass3 7008	. . . . . 6 ⊢ ((Fun 𝐴 ∧ (ℤ≥‘(𝑁 + 1)) ⊆ dom 𝐴) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) ⊆ {0} ↔ (ℤ≥‘(𝑁 + 1)) ⊆ (◡𝐴 “ {0})))
74	3, 12, 73	syl2anc 585	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) ⊆ {0} ↔ (ℤ≥‘(𝑁 + 1)) ⊆ (◡𝐴 “ {0})))
75	74	adantr 480	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) ⊆ {0} ↔ (ℤ≥‘(𝑁 + 1)) ⊆ (◡𝐴 “ {0})))
76	72, 75	mpbird 257	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → (𝐴 “ (ℤ≥‘(𝑁 + 1))) ⊆ {0})
77	48	ltp1d 12084	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → 𝑁 < (𝑁 + 1))
78	48, 34	ltnled 11292	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁))
79	77, 78	mpbid 232	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → ¬ (𝑁 + 1) ≤ 𝑁)
80	79	adantr 480	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → ¬ (𝑁 + 1) ≤ 𝑁)
81		fveq2 6842	. . . . . . . . . . 11 ⊢ (𝑘 = (𝑁 + 1) → (𝐴‘𝑘) = (𝐴‘(𝑁 + 1)))
82	81	neeq1d 2992	. . . . . . . . . 10 ⊢ (𝑘 = (𝑁 + 1) → ((𝐴‘𝑘) ≠ 0 ↔ (𝐴‘(𝑁 + 1)) ≠ 0))
83		breq1 5103	. . . . . . . . . 10 ⊢ (𝑘 = (𝑁 + 1) → (𝑘 ≤ 𝑁 ↔ (𝑁 + 1) ≤ 𝑁))
84	82, 83	imbi12d 344	. . . . . . . . 9 ⊢ (𝑘 = (𝑁 + 1) → (((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁) ↔ ((𝐴‘(𝑁 + 1)) ≠ 0 → (𝑁 + 1) ≤ 𝑁)))
85	84	rspcva 3576	. . . . . . . 8 ⊢ (((𝑁 + 1) ∈ ℕ0 ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → ((𝐴‘(𝑁 + 1)) ≠ 0 → (𝑁 + 1) ≤ 𝑁))
86	5, 85	sylan 581	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → ((𝐴‘(𝑁 + 1)) ≠ 0 → (𝑁 + 1) ≤ 𝑁))
87	86	necon1bd 2951	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → (¬ (𝑁 + 1) ≤ 𝑁 → (𝐴‘(𝑁 + 1)) = 0))
88	80, 87	mpd 15	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → (𝐴‘(𝑁 + 1)) = 0)
89		uzid 12778	. . . . . . . 8 ⊢ ((𝑁 + 1) ∈ ℤ → (𝑁 + 1) ∈ (ℤ≥‘(𝑁 + 1)))
90	18, 89	syl 17	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝑁 + 1) ∈ (ℤ≥‘(𝑁 + 1)))
91		funfvima2 7187	. . . . . . . 8 ⊢ ((Fun 𝐴 ∧ (ℤ≥‘(𝑁 + 1)) ⊆ dom 𝐴) → ((𝑁 + 1) ∈ (ℤ≥‘(𝑁 + 1)) → (𝐴‘(𝑁 + 1)) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1)))))
92	3, 12, 91	syl2anc 585	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → ((𝑁 + 1) ∈ (ℤ≥‘(𝑁 + 1)) → (𝐴‘(𝑁 + 1)) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1)))))
93	90, 92	mpd 15	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → (𝐴‘(𝑁 + 1)) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1))))
94	93	adantr 480	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → (𝐴‘(𝑁 + 1)) ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1))))
95	88, 94	eqeltrrd 2838	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → 0 ∈ (𝐴 “ (ℤ≥‘(𝑁 + 1))))
96	95	snssd 4767	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → {0} ⊆ (𝐴 “ (ℤ≥‘(𝑁 + 1))))
97	76, 96	eqssd 3953	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) ∧ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) → (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0})
98	43, 97	impbida 801	1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052   ⊆ wss 3903  {csn 4582   class class class wbr 5100  ^◡ccnv 5631  dom cdm 5632   “ cima 5635  Fun wfun 6494   Fn wfn 6495  ⟶wf 6496  ‘cfv 6500  (class class class)co 7368  ℂcc 11036  ℝcr 11037  0cc0 11038  1c1 11039   + caddc 11041   < clt 11178   ≤ cle 11179  ℕ₀cn0 12413  ℤcz 12500  ℤ_≥cuz 12763

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-n0 12414  df-z 12501  df-uz 12764

This theorem is referenced by:  elply2  26169  plyeq0lem  26183  coeeulem  26197  dgrlem  26202  dgrub2  26208  dgrlb  26209  coeeq2  26215  dgrle  26216  coeaddlem  26222  coemullem  26223  coe1termlem  26231  dgreq0  26239  coecj  26252  coecjOLD  26254  basellem2  27060