Theorem fsuppssind 43583

Description: Induction on functions 𝐹:𝐴⟶𝐵 with finite support (see fsuppind 43580) whose supports are subsets of 𝑆. (Contributed by SN, 15-Jun-2024.)

Hypotheses

Ref	Expression
fsuppssind.b	⊢ 𝐵 = (Base‘𝐺)
fsuppssind.z	⊢ 0 = (0g‘𝐺)
fsuppssind.p	⊢ + = (+g‘𝐺)
fsuppssind.g	⊢ (𝜑 → 𝐺 ∈ Grp)
fsuppssind.v	⊢ (𝜑 → 𝐼 ∈ 𝑉)
fsuppssind.s	⊢ (𝜑 → 𝑆 ⊆ 𝐼)
fsuppssind.0	⊢ (𝜑 → (𝐼 × { 0 }) ∈ 𝐻)
fsuppssind.1	⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → (𝑠 ∈ 𝐼 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∈ 𝐻)
fsuppssind.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥 ∘f + 𝑦) ∈ 𝐻)
fsuppssind.3	⊢ (𝜑 → 𝑋:𝐼⟶𝐵)
fsuppssind.4	⊢ (𝜑 → 𝑋 finSupp 0 )
fsuppssind.5	⊢ (𝜑 → (𝑋 supp 0 ) ⊆ 𝑆)

Assertion

Ref	Expression
fsuppssind	⊢ (𝜑 → 𝑋 ∈ 𝐻)

Distinct variable groups:   𝐵,𝑎,𝑏,𝑠   0 ,𝑎,𝑏,𝑠   𝑥, 0 ,𝑦   + ,𝑠,𝑥,𝑦   𝜑,𝑎,𝑏,𝑠   𝜑,𝑥,𝑦   𝐼,𝑎,𝑏,𝑠   𝑥,𝐼,𝑦,𝑠   𝑆,𝑎,𝑏   𝑥,𝑆,𝑦,𝑠   𝐻,𝑎,𝑏,𝑠   𝑥,𝐻,𝑦

Allowed substitution hints:   𝐵(𝑥, 𝑦)   + (𝑎, 𝑏)   𝐺(𝑥, 𝑦, 𝑠, 𝑎, 𝑏)   𝑉(𝑥, 𝑦, 𝑠, 𝑎, 𝑏)   𝑋(𝑥, 𝑦, 𝑠, 𝑎, 𝑏)

Proof of Theorem fsuppssind

