Theorem suppss2f 32983

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 2925	. . . 4 ⊢ Ⅎ𝑙𝐴
3		nfcv 2925	. . . 4 ⊢ Ⅎ𝑙𝐵
4		nfcsb1v 3877	. . . 4 ⊢ Ⅎ𝑘⦋𝑙 / 𝑘⦌𝐵
5		csbeq1a 3867	. . . 4 ⊢ (𝑘 = 𝑙 → 𝐵 = ⦋𝑙 / 𝑘⦌𝐵)
6	1, 2, 3, 4, 5	cbvmptf 5211	. . 3 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵)
7	6	oveq1i 7420	. 2 ⊢ ((𝑘 ∈ 𝐴 ↦ 𝐵) supp 𝑍) = ((𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵) supp 𝑍)
8		suppss2f.n	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍)
9	8	sbt 2100	. . . 4 ⊢ [𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍)
10		sbim 2338	. . . . 5 ⊢ ([𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍) ↔ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → [𝑙 / 𝑘]𝐵 = 𝑍))
11		sban 2114	. . . . . . 7 ⊢ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ ([𝑙 / 𝑘]𝜑 ∧ [𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊)))
12		suppss2f.p	. . . . . . . . 9 ⊢ Ⅎ𝑘𝜑
13	12	sbf 2306	. . . . . . . 8 ⊢ ([𝑙 / 𝑘]𝜑 ↔ 𝜑)
14		suppss2f.w	. . . . . . . . . 10 ⊢ Ⅎ𝑘𝑊
15	1, 14	nfdif 4084	. . . . . . . . 9 ⊢ Ⅎ𝑘(𝐴 ∖ 𝑊)
16	15	clelsb1fw 2929	. . . . . . . 8 ⊢ ([𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊) ↔ 𝑙 ∈ (𝐴 ∖ 𝑊))
17	13, 16	anbi12i 639	. . . . . . 7 ⊢ (([𝑙 / 𝑘]𝜑 ∧ [𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ (𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)))
18	11, 17	bitri 278	. . . . . 6 ⊢ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ (𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)))
19		sbsbc 3748	. . . . . . 7 ⊢ ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ [𝑙 / 𝑘]𝐵 = 𝑍)
20		sbceq1g 4382	. . . . . . . 8 ⊢ (𝑙 ∈ V → ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ ⦋𝑙 / 𝑘⦌𝐵 = 𝑍))
21	20	elv 3460	. . . . . . 7 ⊢ ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ ⦋𝑙 / 𝑘⦌𝐵 = 𝑍)
22	19, 21	bitri 278	. . . . . 6 ⊢ ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ ⦋𝑙 / 𝑘⦌𝐵 = 𝑍)
23	18, 22	imbi12i 353	. . . . 5 ⊢ (([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → [𝑙 / 𝑘]𝐵 = 𝑍) ↔ ((𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)) → ⦋𝑙 / 𝑘⦌𝐵 = 𝑍))
24	10, 23	bitri 278	. . . 4 ⊢ ([𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍) ↔ ((𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)) → ⦋𝑙 / 𝑘⦌𝐵 = 𝑍))
25	9, 24	mpbi 233	. . 3 ⊢ ((𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)) → ⦋𝑙 / 𝑘⦌𝐵 = 𝑍)
26		suppss2f.v	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
27	25, 26	suppss2 8192	. 2 ⊢ (𝜑 → ((𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵) supp 𝑍) ⊆ 𝑊)
28	7, 27	eqsstrid 3975	1 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ 𝐵) supp 𝑍) ⊆ 𝑊)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570  Ⅎwnf 1813  [wsb 2096   ∈ wcel 2143  Ⅎwnfc 2910  Vcvv 3455  [wsbc 3744  ⦋csb 3853   ∖ cdif 3902   ⊆ wss 3905   ↦ cmpt 5192  (class class class)co 7410   supp csupp 8152

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-supp 8153

This theorem is referenced by:  suppgsumssiun  33392  elrspunidl  33736  esumss  34462