Theorem fsuppssindlem2 43135

Description: Lemma for fsuppssind 43136. Write a function as a union. (Contributed by SN, 15-Jul-2024.)

Hypotheses

Ref	Expression
fsuppssindlem2.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)
fsuppssindlem2.v	⊢ (𝜑 → 𝐼 ∈ 𝑉)
fsuppssindlem2.s	⊢ (𝜑 → 𝑆 ⊆ 𝐼)

Assertion

Ref	Expression
fsuppssindlem2	⊢ (𝜑 → (𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝑓‘𝑥), 0 )) ∈ 𝐻} ↔ (𝐹:𝑆⟶𝐵 ∧ (𝐹 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))

Distinct variable groups:   𝑓,𝐼,𝑥   𝑆,𝑓,𝑥   𝑓,𝐹,𝑥   0 ,𝑓,𝑥   𝑓,𝐻   𝐵,𝑓

Allowed substitution hints:   𝜑(𝑥,𝑓)   𝐵(𝑥)   𝐻(𝑥)   𝑉(𝑥,𝑓)   𝑊(𝑥,𝑓)

Proof of Theorem fsuppssindlem2

Step	Hyp	Ref	Expression
1		fveq1 6861	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
2	1	ifeq1d 4497	. . . . 5 ⊢ (𝑓 = 𝐹 → if(𝑥 ∈ 𝑆, (𝑓‘𝑥), 0 ) = if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 ))
3	2	mpteq2dv 5191	. . . 4 ⊢ (𝑓 = 𝐹 → (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝑓‘𝑥), 0 )) = (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )))
4	3	eleq1d 2846	. . 3 ⊢ (𝑓 = 𝐹 → ((𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝑓‘𝑥), 0 )) ∈ 𝐻 ↔ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) ∈ 𝐻))
5	4	elrab 3649	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝑓‘𝑥), 0 )) ∈ 𝐻} ↔ (𝐹 ∈ (𝐵 ↑m 𝑆) ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) ∈ 𝐻))
6		fsuppssindlem2.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
7		fsuppssindlem2.v	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
8		fsuppssindlem2.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝐼)
9	7, 8	ssexd 5277	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ V)
10	6, 9	elmapd 8815	. . . 4 ⊢ (𝜑 → (𝐹 ∈ (𝐵 ↑m 𝑆) ↔ 𝐹:𝑆⟶𝐵))
11	10	anbi1d 640	. . 3 ⊢ (𝜑 → ((𝐹 ∈ (𝐵 ↑m 𝑆) ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) ∈ 𝐻) ↔ (𝐹:𝑆⟶𝐵 ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) ∈ 𝐻)))
12		partfun 6663	. . . . . 6 ⊢ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) = ((𝑥 ∈ (𝐼 ∩ 𝑆) ↦ (𝐹‘𝑥)) ∪ (𝑥 ∈ (𝐼 ∖ 𝑆) ↦ 0 ))
13		sseqin2 4173	. . . . . . . . . . 11 ⊢ (𝑆 ⊆ 𝐼 ↔ (𝐼 ∩ 𝑆) = 𝑆)
14	8, 13	sylib 220	. . . . . . . . . 10 ⊢ (𝜑 → (𝐼 ∩ 𝑆) = 𝑆)
15	14	mpteq1d 5187	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (𝐼 ∩ 𝑆) ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝑆 ↦ (𝐹‘𝑥)))
16	15	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → (𝑥 ∈ (𝐼 ∩ 𝑆) ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝑆 ↦ (𝐹‘𝑥)))
17		simpr 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → 𝐹:𝑆⟶𝐵)
18	17	feqmptd 6930	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → 𝐹 = (𝑥 ∈ 𝑆 ↦ (𝐹‘𝑥)))
19	16, 18	eqtr4d 2799	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → (𝑥 ∈ (𝐼 ∩ 𝑆) ↦ (𝐹‘𝑥)) = 𝐹)
20		fconstmpt 5705	. . . . . . . . 9 ⊢ ((𝐼 ∖ 𝑆) × { 0 }) = (𝑥 ∈ (𝐼 ∖ 𝑆) ↦ 0 )
21	20	eqcomi 2770	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐼 ∖ 𝑆) ↦ 0 ) = ((𝐼 ∖ 𝑆) × { 0 })
22	21	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → (𝑥 ∈ (𝐼 ∖ 𝑆) ↦ 0 ) = ((𝐼 ∖ 𝑆) × { 0 }))
23	19, 22	uneq12d 4120	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → ((𝑥 ∈ (𝐼 ∩ 𝑆) ↦ (𝐹‘𝑥)) ∪ (𝑥 ∈ (𝐼 ∖ 𝑆) ↦ 0 )) = (𝐹 ∪ ((𝐼 ∖ 𝑆) × { 0 })))
24	12, 23	eqtrid 2808	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) = (𝐹 ∪ ((𝐼 ∖ 𝑆) × { 0 })))
25	24	eleq1d 2846	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑆⟶𝐵) → ((𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) ∈ 𝐻 ↔ (𝐹 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))
26	25	pm5.32da 587	. . 3 ⊢ (𝜑 → ((𝐹:𝑆⟶𝐵 ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) ∈ 𝐻) ↔ (𝐹:𝑆⟶𝐵 ∧ (𝐹 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
27	11, 26	bitrd 281	. 2 ⊢ (𝜑 → ((𝐹 ∈ (𝐵 ↑m 𝑆) ∧ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝐹‘𝑥), 0 )) ∈ 𝐻) ↔ (𝐹:𝑆⟶𝐵 ∧ (𝐹 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
28	5, 27	bitrid 285	1 ⊢ (𝜑 → (𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑥 ∈ 𝐼 ↦ if(𝑥 ∈ 𝑆, (𝑓‘𝑥), 0 )) ∈ 𝐻} ↔ (𝐹:𝑆⟶𝐵 ∧ (𝐹 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141  {crab 3413  Vcvv 3453   ∖ cdif 3899   ∪ cun 3900   ∩ cin 3901   ⊆ wss 3902  ifcif 4477  {csn 4579   ↦ cmpt 5178   × cxp 5641  ⟶wf 6512  ‘cfv 6516  (class class class)co 7391   ↑_m cmap 8802

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-fv 6524  df-ov 7394  df-oprab 7395  df-mpo 7396  df-map 8804

This theorem is referenced by:  fsuppssind  43136