Dummy variables 𝑓 𝑡 𝑢 𝑣 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fsuppssind.3	. . . . 5 ⊢ (𝜑 → 𝑋:𝐼⟶𝐵)
2		fsuppssind.s	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ 𝐼)
3	1, 2	fssresd 6741	. . . 4 ⊢ (𝜑 → (𝑋 ↾ 𝑆):𝑆⟶𝐵)
4		fsuppssind.4	. . . . 5 ⊢ (𝜑 → 𝑋 finSupp 0 )
5		fsuppssind.z	. . . . . . 7 ⊢ 0 = (0g‘𝐺)
6	5	fvexi 6891	. . . . . 6 ⊢ 0 ∈ V
7	6	a1i 11	. . . . 5 ⊢ (𝜑 → 0 ∈ V)
8	4, 7	fsuppres 9369	. . . 4 ⊢ (𝜑 → (𝑋 ↾ 𝑆) finSupp 0 )
9	3, 8	jca 521	. . 3 ⊢ (𝜑 → ((𝑋 ↾ 𝑆):𝑆⟶𝐵 ∧ (𝑋 ↾ 𝑆) finSupp 0 ))
10		fsuppssind.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
11		fsuppssind.p	. . . 4 ⊢ + = (+g‘𝐺)
12		fsuppssind.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp)
13		fsuppssind.v	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
14	13, 2	ssexd 5286	. . . 4 ⊢ (𝜑 → 𝑆 ∈ V)
15	10, 5	grpidcl 19156	. . . . . . 7 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵)
16	12, 15	syl 18	. . . . . 6 ⊢ (𝜑 → 0 ∈ 𝐵)
17		fconst6g 6763	. . . . . 6 ⊢ ( 0 ∈ 𝐵 → (𝑆 × { 0 }):𝑆⟶𝐵)
18	16, 17	syl 18	. . . . 5 ⊢ (𝜑 → (𝑆 × { 0 }):𝑆⟶𝐵)
19		xpundir 5721	. . . . . . 7 ⊢ ((𝑆 ∪ (𝐼 ∖ 𝑆)) × { 0 }) = ((𝑆 × { 0 }) ∪ ((𝐼 ∖ 𝑆) × { 0 }))
20		undif 4438	. . . . . . . . 9 ⊢ (𝑆 ⊆ 𝐼 ↔ (𝑆 ∪ (𝐼 ∖ 𝑆)) = 𝐼)
21	2, 20	sylib 221	. . . . . . . 8 ⊢ (𝜑 → (𝑆 ∪ (𝐼 ∖ 𝑆)) = 𝐼)
22	21	xpeq1d 5680	. . . . . . 7 ⊢ (𝜑 → ((𝑆 ∪ (𝐼 ∖ 𝑆)) × { 0 }) = (𝐼 × { 0 }))
23	19, 22	eqtr3id 2810	. . . . . 6 ⊢ (𝜑 → ((𝑆 × { 0 }) ∪ ((𝐼 ∖ 𝑆) × { 0 })) = (𝐼 × { 0 }))
24		fsuppssind.0	. . . . . 6 ⊢ (𝜑 → (𝐼 × { 0 }) ∈ 𝐻)
25	23, 24	eqeltrd 2861	. . . . 5 ⊢ (𝜑 → ((𝑆 × { 0 }) ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)
26	10	fvexi 6891	. . . . . . 7 ⊢ 𝐵 ∈ V
27	26	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ V)
28	27, 13, 2	fsuppssindlem2 43582	. . . . 5 ⊢ (𝜑 → ((𝑆 × { 0 }) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ ((𝑆 × { 0 }):𝑆⟶𝐵 ∧ ((𝑆 × { 0 }) ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
29	18, 25, 28	mpbir2and 726	. . . 4 ⊢ (𝜑 → (𝑆 × { 0 }) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻})
30		simplrr 790	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑠 ∈ 𝑆) → 𝑏 ∈ 𝐵)
31	16	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑠 ∈ 𝑆) → 0 ∈ 𝐵)
32	30, 31	ifcld 4529	. . . . . 6 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑠 ∈ 𝑆) → if(𝑠 = 𝑎, 𝑏, 0 ) ∈ 𝐵)
33	32	fmpttd 7107	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → (𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )):𝑆⟶𝐵)
34		fconstmpt 5713	. . . . . . . 8 ⊢ ((𝐼 ∖ 𝑆) × { 0 }) = (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ 0 )
35	34	uneq2i 4112	. . . . . . 7 ⊢ ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ ((𝐼 ∖ 𝑆) × { 0 })) = ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ 0 ))
36		eldifn 4079	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ (𝐼 ∖ 𝑆) → ¬ 𝑠 ∈ 𝑆)
37		eleq1a 2856	. . . . . . . . . . . . . . 15 ⊢ (𝑎 ∈ 𝑆 → (𝑠 = 𝑎 → 𝑠 ∈ 𝑆))
38	37	con3dimp 414	. . . . . . . . . . . . . 14 ⊢ ((𝑎 ∈ 𝑆 ∧ ¬ 𝑠 ∈ 𝑆) → ¬ 𝑠 = 𝑎)
39	38	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵) ∧ ¬ 𝑠 ∈ 𝑆) → ¬ 𝑠 = 𝑎)
40	39	adantll 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) ∧ ¬ 𝑠 ∈ 𝑆) → ¬ 𝑠 = 𝑎)
41	36, 40	sylan2 605	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑠 ∈ (𝐼 ∖ 𝑆)) → ¬ 𝑠 = 𝑎)
42	41	iffalsed 4493	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) ∧ 𝑠 ∈ (𝐼 ∖ 𝑆)) → if(𝑠 = 𝑎, 𝑏, 0 ) = 0 )
43	42	mpteq2dva 5198	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ if(𝑠 = 𝑎, 𝑏, 0 )) = (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ 0 ))
44	43	uneq2d 4115	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ if(𝑠 = 𝑎, 𝑏, 0 ))) = ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ 0 )))
45		mptun 6677	. . . . . . . . 9 ⊢ (𝑠 ∈ (𝑆 ∪ (𝐼 ∖ 𝑆)) ↦ if(𝑠 = 𝑎, 𝑏, 0 )) = ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ if(𝑠 = 𝑎, 𝑏, 0 )))
46	2	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → 𝑆 ⊆ 𝐼)
47	46, 20	sylib 221	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → (𝑆 ∪ (𝐼 ∖ 𝑆)) = 𝐼)
48	47	mpteq1d 5195	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → (𝑠 ∈ (𝑆 ∪ (𝐼 ∖ 𝑆)) ↦ if(𝑠 = 𝑎, 𝑏, 0 )) = (𝑠 ∈ 𝐼 ↦ if(𝑠 = 𝑎, 𝑏, 0 )))
49	45, 48	eqtr3id 2810	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ if(𝑠 = 𝑎, 𝑏, 0 ))) = (𝑠 ∈ 𝐼 ↦ if(𝑠 = 𝑎, 𝑏, 0 )))
50	44, 49	eqtr3d 2798	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ (𝑠 ∈ (𝐼 ∖ 𝑆) ↦ 0 )) = (𝑠 ∈ 𝐼 ↦ if(𝑠 = 𝑎, 𝑏, 0 )))
51	35, 50	eqtrid 2808	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ ((𝐼 ∖ 𝑆) × { 0 })) = (𝑠 ∈ 𝐼 ↦ if(𝑠 = 𝑎, 𝑏, 0 )))
52		fsuppssind.1	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → (𝑠 ∈ 𝐼 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∈ 𝐻)
53	51, 52	eqeltrd 2861	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)
54	26	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → 𝐵 ∈ V)
55	13	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → 𝐼 ∈ 𝑉)
56	54, 55, 46	fsuppssindlem2 43582	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )):𝑆⟶𝐵 ∧ ((𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
57	33, 53, 56	mpbir2and 726	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝐵)) → (𝑠 ∈ 𝑆 ↦ if(𝑠 = 𝑎, 𝑏, 0 )) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻})
58	27, 13, 2	fsuppssindlem2 43582	. . . . . 6 ⊢ (𝜑 → (𝑠 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ (𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
59	27, 13, 2	fsuppssindlem2 43582	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
60	58, 59	anbi12d 644	. . . . 5 ⊢ (𝜑 → ((𝑠 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ∧ 𝑡 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻}) ↔ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))))
61	10, 11	grpcl 19132	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵) → (𝑢 + 𝑣) ∈ 𝐵)
62	12, 61	syl3an1 1181	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵) → (𝑢 + 𝑣) ∈ 𝐵)
63	62	3expb 1138	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢 + 𝑣) ∈ 𝐵)
64	63	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢 + 𝑣) ∈ 𝐵)
65		simprll 791	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → 𝑠:𝑆⟶𝐵)
66		simprrl 793	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → 𝑡:𝑆⟶𝐵)
67	14	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → 𝑆 ∈ V)
68		inidm 4172	. . . . . . 7 ⊢ (𝑆 ∩ 𝑆) = 𝑆
69	64, 65, 66, 67, 67, 68	off 7700	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → (𝑠 ∘f + 𝑡):𝑆⟶𝐵)
70	65	ffnd 6702	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → 𝑠 Fn 𝑆)
71	66	ffnd 6702	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → 𝑡 Fn 𝑆)
72		fnconstg 6762	. . . . . . . . . 10 ⊢ ( 0 ∈ V → ((𝐼 ∖ 𝑆) × { 0 }) Fn (𝐼 ∖ 𝑆))
73	6, 72	mp1i 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝐼 ∖ 𝑆) × { 0 }) Fn (𝐼 ∖ 𝑆))
74	13	difexd 5293	. . . . . . . . . 10 ⊢ (𝜑 → (𝐼 ∖ 𝑆) ∈ V)
75	74	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → (𝐼 ∖ 𝑆) ∈ V)
76		disjdif 4426	. . . . . . . . . 10 ⊢ (𝑆 ∩ (𝐼 ∖ 𝑆)) = ∅
77	76	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → (𝑆 ∩ (𝐼 ∖ 𝑆)) = ∅)
78	70, 71, 73, 73, 67, 75, 77	ofun 43257	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∘f + (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 }))) = ((𝑠 ∘f + 𝑡) ∪ (((𝐼 ∖ 𝑆) × { 0 }) ∘f + ((𝐼 ∖ 𝑆) × { 0 }))))
79	6, 72	mp1i 14	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐼 ∖ 𝑆) × { 0 }) Fn (𝐼 ∖ 𝑆))
80		fvconst2g 7200	. . . . . . . . . . . 12 ⊢ (( 0 ∈ V ∧ 𝑗 ∈ (𝐼 ∖ 𝑆)) → (((𝐼 ∖ 𝑆) × { 0 })‘𝑗) = 0 )
81	7, 80	sylan 592	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐼 ∖ 𝑆)) → (((𝐼 ∖ 𝑆) × { 0 })‘𝑗) = 0 )
82	10, 11, 5	grplid 19158	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ 𝐵) → ( 0 + 0 ) = 0 )
83	12, 16, 82	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (𝜑 → ( 0 + 0 ) = 0 )
84	83	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐼 ∖ 𝑆)) → ( 0 + 0 ) = 0 )
85	6	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐼 ∖ 𝑆)) → 0 ∈ V)
86	85, 80	sylancom 600	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐼 ∖ 𝑆)) → (((𝐼 ∖ 𝑆) × { 0 })‘𝑗) = 0 )
87	84, 86	eqtr4d 2799	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐼 ∖ 𝑆)) → ( 0 + 0 ) = (((𝐼 ∖ 𝑆) × { 0 })‘𝑗))
88	74, 79, 79, 79, 81, 81, 87	offveq 7708	. . . . . . . . . 10 ⊢ (𝜑 → (((𝐼 ∖ 𝑆) × { 0 }) ∘f + ((𝐼 ∖ 𝑆) × { 0 })) = ((𝐼 ∖ 𝑆) × { 0 }))
89	88	uneq2d 4115	. . . . . . . . 9 ⊢ (𝜑 → ((𝑠 ∘f + 𝑡) ∪ (((𝐼 ∖ 𝑆) × { 0 }) ∘f + ((𝐼 ∖ 𝑆) × { 0 }))) = ((𝑠 ∘f + 𝑡) ∪ ((𝐼 ∖ 𝑆) × { 0 })))
90	89	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝑠 ∘f + 𝑡) ∪ (((𝐼 ∖ 𝑆) × { 0 }) ∘f + ((𝐼 ∖ 𝑆) × { 0 }))) = ((𝑠 ∘f + 𝑡) ∪ ((𝐼 ∖ 𝑆) × { 0 })))
91	78, 90	eqtrd 2796	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∘f + (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 }))) = ((𝑠 ∘f + 𝑡) ∪ ((𝐼 ∖ 𝑆) × { 0 })))
92		fsuppssind.2	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥 ∘f + 𝑦) ∈ 𝐻)
93	92	caovclg 7605	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)) → ((𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∘f + (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 }))) ∈ 𝐻)
94	93	adantrrl 737	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻 ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∘f + (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 }))) ∈ 𝐻)
95	94	adantrll 735	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∘f + (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 }))) ∈ 𝐻)
96	91, 95	eqeltrrd 2862	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝑠 ∘f + 𝑡) ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)
97	27, 13, 2	fsuppssindlem2 43582	. . . . . . 7 ⊢ (𝜑 → ((𝑠 ∘f + 𝑡) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ ((𝑠 ∘f + 𝑡):𝑆⟶𝐵 ∧ ((𝑠 ∘f + 𝑡) ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
98	97	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → ((𝑠 ∘f + 𝑡) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ ((𝑠 ∘f + 𝑡):𝑆⟶𝐵 ∧ ((𝑠 ∘f + 𝑡) ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻)))
99	69, 96, 98	mpbir2and 726	. . . . 5 ⊢ ((𝜑 ∧ ((𝑠:𝑆⟶𝐵 ∧ (𝑠 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻) ∧ (𝑡:𝑆⟶𝐵 ∧ (𝑡 ∪ ((𝐼 ∖ 𝑆) × { 0 })) ∈ 𝐻))) → (𝑠 ∘f + 𝑡) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻})
100	60, 99	sylbida 604	. . . 4 ⊢ ((𝜑 ∧ (𝑠 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ∧ 𝑡 ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻})) → (𝑠 ∘f + 𝑡) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻})
101	10, 5, 11, 12, 14, 29, 57, 100	fsuppind 43580	. . 3 ⊢ ((𝜑 ∧ ((𝑋 ↾ 𝑆):𝑆⟶𝐵 ∧ (𝑋 ↾ 𝑆) finSupp 0 )) → (𝑋 ↾ 𝑆) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻})
102	9, 101	mpdan 700	. 2 ⊢ (𝜑 → (𝑋 ↾ 𝑆) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻})
103	27, 14	elmapd 8844	. . . . 5 ⊢ (𝜑 → ((𝑋 ↾ 𝑆) ∈ (𝐵 ↑m 𝑆) ↔ (𝑋 ↾ 𝑆):𝑆⟶𝐵))
104	3, 103	mpbird 260	. . . 4 ⊢ (𝜑 → (𝑋 ↾ 𝑆) ∈ (𝐵 ↑m 𝑆))
105		fveq1 6876	. . . . . . . 8 ⊢ (𝑓 = (𝑋 ↾ 𝑆) → (𝑓‘𝑖) = ((𝑋 ↾ 𝑆)‘𝑖))
106	105	ifeq1d 4502	. . . . . . 7 ⊢ (𝑓 = (𝑋 ↾ 𝑆) → if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 ) = if(𝑖 ∈ 𝑆, ((𝑋 ↾ 𝑆)‘𝑖), 0 ))
107	106	mpteq2dv 5199	. . . . . 6 ⊢ (𝑓 = (𝑋 ↾ 𝑆) → (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) = (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, ((𝑋 ↾ 𝑆)‘𝑖), 0 )))
108	107	eleq1d 2846	. . . . 5 ⊢ (𝑓 = (𝑋 ↾ 𝑆) → ((𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻 ↔ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, ((𝑋 ↾ 𝑆)‘𝑖), 0 )) ∈ 𝐻))
109	108	elrab3 3646	. . . 4 ⊢ ((𝑋 ↾ 𝑆) ∈ (𝐵 ↑m 𝑆) → ((𝑋 ↾ 𝑆) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, ((𝑋 ↾ 𝑆)‘𝑖), 0 )) ∈ 𝐻))
110	104, 109	syl 18	. . 3 ⊢ (𝜑 → ((𝑋 ↾ 𝑆) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, ((𝑋 ↾ 𝑆)‘𝑖), 0 )) ∈ 𝐻))
111		fsuppssind.5	. . . . 5 ⊢ (𝜑 → (𝑋 supp 0 ) ⊆ 𝑆)
112	7, 13, 1, 111	fsuppssindlem1 43581	. . . 4 ⊢ (𝜑 → 𝑋 = (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, ((𝑋 ↾ 𝑆)‘𝑖), 0 )))
113	112	eleq1d 2846	. . 3 ⊢ (𝜑 → (𝑋 ∈ 𝐻 ↔ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, ((𝑋 ↾ 𝑆)‘𝑖), 0 )) ∈ 𝐻))
114	110, 113	bitr4d 285	. 2 ⊢ (𝜑 → ((𝑋 ↾ 𝑆) ∈ {𝑓 ∈ (𝐵 ↑m 𝑆) ∣ (𝑖 ∈ 𝐼 ↦ if(𝑖 ∈ 𝑆, (𝑓‘𝑖), 0 )) ∈ 𝐻} ↔ 𝑋 ∈ 𝐻))
115	102, 114	mpbid 235	1 ⊢ (𝜑 → 𝑋 ∈ 𝐻)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  ifcif 4482  {csn 4584   class class class wbr 5103   ↦ cmpt 5186   × cxp 5649   ↾ cres 5653   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   ∘_f cof 7680   supp csupp 8161   ↑_m cmap 8831   finSupp cfsupp 9337  Basecbs 17367  +_gcplusg 17408  0_gc0g 17590  Grpcgrp 19124

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-resscn 11238  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-addrcl 11242  ax-mulcl 11243  ax-mulrcl 11244  ax-mulcom 11245  ax-addass 11246  ax-mulass 11247  ax-distr 11248  ax-i2m1 11249  ax-1ne0 11250  ax-1rid 11251  ax-rnegex 11252  ax-rrecex 11253  ax-cnre 11254  ax-pre-lttri 11255  ax-pre-lttrn 11256  ax-pre-ltadd 11257  ax-pre-mulgt0 11258

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7682  df-om 7867  df-1st 7990  df-2nd 7991  df-supp 8162  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-oadd 8464  df-er 8701  df-map 8833  df-en 8958  df-dom 8959  df-sdom 8960  df-fin 8961  df-fsupp 9338  df-dju 9963  df-card 10001  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11524  df-neg 11525  df-nn 12317  df-n0 12588  df-z 12675  df-uz 12947  df-fz 13621  df-hash 14455  df-0g 17592  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-grp 19127

This theorem is used by:  mhpind  43584