| 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 5231. (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 5712 | . . . . 5 ⊢ (ℕ0 × {𝐾}) = (𝑥 ∈ ℕ0 ↦ 𝐾) | |
| 2 | 1 | eqcomi 2769 | . . . 4 ⊢ (𝑥 ∈ ℕ0 ↦ 𝐾) = (ℕ0 × {𝐾}) |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝑥 ∈ ℕ0 ↦ 𝐾) = (ℕ0 × {𝐾})) |
| 4 | 3 | coeq2d 5840 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝑥 ∈ ℕ0 ↦ 𝐾)) = (𝐼 ∘ (ℕ0 × {𝐾}))) |
| 5 | id 23 | . . . . 5 ⊢ (𝑛 = 𝐾 → 𝑛 = 𝐾) | |
| 6 | 5 | mpteq2dv 5198 | . . . 4 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ ℕ0 ↦ 𝑛) = (𝑥 ∈ ℕ0 ↦ 𝐾)) |
| 7 | smndex1ibas.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛)) | |
| 8 | nn0ex 12617 | . . . . . 6 ⊢ ℕ0 ∈ V | |
| 9 | snex 5396 | . . . . . 6 ⊢ {𝐾} ∈ V | |
| 10 | 8, 9 | xpex 7769 | . . . . 5 ⊢ (ℕ0 × {𝐾}) ∈ V |
| 11 | 1, 10 | eqeltrri 2857 | . . . 4 ⊢ (𝑥 ∈ ℕ0 ↦ 𝐾) ∈ V |
| 12 | 6, 7, 11 | fvmpt 6996 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (𝑥 ∈ ℕ0 ↦ 𝐾)) |
| 13 | 12 | coeq2d 5840 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝐾)) = (𝐼 ∘ (𝑥 ∈ ℕ0 ↦ 𝐾))) |
| 14 | smndex1ibas.i | . . . . . . 7 ⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁)) | |
| 15 | oveq1 7429 | . . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑥 mod 𝑁) = (𝐾 mod 𝑁)) | |
| 16 | zmodidfzoimp 14046 | . . . . . . . 8 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐾 mod 𝑁) = 𝐾) | |
| 17 | 15, 16 | sylan9eqr 2817 | . . . . . . 7 ⊢ ((𝐾 ∈ (0..^𝑁) ∧ 𝑥 = 𝐾) → (𝑥 mod 𝑁) = 𝐾) |
| 18 | elfzonn0 13847 | . . . . . . 7 ⊢ (𝐾 ∈ (0..^𝑁) → 𝐾 ∈ ℕ0) | |
| 19 | 14, 17, 18, 18 | fvmptd2 7005 | . . . . . 6 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼‘𝐾) = 𝐾) |
| 20 | 19 | eqcomd 2766 | . . . . 5 ⊢ (𝐾 ∈ (0..^𝑁) → 𝐾 = (𝐼‘𝐾)) |
| 21 | 20 | sneqd 4592 | . . . 4 ⊢ (𝐾 ∈ (0..^𝑁) → {𝐾} = {(𝐼‘𝐾)}) |
| 22 | 21 | xpeq2d 5680 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (ℕ0 × {𝐾}) = (ℕ0 × {(𝐼‘𝐾)})) |
| 23 | 12, 1 | eqtr4di 2813 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (ℕ0 × {𝐾})) |
| 24 | ovex 7455 | . . . . 5 ⊢ (𝑥 mod 𝑁) ∈ V | |
| 25 | 24, 14 | fnmpti 6685 | . . . 4 ⊢ 𝐼 Fn ℕ0 |
| 26 | fcoconst 7138 | . . . 4 ⊢ ((𝐼 Fn ℕ0 ∧ 𝐾 ∈ ℕ0) → (𝐼 ∘ (ℕ0 × {𝐾})) = (ℕ0 × {(𝐼‘𝐾)})) | |
| 27 | 25, 18, 26 | sylancr 599 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (ℕ0 × {𝐾})) = (ℕ0 × {(𝐼‘𝐾)})) |
| 28 | 22, 23, 27 | 3eqtr4d 2805 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (𝐼 ∘ (ℕ0 × {𝐾}))) |
| 29 | 4, 13, 28 | 3eqtr4d 2805 | 1 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝐾)) = (𝐺‘𝐾)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 Vcvv 3450 {csn 4584 ↦ cmpt 5185 × cxp 5648 ∘ ccom 5654 Fn wfn 6536 ‘cfv 6541 (class class class)co 7422 0cc0 11205 ℕcn 12340 ℕ0cn0 12611 ..^cfzo 13793 mod cmo 14014 EndoFMndcefmnd 19071 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 ax-pre-sup 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-1st 8003 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-er 8722 df-en 8979 df-dom 8980 df-sdom 8981 df-sup 9439 df-inf 9440 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-div 11979 df-nn 12341 df-n0 12612 df-z 12699 df-uz 12971 df-rp 13126 df-fz 13645 df-fzo 13794 df-fl 13937 df-mod 14015 |
| This theorem is used by: smndex1mgm 19113 smndex1mndlem 19115 |
| Copyright terms: Public domain | W3C validator |