Metamath Proof Explorer


Theorem smndex1gbasOLD

Description: Obsolete version of smndex1gbas as of 2-Apr-2026. (Contributed by AV, 12-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 smndex1gbasOLD ⊢ K ∈ 0 ..^ N → G ⁡ K ∈ Base M

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 elfzonn0 ⊢ K ∈ 0 ..^ N → K ∈ ℕ 0
6 5 adantr ⊢ K ∈ 0 ..^ N ∧ x ∈ ℕ 0 → K ∈ ℕ 0
7 6 ralrimiva ⊢ K ∈ 0 ..^ N → ∀ x ∈ ℕ 0 K ∈ ℕ 0
8 eqid ⊢ x ∈ ℕ 0 ⟼ K = x ∈ ℕ 0 ⟼ K
9 8 fmpt ⊢ ∀ x ∈ ℕ 0 K ∈ ℕ 0 ↔ x ∈ ℕ 0 ⟼ K : ℕ 0 ⟶ ℕ 0
10 7 9 sylib ⊢ K ∈ 0 ..^ N → x ∈ ℕ 0 ⟼ K : ℕ 0 ⟶ ℕ 0
11 nn0ex ⊢ ℕ 0 ∈ V
12 11 11 elmap ⊢ x ∈ ℕ 0 ⟼ K ∈ ℕ 0 ℕ 0 ↔ x ∈ ℕ 0 ⟼ K : ℕ 0 ⟶ ℕ 0
13 10 12 sylibr ⊢ K ∈ 0 ..^ N → x ∈ ℕ 0 ⟼ K ∈ ℕ 0 ℕ 0
14 4 a1i ⊢ K ∈ 0 ..^ N → G = n ∈ 0 ..^ N ⟼ x ∈ ℕ 0 ⟼ n
15 id ⊢ n = K → n = K
16 15 mpteq2dv ⊢ n = K → x ∈ ℕ 0 ⟼ n = x ∈ ℕ 0 ⟼ K
17 16 adantl ⊢ K ∈ 0 ..^ N ∧ n = K → x ∈ ℕ 0 ⟼ n = x ∈ ℕ 0 ⟼ K
18 id ⊢ K ∈ 0 ..^ N → K ∈ 0 ..^ N
19 11 mptex ⊢ x ∈ ℕ 0 ⟼ K ∈ V
20 19 a1i ⊢ K ∈ 0 ..^ N → x ∈ ℕ 0 ⟼ K ∈ V
21 14 17 18 20 fvmptd ⊢ K ∈ 0 ..^ N → G ⁡ K = x ∈ ℕ 0 ⟼ K
22 eqid ⊢ Base M = Base M
23 1 22 efmndbas ⊢ Base M = ℕ 0 ℕ 0
24 23 a1i ⊢ K ∈ 0 ..^ N → Base M = ℕ 0 ℕ 0
25 13 21 24 3eltr4d ⊢ K ∈ 0 ..^ N → G ⁡ K ∈ Base M