| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > smndex1igid | Structured version Visualization version GIF version | ||
| Description: The composition of the modulo function 𝐼 and a constant function (𝐺‘𝐾) results in (𝐺‘𝐾) itself. (Contributed by AV, 14-Feb-2024.) Avoid ax-rep 5224. (Revised by GG, 2-Apr-2026.) |
| Ref | Expression |
|---|---|
| smndex1ibas.m | ⊢ 𝑀 = (EndoFMnd‘ℕ0) |
| smndex1ibas.n | ⊢ 𝑁 ∈ ℕ |
| smndex1ibas.i | ⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁)) |
| smndex1ibas.g | ⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛)) |
| Ref | Expression |
|---|---|
| smndex1igid | ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝐾)) = (𝐺‘𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fconstmpt 5705 | . . . . 5 ⊢ (ℕ0 × {𝐾}) = (𝑥 ∈ ℕ0 ↦ 𝐾) | |
| 2 | 1 | eqcomi 2770 | . . . 4 ⊢ (𝑥 ∈ ℕ0 ↦ 𝐾) = (ℕ0 × {𝐾}) |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝑥 ∈ ℕ0 ↦ 𝐾) = (ℕ0 × {𝐾})) |
| 4 | 3 | coeq2d 5830 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝑥 ∈ ℕ0 ↦ 𝐾)) = (𝐼 ∘ (ℕ0 × {𝐾}))) |
| 5 | id 22 | . . . . 5 ⊢ (𝑛 = 𝐾 → 𝑛 = 𝐾) | |
| 6 | 5 | mpteq2dv 5191 | . . . 4 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ ℕ0 ↦ 𝑛) = (𝑥 ∈ ℕ0 ↦ 𝐾)) |
| 7 | smndex1ibas.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛)) | |
| 8 | nn0ex 12481 | . . . . . 6 ⊢ ℕ0 ∈ V | |
| 9 | snex 5393 | . . . . . 6 ⊢ {𝐾} ∈ V | |
| 10 | 8, 9 | xpex 7731 | . . . . 5 ⊢ (ℕ0 × {𝐾}) ∈ V |
| 11 | 1, 10 | eqeltrri 2858 | . . . 4 ⊢ (𝑥 ∈ ℕ0 ↦ 𝐾) ∈ V |
| 12 | 6, 7, 11 | fvmpt 6970 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (𝑥 ∈ ℕ0 ↦ 𝐾)) |
| 13 | 12 | coeq2d 5830 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝐾)) = (𝐼 ∘ (𝑥 ∈ ℕ0 ↦ 𝐾))) |
| 14 | smndex1ibas.i | . . . . . . 7 ⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁)) | |
| 15 | oveq1 7398 | . . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑥 mod 𝑁) = (𝐾 mod 𝑁)) | |
| 16 | zmodidfzoimp 13905 | . . . . . . . 8 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐾 mod 𝑁) = 𝐾) | |
| 17 | 15, 16 | sylan9eqr 2818 | . . . . . . 7 ⊢ ((𝐾 ∈ (0..^𝑁) ∧ 𝑥 = 𝐾) → (𝑥 mod 𝑁) = 𝐾) |
| 18 | elfzonn0 13707 | . . . . . . 7 ⊢ (𝐾 ∈ (0..^𝑁) → 𝐾 ∈ ℕ0) | |
| 19 | 14, 17, 18, 18 | fvmptd2 6979 | . . . . . 6 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼‘𝐾) = 𝐾) |
| 20 | 19 | eqcomd 2767 | . . . . 5 ⊢ (𝐾 ∈ (0..^𝑁) → 𝐾 = (𝐼‘𝐾)) |
| 21 | 20 | sneqd 4591 | . . . 4 ⊢ (𝐾 ∈ (0..^𝑁) → {𝐾} = {(𝐼‘𝐾)}) |
| 22 | 21 | xpeq2d 5673 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (ℕ0 × {𝐾}) = (ℕ0 × {(𝐼‘𝐾)})) |
| 23 | 12, 1 | eqtr4di 2814 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (ℕ0 × {𝐾})) |
| 24 | ovex 7424 | . . . . 5 ⊢ (𝑥 mod 𝑁) ∈ V | |
| 25 | 24, 14 | fnmpti 6659 | . . . 4 ⊢ 𝐼 Fn ℕ0 |
| 26 | fcoconst 7111 | . . . 4 ⊢ ((𝐼 Fn ℕ0 ∧ 𝐾 ∈ ℕ0) → (𝐼 ∘ (ℕ0 × {𝐾})) = (ℕ0 × {(𝐼‘𝐾)})) | |
| 27 | 25, 18, 26 | sylancr 596 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (ℕ0 × {𝐾})) = (ℕ0 × {(𝐼‘𝐾)})) |
| 28 | 22, 23, 27 | 3eqtr4d 2806 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (𝐼 ∘ (ℕ0 × {𝐾}))) |
| 29 | 4, 13, 28 | 3eqtr4d 2806 | 1 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝐾)) = (𝐺‘𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 Vcvv 3453 {csn 4579 ↦ cmpt 5178 × cxp 5641 ∘ ccom 5647 Fn wfn 6511 ‘cfv 6516 (class class class)co 7391 0cc0 11067 ℕcn 12204 ℕ0cn0 12475 ..^cfzo 13653 mod cmo 13873 EndoFMndcefmnd 18893 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9382 df-inf 9383 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-n0 12476 df-z 12563 df-uz 12834 df-rp 12988 df-fz 13507 df-fzo 13654 df-fl 13796 df-mod 13874 |
| This theorem is referenced by: smndex1mgm 18935 smndex1mndlem 18937 |
| Copyright terms: Public domain | W3C validator |