Metamath Proof Explorer


Theorem smndex1igidOLD

Description: Obsolete version of smndex1igid as of 2-Apr-2026. (Contributed by AV, 14-Feb-2024) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Hypotheses smndex1ibas.m ⊢ M = EndoFMnd ⁡ ℕ 0
smndex1ibas.n ⊢ N ∈ ℕ
smndex1ibas.i ⊢ I = x ∈ ℕ 0 ⟼ x mod N
smndex1ibas.g ⊢ G = n ∈ 0 ..^ N ⟼ x ∈ ℕ 0 ⟼ n
Assertion smndex1igidOLD ⊢ K ∈ 0 ..^ N → I ∘ G ⁡ K = G ⁡ K

Proof

Step Hyp Ref Expression
1 smndex1ibas.m ⊢ M = EndoFMnd ⁡ ℕ 0
2 smndex1ibas.n ⊢ N ∈ ℕ
3 smndex1ibas.i ⊢ I = x ∈ ℕ 0 ⟼ x mod N
4 smndex1ibas.g ⊢ G = n ∈ 0 ..^ N ⟼ x ∈ ℕ 0 ⟼ n
5 fconstmpt ⊢ ℕ 0 × K = x ∈ ℕ 0 ⟼ K
6 5 eqcomi ⊢ x ∈ ℕ 0 ⟼ K = ℕ 0 × K
7 6 a1i ⊢ K ∈ 0 ..^ N → x ∈ ℕ 0 ⟼ K = ℕ 0 × K
8 7 coeq2d ⊢ K ∈ 0 ..^ N → I ∘ x ∈ ℕ 0 ⟼ K = I ∘ ℕ 0 × K
9 simpl ⊢ n = K ∧ x ∈ ℕ 0 → n = K
10 9 mpteq2dva ⊢ n = K → x ∈ ℕ 0 ⟼ n = x ∈ ℕ 0 ⟼ K
11 nn0ex ⊢ ℕ 0 ∈ V
12 11 mptex ⊢ x ∈ ℕ 0 ⟼ K ∈ V
13 10 4 12 fvmpt ⊢ K ∈ 0 ..^ N → G ⁡ K = x ∈ ℕ 0 ⟼ K
14 13 coeq2d ⊢ K ∈ 0 ..^ N → I ∘ G ⁡ K = I ∘ x ∈ ℕ 0 ⟼ K
15 oveq1 ⊢ x = K → x mod N = K mod N
16 zmodidfzoimp ⊢ K ∈ 0 ..^ N → K mod N = K
17 15 16 sylan9eqr ⊢ K ∈ 0 ..^ N ∧ x = K → x mod N = K
18 elfzonn0 ⊢ K ∈ 0 ..^ N → K ∈ ℕ 0
19 3 17 18 18 fvmptd2 ⊢ K ∈ 0 ..^ N → I ⁡ K = K
20 19 eqcomd ⊢ K ∈ 0 ..^ N → K = I ⁡ K
21 20 sneqd ⊢ K ∈ 0 ..^ N → K = I ⁡ K
22 21 xpeq2d ⊢ K ∈ 0 ..^ N → ℕ 0 × K = ℕ 0 × I ⁡ K
23 13 6 eqtrdi ⊢ K ∈ 0 ..^ N → G ⁡ K = ℕ 0 × K
24 ovex ⊢ x mod N ∈ V
25 24 3 fnmpti ⊢ I Fn ℕ 0
26 fcoconst ⊢ I Fn ℕ 0 ∧ K ∈ ℕ 0 → I ∘ ℕ 0 × K = ℕ 0 × I ⁡ K
27 25 18 26 sylancr ⊢ K ∈ 0 ..^ N → I ∘ ℕ 0 × K = ℕ 0 × I ⁡ K
28 22 23 27 3eqtr4d ⊢ K ∈ 0 ..^ N → G ⁡ K = I ∘ ℕ 0 × K
29 8 14 28 3eqtr4d ⊢ K ∈ 0 ..^ N → I ∘ G ⁡ K = G ⁡ K