Theorem suppssfz 13935

Description: Condition for a function over the nonnegative integers to have a support contained in a finite set of sequential integers. (Contributed by AV, 9-Oct-2019.)

Hypotheses

Ref	Expression
suppssfz.z	⊢ (𝜑 → 𝑍 ∈ 𝑉)
suppssfz.f	⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0))
suppssfz.s	⊢ (𝜑 → 𝑆 ∈ ℕ0)
suppssfz.b	⊢ (𝜑 → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍))

Assertion

Ref	Expression
suppssfz	⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ (0...𝑆))

Distinct variable groups:   𝑥,𝐹   𝑥,𝑆   𝑥,𝑍

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝑉(𝑥)

Proof of Theorem suppssfz

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suppssfz.b	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍))
2		suppssfz.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0))
3		elmapfn 8815	. . . . . . . 8 ⊢ (𝐹 ∈ (𝐵 ↑m ℕ0) → 𝐹 Fn ℕ0)
4	2, 3	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn ℕ0)
5		nn0ex 12424	. . . . . . . 8 ⊢ ℕ0 ∈ V
6	5	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℕ0 ∈ V)
7		suppssfz.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
8	4, 6, 7	3jca 1128	. . . . . 6 ⊢ (𝜑 → (𝐹 Fn ℕ0 ∧ ℕ0 ∈ V ∧ 𝑍 ∈ 𝑉))
9	8	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍)) → (𝐹 Fn ℕ0 ∧ ℕ0 ∈ V ∧ 𝑍 ∈ 𝑉))
10		elsuppfn 8126	. . . . 5 ⊢ ((𝐹 Fn ℕ0 ∧ ℕ0 ∈ V ∧ 𝑍 ∈ 𝑉) → (𝑛 ∈ (𝐹 supp 𝑍) ↔ (𝑛 ∈ ℕ0 ∧ (𝐹‘𝑛) ≠ 𝑍)))
11	9, 10	syl 17	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍)) → (𝑛 ∈ (𝐹 supp 𝑍) ↔ (𝑛 ∈ ℕ0 ∧ (𝐹‘𝑛) ≠ 𝑍)))
12		breq2 5106	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑛 → (𝑆 < 𝑥 ↔ 𝑆 < 𝑛))
13		fveqeq2 6849	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑛 → ((𝐹‘𝑥) = 𝑍 ↔ (𝐹‘𝑛) = 𝑍))
14	12, 13	imbi12d 344	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑛 → ((𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍) ↔ (𝑆 < 𝑛 → (𝐹‘𝑛) = 𝑍)))
15	14	rspcva 3583	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ0 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍)) → (𝑆 < 𝑛 → (𝐹‘𝑛) = 𝑍))
16		simplr 768	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑆 < 𝑛) → 𝑛 ∈ ℕ0)
17		suppssfz.s	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑆 ∈ ℕ0)
18	17	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ0) → 𝑆 ∈ ℕ0)
19	18	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑆 < 𝑛) → 𝑆 ∈ ℕ0)
20		nn0re 12427	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℕ0 → 𝑛 ∈ ℝ)
21		nn0re 12427	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑆 ∈ ℕ0 → 𝑆 ∈ ℝ)
22	17, 21	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑆 ∈ ℝ)
23		lenlt 11228	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑛 ∈ ℝ ∧ 𝑆 ∈ ℝ) → (𝑛 ≤ 𝑆 ↔ ¬ 𝑆 < 𝑛))
24	20, 22, 23	syl2anr 597	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ0) → (𝑛 ≤ 𝑆 ↔ ¬ 𝑆 < 𝑛))
25	24	biimpar 477	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑆 < 𝑛) → 𝑛 ≤ 𝑆)
26		elfz2nn0 13555	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (0...𝑆) ↔ (𝑛 ∈ ℕ0 ∧ 𝑆 ∈ ℕ0 ∧ 𝑛 ≤ 𝑆))
27	16, 19, 25, 26	syl3anbrc 1344	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑆 < 𝑛) → 𝑛 ∈ (0...𝑆))
28	27	a1d 25	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑆 < 𝑛) → ((𝐹‘𝑛) ≠ 𝑍 → 𝑛 ∈ (0...𝑆)))
29	28	ex 412	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ0) → (¬ 𝑆 < 𝑛 → ((𝐹‘𝑛) ≠ 𝑍 → 𝑛 ∈ (0...𝑆))))
30		eqneqall 2936	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹‘𝑛) = 𝑍 → ((𝐹‘𝑛) ≠ 𝑍 → 𝑛 ∈ (0...𝑆)))
31	30	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ0) → ((𝐹‘𝑛) = 𝑍 → ((𝐹‘𝑛) ≠ 𝑍 → 𝑛 ∈ (0...𝑆))))
32	29, 31	jad 187	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ0) → ((𝑆 < 𝑛 → (𝐹‘𝑛) = 𝑍) → ((𝐹‘𝑛) ≠ 𝑍 → 𝑛 ∈ (0...𝑆))))
33	32	com23 86	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ0) → ((𝐹‘𝑛) ≠ 𝑍 → ((𝑆 < 𝑛 → (𝐹‘𝑛) = 𝑍) → 𝑛 ∈ (0...𝑆))))
34	33	ex 412	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑛 ∈ ℕ0 → ((𝐹‘𝑛) ≠ 𝑍 → ((𝑆 < 𝑛 → (𝐹‘𝑛) = 𝑍) → 𝑛 ∈ (0...𝑆)))))
35	34	com14 96	. . . . . . . . . . 11 ⊢ ((𝑆 < 𝑛 → (𝐹‘𝑛) = 𝑍) → (𝑛 ∈ ℕ0 → ((𝐹‘𝑛) ≠ 𝑍 → (𝜑 → 𝑛 ∈ (0...𝑆)))))
36	15, 35	syl 17	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ0 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍)) → (𝑛 ∈ ℕ0 → ((𝐹‘𝑛) ≠ 𝑍 → (𝜑 → 𝑛 ∈ (0...𝑆)))))
37	36	ex 412	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ0 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍) → (𝑛 ∈ ℕ0 → ((𝐹‘𝑛) ≠ 𝑍 → (𝜑 → 𝑛 ∈ (0...𝑆))))))
38	37	pm2.43a 54	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍) → ((𝐹‘𝑛) ≠ 𝑍 → (𝜑 → 𝑛 ∈ (0...𝑆)))))
39	38	com23 86	. . . . . . 7 ⊢ (𝑛 ∈ ℕ0 → ((𝐹‘𝑛) ≠ 𝑍 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍) → (𝜑 → 𝑛 ∈ (0...𝑆)))))
40	39	imp 406	. . . . . 6 ⊢ ((𝑛 ∈ ℕ0 ∧ (𝐹‘𝑛) ≠ 𝑍) → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍) → (𝜑 → 𝑛 ∈ (0...𝑆))))
41	40	com13 88	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍) → ((𝑛 ∈ ℕ0 ∧ (𝐹‘𝑛) ≠ 𝑍) → 𝑛 ∈ (0...𝑆))))
42	41	imp 406	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍)) → ((𝑛 ∈ ℕ0 ∧ (𝐹‘𝑛) ≠ 𝑍) → 𝑛 ∈ (0...𝑆)))
43	11, 42	sylbid 240	. . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍)) → (𝑛 ∈ (𝐹 supp 𝑍) → 𝑛 ∈ (0...𝑆)))
44	43	ssrdv 3949	. 2 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ℕ0 (𝑆 < 𝑥 → (𝐹‘𝑥) = 𝑍)) → (𝐹 supp 𝑍) ⊆ (0...𝑆))
45	1, 44	mpdan 687	1 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ (0...𝑆))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  Vcvv 3444   ⊆ wss 3911   class class class wbr 5102   Fn wfn 6494  ‘cfv 6499  (class class class)co 7369   supp csupp 8116   ↑_m cmap 8776  ℝcr 11043  0cc0 11044   < clt 11184   ≤ cle 11185  ℕ₀cn0 12418  ...cfz 13444

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-supp 8117  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-er 8648  df-map 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-nn 12163  df-n0 12419  df-z 12506  df-uz 12770  df-fz 13445

This theorem is referenced by:  fsuppmapnn0fz  13937  fsfnn0gsumfsffz  19889