Theorem suppss2f 32730

Description: Show that the support of a function is contained in a set. (Contributed by Thierry Arnoux, 22-Jun-2017.) (Revised by AV, 1-Sep-2020.)

Hypotheses

Ref	Expression
suppss2f.p	⊢ Ⅎ𝑘𝜑
suppss2f.a	⊢ Ⅎ𝑘𝐴
suppss2f.w	⊢ Ⅎ𝑘𝑊
suppss2f.n	⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍)
suppss2f.v	⊢ (𝜑 → 𝐴 ∈ 𝑉)

Assertion

Ref	Expression
suppss2f	⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ 𝐵) supp 𝑍) ⊆ 𝑊)

Distinct variable group:   𝑘,𝑍

Allowed substitution hints:   𝜑(𝑘)   𝐴(𝑘)   𝐵(𝑘)   𝑉(𝑘)   𝑊(𝑘)

Proof of Theorem suppss2f

Dummy variable 𝑙 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suppss2f.a	. . . 4 ⊢ Ⅎ𝑘𝐴
2		nfcv 2901	. . . 4 ⊢ Ⅎ𝑙𝐴
3		nfcv 2901	. . . 4 ⊢ Ⅎ𝑙𝐵
4		nfcsb1v 3855	. . . 4 ⊢ Ⅎ𝑘⦋𝑙 / 𝑘⦌𝐵
5		csbeq1a 3845	. . . 4 ⊢ (𝑘 = 𝑙 → 𝐵 = ⦋𝑙 / 𝑘⦌𝐵)
6	1, 2, 3, 4, 5	cbvmptf 5172	. . 3 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵)
7	6	oveq1i 7366	. 2 ⊢ ((𝑘 ∈ 𝐴 ↦ 𝐵) supp 𝑍) = ((𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵) supp 𝑍)
8		suppss2f.n	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍)
9	8	sbt 2077	. . . 4 ⊢ [𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍)
10		sbim 2314	. . . . 5 ⊢ ([𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍) ↔ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → [𝑙 / 𝑘]𝐵 = 𝑍))
11		sban 2091	. . . . . . 7 ⊢ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ ([𝑙 / 𝑘]𝜑 ∧ [𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊)))
12		suppss2f.p	. . . . . . . . 9 ⊢ Ⅎ𝑘𝜑
13	12	sbf 2282	. . . . . . . 8 ⊢ ([𝑙 / 𝑘]𝜑 ↔ 𝜑)
14		suppss2f.w	. . . . . . . . . 10 ⊢ Ⅎ𝑘𝑊
15	1, 14	nfdif 4060	. . . . . . . . 9 ⊢ Ⅎ𝑘(𝐴 ∖ 𝑊)
16	15	clelsb1fw 2905	. . . . . . . 8 ⊢ ([𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊) ↔ 𝑙 ∈ (𝐴 ∖ 𝑊))
17	13, 16	anbi12i 634	. . . . . . 7 ⊢ (([𝑙 / 𝑘]𝜑 ∧ [𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ (𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)))
18	11, 17	bitri 276	. . . . . 6 ⊢ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ (𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)))
19		sbsbc 3727	. . . . . . 7 ⊢ ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ [𝑙 / 𝑘]𝐵 = 𝑍)
20		sbceq1g 4345	. . . . . . . 8 ⊢ (𝑙 ∈ V → ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ ⦋𝑙 / 𝑘⦌𝐵 = 𝑍))
21	20	elv 3436	. . . . . . 7 ⊢ ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ ⦋𝑙 / 𝑘⦌𝐵 = 𝑍)
22	19, 21	bitri 276	. . . . . 6 ⊢ ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ ⦋𝑙 / 𝑘⦌𝐵 = 𝑍)
23	18, 22	imbi12i 351	. . . . 5 ⊢ (([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → [𝑙 / 𝑘]𝐵 = 𝑍) ↔ ((𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)) → ⦋𝑙 / 𝑘⦌𝐵 = 𝑍))
24	10, 23	bitri 276	. . . 4 ⊢ ([𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍) ↔ ((𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)) → ⦋𝑙 / 𝑘⦌𝐵 = 𝑍))
25	9, 24	mpbi 231	. . 3 ⊢ ((𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)) → ⦋𝑙 / 𝑘⦌𝐵 = 𝑍)
26		suppss2f.v	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
27	25, 26	suppss2 8140	. 2 ⊢ (𝜑 → ((𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵) supp 𝑍) ⊆ 𝑊)
28	7, 27	eqsstrid 3953	1 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ 𝐵) supp 𝑍) ⊆ 𝑊)

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547  Ⅎwnf 1790  [wsb 2073   ∈ wcel 2119  Ⅎwnfc 2886  Vcvv 3431  [wsbc 3723  ⦋csb 3831   ∖ cdif 3880   ⊆ wss 3883   ↦ cmpt 5153  (class class class)co 7356   supp csupp 8100

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-supp 8101

This theorem is referenced by:  suppgsumssiun  33153  elrspunidl  33511  esumss  34256