Theorem suppss2f 33056

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 2927	. . . 4 ⊢ Ⅎ𝑙𝐴
3		nfcv 2927	. . . 4 ⊢ Ⅎ𝑙𝐵
4		nfcsb1v 3878	. . . 4 ⊢ Ⅎ𝑘⦋𝑙 / 𝑘⦌𝐵
5		csbeq1a 3868	. . . 4 ⊢ (𝑘 = 𝑙 → 𝐵 = ⦋𝑙 / 𝑘⦌𝐵)
6	1, 2, 3, 4, 5	cbvmptf 5213	. . 3 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵)
7	6	oveq1i 7429	. 2 ⊢ ((𝑘 ∈ 𝐴 ↦ 𝐵) supp 𝑍) = ((𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵) supp 𝑍)
8		suppss2f.n	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍)
9	8	sbt 2103	. . . 4 ⊢ [𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍)
10		sbim 2340	. . . . 5 ⊢ ([𝑙 / 𝑘]((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → 𝐵 = 𝑍) ↔ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) → [𝑙 / 𝑘]𝐵 = 𝑍))
11		sban 2117	. . . . . . 7 ⊢ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ ([𝑙 / 𝑘]𝜑 ∧ [𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊)))
12		suppss2f.p	. . . . . . . . 9 ⊢ Ⅎ𝑘𝜑
13	12	sbf 2308	. . . . . . . 8 ⊢ ([𝑙 / 𝑘]𝜑 ↔ 𝜑)
14		suppss2f.w	. . . . . . . . . 10 ⊢ Ⅎ𝑘𝑊
15	1, 14	nfdif 4084	. . . . . . . . 9 ⊢ Ⅎ𝑘(𝐴 ∖ 𝑊)
16	15	clelsb1fw 2931	. . . . . . . 8 ⊢ ([𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊) ↔ 𝑙 ∈ (𝐴 ∖ 𝑊))
17	13, 16	anbi12i 640	. . . . . . 7 ⊢ (([𝑙 / 𝑘]𝜑 ∧ [𝑙 / 𝑘]𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ (𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)))
18	11, 17	bitri 278	. . . . . 6 ⊢ ([𝑙 / 𝑘](𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝑊)) ↔ (𝜑 ∧ 𝑙 ∈ (𝐴 ∖ 𝑊)))
19		sbsbc 3750	. . . . . . 7 ⊢ ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ [𝑙 / 𝑘]𝐵 = 𝑍)
20		sbceq1g 4382	. . . . . . . 8 ⊢ (𝑙 ∈ V → ([𝑙 / 𝑘]𝐵 = 𝑍 ↔ ⦋𝑙 / 𝑘⦌𝐵 = 𝑍))
21	20	elv 3462	. . . . . . 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 8202	. 2 ⊢ (𝜑 → ((𝑙 ∈ 𝐴 ↦ ⦋𝑙 / 𝑘⦌𝐵) supp 𝑍) ⊆ 𝑊)
28	7, 27	eqsstrid 3976	1 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ↦ 𝐵) supp 𝑍) ⊆ 𝑊)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816  [wsb 2099   ∈ wcel 2146  Ⅎwnfc 2912  Vcvv 3457  [wsbc 3746  ⦋csb 3854   ∖ cdif 3903   ⊆ wss 3906   ↦ cmpt 5194  (class class class)co 7419   supp csupp 8162

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-supp 8163

This theorem is used by:  suppgsumssiun  33458  elrspunidl  33802  esumss  34528