Metamath Proof Explorer


Theorem psrbagev1

Description: A bag of multipliers provides the conditions for a valid sum. (Contributed by Stefan O'Rear, 9-Mar-2015) (Revised by AV, 18-Jul-2019) (Revised by AV, 11-Apr-2024) Remove a sethood hypothesis. (Revised by SN, 7-Aug-2024)

Ref Expression
Hypotheses psrbagev1.d ⊢ D = h ∈ ℕ 0 I | h -1 ℕ ∈ Fin
psrbagev1.c ⊢ C = Base T
psrbagev1.x ⊢ · ˙ = ⋅ T
psrbagev1.z ⊢ 0 ˙ = 0 T
psrbagev1.t ⊢ φ → T ∈ CMnd
psrbagev1.b ⊢ φ → B ∈ D
psrbagev1.g ⊢ φ → G : I ⟶ C
Assertion psrbagev1 ⊢ φ → B · ˙ f G : I ⟶ C ∧ finSupp 0 ˙⁡ B · ˙ f G

Proof

Step Hyp Ref Expression
1 psrbagev1.d ⊢ D = h ∈ ℕ 0 I | h -1 ℕ ∈ Fin
2 psrbagev1.c ⊢ C = Base T
3 psrbagev1.x ⊢ · ˙ = ⋅ T
4 psrbagev1.z ⊢ 0 ˙ = 0 T
5 psrbagev1.t ⊢ φ → T ∈ CMnd
6 psrbagev1.b ⊢ φ → B ∈ D
7 psrbagev1.g ⊢ φ → G : I ⟶ C
8 5 cmnmndd ⊢ φ → T ∈ Mnd
9 2 3 mulgnn0cl ⊢ T ∈ Mnd ∧ y ∈ ℕ 0 ∧ z ∈ C → y · ˙ z ∈ C
10 9 3expb ⊢ T ∈ Mnd ∧ y ∈ ℕ 0 ∧ z ∈ C → y · ˙ z ∈ C
11 8 10 sylan ⊢ φ ∧ y ∈ ℕ 0 ∧ z ∈ C → y · ˙ z ∈ C
12 1 psrbagf ⊢ B ∈ D → B : I ⟶ ℕ 0
13 6 12 syl ⊢ φ → B : I ⟶ ℕ 0
14 13 ffnd ⊢ φ → B Fn I
15 6 14 fndmexd ⊢ φ → I ∈ V
16 inidm ⊢ I ∩ I = I
17 11 13 7 15 15 16 off ⊢ φ → B · ˙ f G : I ⟶ C
18 ovexd ⊢ φ → B · ˙ f G ∈ V
19 7 ffnd ⊢ φ → G Fn I
20 14 19 15 15 offun ⊢ φ → Fun ⁡ B · ˙ f G
21 4 fvexi ⊢ 0 ˙ ∈ V
22 21 a1i ⊢ φ → 0 ˙ ∈ V
23 1 psrbagfsupp ⊢ B ∈ D → finSupp 0 ⁡ B
24 6 23 syl ⊢ φ → finSupp 0 ⁡ B
25 24 fsuppimpd ⊢ φ → B supp 0 ∈ Fin
26 ssidd ⊢ φ → B supp 0 ⊆ B supp 0
27 2 4 3 mulg0 ⊢ z ∈ C → 0 · ˙ z = 0 ˙
28 27 adantl ⊢ φ ∧ z ∈ C → 0 · ˙ z = 0 ˙
29 c0ex ⊢ 0 ∈ V
30 29 a1i ⊢ φ → 0 ∈ V
31 26 28 13 7 15 30 suppssof1 ⊢ φ → B · ˙ f G supp 0 ˙ ⊆ B supp 0
32 suppssfifsupp ⊢ B · ˙ f G ∈ V ∧ Fun ⁡ B · ˙ f G ∧ 0 ˙ ∈ V ∧ B supp 0 ∈ Fin ∧ B · ˙ f G supp 0 ˙ ⊆ B supp 0 → finSupp 0 ˙⁡ B · ˙ f G
33 18 20 22 25 31 32 syl32anc ⊢ φ → finSupp 0 ˙⁡ B · ˙ f G
34 17 33 jca ⊢ φ → B · ˙ f G : I ⟶ C ∧ finSupp 0 ˙⁡ B · ˙ f G