Metamath Proof Explorer


Theorem suppssfz

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)

Ref Expression
Hypotheses suppssfz.z ⊢ φ → Z ∈ V
suppssfz.f ⊢ φ → F ∈ B ℕ 0
suppssfz.s ⊢ φ → S ∈ ℕ 0
suppssfz.b ⊢ φ → ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z
Assertion suppssfz ⊢ φ → F supp Z ⊆ 0 … S

Proof

Step Hyp Ref Expression
1 suppssfz.z ⊢ φ → Z ∈ V
2 suppssfz.f ⊢ φ → F ∈ B ℕ 0
3 suppssfz.s ⊢ φ → S ∈ ℕ 0
4 suppssfz.b ⊢ φ → ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z
5 elmapfn ⊢ F ∈ B ℕ 0 → F Fn ℕ 0
6 2 5 syl ⊢ φ → F Fn ℕ 0
7 nn0ex ⊢ ℕ 0 ∈ V
8 7 a1i ⊢ φ → ℕ 0 ∈ V
9 6 8 1 3jca ⊢ φ → F Fn ℕ 0 ∧ ℕ 0 ∈ V ∧ Z ∈ V
10 9 adantr ⊢ φ ∧ ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → F Fn ℕ 0 ∧ ℕ 0 ∈ V ∧ Z ∈ V
11 elsuppfn ⊢ F Fn ℕ 0 ∧ ℕ 0 ∈ V ∧ Z ∈ V → n ∈ supp Z⁡ F ↔ n ∈ ℕ 0 ∧ F ⁡ n ≠ Z
12 10 11 syl ⊢ φ ∧ ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → n ∈ supp Z⁡ F ↔ n ∈ ℕ 0 ∧ F ⁡ n ≠ Z
13 breq2 ⊢ x = n → S < x ↔ S < n
14 fveqeq2 ⊢ x = n → F ⁡ x = Z ↔ F ⁡ n = Z
15 13 14 imbi12d ⊢ x = n → S < x → F ⁡ x = Z ↔ S < n → F ⁡ n = Z
16 15 rspcva ⊢ n ∈ ℕ 0 ∧ ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → S < n → F ⁡ n = Z
17 simplr ⊢ φ ∧ n ∈ ℕ 0 ∧ ¬ S < n → n ∈ ℕ 0
18 3 adantr ⊢ φ ∧ n ∈ ℕ 0 → S ∈ ℕ 0
19 18 adantr ⊢ φ ∧ n ∈ ℕ 0 ∧ ¬ S < n → S ∈ ℕ 0
20 nn0re ⊢ n ∈ ℕ 0 → n ∈ ℝ
21 nn0re ⊢ S ∈ ℕ 0 → S ∈ ℝ
22 3 21 syl ⊢ φ → S ∈ ℝ
23 lenlt ⊢ n ∈ ℝ ∧ S ∈ ℝ → n ≤ S ↔ ¬ S < n
24 20 22 23 syl2anr ⊢ φ ∧ n ∈ ℕ 0 → n ≤ S ↔ ¬ S < n
25 24 biimpar ⊢ φ ∧ n ∈ ℕ 0 ∧ ¬ S < n → n ≤ S
26 elfz2nn0 ⊢ n ∈ 0 … S ↔ n ∈ ℕ 0 ∧ S ∈ ℕ 0 ∧ n ≤ S
27 17 19 25 26 syl3anbrc ⊢ φ ∧ n ∈ ℕ 0 ∧ ¬ S < n → n ∈ 0 … S
28 27 a1d ⊢ φ ∧ n ∈ ℕ 0 ∧ ¬ S < n → F ⁡ n ≠ Z → n ∈ 0 … S
29 28 ex ⊢ φ ∧ n ∈ ℕ 0 → ¬ S < n → F ⁡ n ≠ Z → n ∈ 0 … S
30 eqneqall ⊢ F ⁡ n = Z → F ⁡ n ≠ Z → n ∈ 0 … S
31 30 a1i ⊢ φ ∧ n ∈ ℕ 0 → F ⁡ n = Z → F ⁡ n ≠ Z → n ∈ 0 … S
32 29 31 jad ⊢ φ ∧ n ∈ ℕ 0 → S < n → F ⁡ n = Z → F ⁡ n ≠ Z → n ∈ 0 … S
33 32 com23 ⊢ φ ∧ n ∈ ℕ 0 → F ⁡ n ≠ Z → S < n → F ⁡ n = Z → n ∈ 0 … S
34 33 ex ⊢ φ → n ∈ ℕ 0 → F ⁡ n ≠ Z → S < n → F ⁡ n = Z → n ∈ 0 … S
35 34 com14 ⊢ S < n → F ⁡ n = Z → n ∈ ℕ 0 → F ⁡ n ≠ Z → φ → n ∈ 0 … S
36 16 35 syl ⊢ n ∈ ℕ 0 ∧ ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → n ∈ ℕ 0 → F ⁡ n ≠ Z → φ → n ∈ 0 … S
37 36 ex ⊢ n ∈ ℕ 0 → ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → n ∈ ℕ 0 → F ⁡ n ≠ Z → φ → n ∈ 0 … S
38 37 pm2.43a ⊢ n ∈ ℕ 0 → ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → F ⁡ n ≠ Z → φ → n ∈ 0 … S
39 38 com23 ⊢ n ∈ ℕ 0 → F ⁡ n ≠ Z → ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → φ → n ∈ 0 … S
40 39 imp ⊢ n ∈ ℕ 0 ∧ F ⁡ n ≠ Z → ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → φ → n ∈ 0 … S
41 40 com13 ⊢ φ → ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → n ∈ ℕ 0 ∧ F ⁡ n ≠ Z → n ∈ 0 … S
42 41 imp ⊢ φ ∧ ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → n ∈ ℕ 0 ∧ F ⁡ n ≠ Z → n ∈ 0 … S
43 12 42 sylbid ⊢ φ ∧ ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → n ∈ supp Z⁡ F → n ∈ 0 … S
44 43 ssrdv ⊢ φ ∧ ∀ x ∈ ℕ 0 S < x → F ⁡ x = Z → F supp Z ⊆ 0 … S
45 4 44 mpdan ⊢ φ → F supp Z ⊆ 0 … S