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.) |
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 5607 | . . . . 5 ⊢ (ℕ0 × {𝐾}) = (𝑥 ∈ ℕ0 ↦ 𝐾) | |
2 | 1 | eqcomi 2829 | . . . 4 ⊢ (𝑥 ∈ ℕ0 ↦ 𝐾) = (ℕ0 × {𝐾}) |
3 | 2 | a1i 11 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝑥 ∈ ℕ0 ↦ 𝐾) = (ℕ0 × {𝐾})) |
4 | 3 | coeq2d 5726 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝑥 ∈ ℕ0 ↦ 𝐾)) = (𝐼 ∘ (ℕ0 × {𝐾}))) |
5 | simpl 485 | . . . . 5 ⊢ ((𝑛 = 𝐾 ∧ 𝑥 ∈ ℕ0) → 𝑛 = 𝐾) | |
6 | 5 | mpteq2dva 5154 | . . . 4 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ ℕ0 ↦ 𝑛) = (𝑥 ∈ ℕ0 ↦ 𝐾)) |
7 | smndex1ibas.g | . . . 4 ⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛)) | |
8 | nn0ex 11897 | . . . . 5 ⊢ ℕ0 ∈ V | |
9 | 8 | mptex 6979 | . . . 4 ⊢ (𝑥 ∈ ℕ0 ↦ 𝐾) ∈ V |
10 | 6, 7, 9 | fvmpt 6761 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (𝑥 ∈ ℕ0 ↦ 𝐾)) |
11 | 10 | coeq2d 5726 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝐾)) = (𝐼 ∘ (𝑥 ∈ ℕ0 ↦ 𝐾))) |
12 | smndex1ibas.i | . . . . . . 7 ⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁)) | |
13 | oveq1 7156 | . . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑥 mod 𝑁) = (𝐾 mod 𝑁)) | |
14 | zmodidfzoimp 13266 | . . . . . . . 8 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐾 mod 𝑁) = 𝐾) | |
15 | 13, 14 | sylan9eqr 2877 | . . . . . . 7 ⊢ ((𝐾 ∈ (0..^𝑁) ∧ 𝑥 = 𝐾) → (𝑥 mod 𝑁) = 𝐾) |
16 | elfzonn0 13079 | . . . . . . 7 ⊢ (𝐾 ∈ (0..^𝑁) → 𝐾 ∈ ℕ0) | |
17 | 12, 15, 16, 16 | fvmptd2 6769 | . . . . . 6 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼‘𝐾) = 𝐾) |
18 | 17 | eqcomd 2826 | . . . . 5 ⊢ (𝐾 ∈ (0..^𝑁) → 𝐾 = (𝐼‘𝐾)) |
19 | 18 | sneqd 4572 | . . . 4 ⊢ (𝐾 ∈ (0..^𝑁) → {𝐾} = {(𝐼‘𝐾)}) |
20 | 19 | xpeq2d 5578 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (ℕ0 × {𝐾}) = (ℕ0 × {(𝐼‘𝐾)})) |
21 | 10, 2 | syl6eq 2871 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (ℕ0 × {𝐾})) |
22 | ovex 7182 | . . . . 5 ⊢ (𝑥 mod 𝑁) ∈ V | |
23 | 22, 12 | fnmpti 6484 | . . . 4 ⊢ 𝐼 Fn ℕ0 |
24 | fcoconst 6889 | . . . 4 ⊢ ((𝐼 Fn ℕ0 ∧ 𝐾 ∈ ℕ0) → (𝐼 ∘ (ℕ0 × {𝐾})) = (ℕ0 × {(𝐼‘𝐾)})) | |
25 | 23, 16, 24 | sylancr 589 | . . 3 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (ℕ0 × {𝐾})) = (ℕ0 × {(𝐼‘𝐾)})) |
26 | 20, 21, 25 | 3eqtr4d 2865 | . 2 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐺‘𝐾) = (𝐼 ∘ (ℕ0 × {𝐾}))) |
27 | 4, 11, 26 | 3eqtr4d 2865 | 1 ⊢ (𝐾 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝐾)) = (𝐺‘𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 {csn 4560 ↦ cmpt 5139 × cxp 5546 ∘ ccom 5552 Fn wfn 6343 ‘cfv 6348 (class class class)co 7149 0cc0 10530 ℕcn 11631 ℕ0cn0 11891 ..^cfzo 13030 mod cmo 13234 EndoFMndcefmnd 18026 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 ax-cnex 10586 ax-resscn 10587 ax-1cn 10588 ax-icn 10589 ax-addcl 10590 ax-addrcl 10591 ax-mulcl 10592 ax-mulrcl 10593 ax-mulcom 10594 ax-addass 10595 ax-mulass 10596 ax-distr 10597 ax-i2m1 10598 ax-1ne0 10599 ax-1rid 10600 ax-rnegex 10601 ax-rrecex 10602 ax-cnre 10603 ax-pre-lttri 10604 ax-pre-lttrn 10605 ax-pre-ltadd 10606 ax-pre-mulgt0 10607 ax-pre-sup 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-reu 3144 df-rmo 3145 df-rab 3146 df-v 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-pss 3947 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7107 df-ov 7152 df-oprab 7153 df-mpo 7154 df-om 7574 df-1st 7682 df-2nd 7683 df-wrecs 7940 df-recs 8001 df-rdg 8039 df-er 8282 df-en 8503 df-dom 8504 df-sdom 8505 df-sup 8899 df-inf 8900 df-pnf 10670 df-mnf 10671 df-xr 10672 df-ltxr 10673 df-le 10674 df-sub 10865 df-neg 10866 df-div 11291 df-nn 11632 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-fz 12890 df-fzo 13031 df-fl 13159 df-mod 13235 |
This theorem is referenced by: smndex1mgm 18065 smndex1mndlem 18067 |
Copyright terms: Public domain | W3C validator |