Metamath Proof Explorer


Theorem mplvrpmlem

Description: Lemma for mplvrpmga and others. (Contributed by Thierry Arnoux, 11-Jan-2026)

Ref Expression
Hypotheses mplvrpmlem.s ⊢ S = SymGrp ⁡ I
mplvrpmlem.p ⊢ P = Base S
mplvrpmlem.i ⊢ φ → I ∈ V
mplvrpmlem.d ⊢ φ → D ∈ P
mplvrpmlem.1 ⊢ φ → X ∈ h ∈ ℕ 0 I | finSupp 0 ⁡ h
Assertion mplvrpmlem ⊢ φ → X ∘ D ∈ h ∈ ℕ 0 I | finSupp 0 ⁡ h

Proof

Step Hyp Ref Expression
1 mplvrpmlem.s ⊢ S = SymGrp ⁡ I
2 mplvrpmlem.p ⊢ P = Base S
3 mplvrpmlem.i ⊢ φ → I ∈ V
4 mplvrpmlem.d ⊢ φ → D ∈ P
5 mplvrpmlem.1 ⊢ φ → X ∈ h ∈ ℕ 0 I | finSupp 0 ⁡ h
6 breq1 ⊢ h = X ∘ D → finSupp 0 ⁡ h ↔ finSupp 0 ⁡ X ∘ D
7 nn0ex ⊢ ℕ 0 ∈ V
8 7 a1i ⊢ φ → ℕ 0 ∈ V
9 ssrab2 ⊢ h ∈ ℕ 0 I | finSupp 0 ⁡ h ⊆ ℕ 0 I
10 9 5 sselid ⊢ φ → X ∈ ℕ 0 I
11 10 elmaprd ⊢ φ → X : I ⟶ ℕ 0
12 1 2 symgbasf1o ⊢ D ∈ P → D : I ⟶ 1-1 onto I
13 4 12 syl ⊢ φ → D : I ⟶ 1-1 onto I
14 f1of ⊢ D : I ⟶ 1-1 onto I → D : I ⟶ I
15 13 14 syl ⊢ φ → D : I ⟶ I
16 11 15 fcod ⊢ φ → X ∘ D : I ⟶ ℕ 0
17 8 3 16 elmapdd ⊢ φ → X ∘ D ∈ ℕ 0 I
18 breq1 ⊢ h = X → finSupp 0 ⁡ h ↔ finSupp 0 ⁡ X
19 18 5 elrabrd ⊢ φ → finSupp 0 ⁡ X
20 f1of1 ⊢ D : I ⟶ 1-1 onto I → D : I ⟶ 1-1 I
21 13 20 syl ⊢ φ → D : I ⟶ 1-1 I
22 0nn0 ⊢ 0 ∈ ℕ 0
23 22 a1i ⊢ φ → 0 ∈ ℕ 0
24 19 21 23 5 fsuppco ⊢ φ → finSupp 0 ⁡ X ∘ D
25 6 17 24 elrabd ⊢ φ → X ∘ D ∈ h ∈ ℕ 0 I | finSupp 0 ⁡ h