| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > smndex1basss | Structured version Visualization version GIF version | ||
| Description: The modulo function 𝐼 and the constant functions (𝐺‘𝐾) are endofunctions on ℕ0. (Contributed by AV, 12-Feb-2024.) |
| Ref | Expression |
|---|---|
| smndex1ibas.m | ⊢ 𝑀 = (EndoFMnd‘ℕ0) |
| smndex1ibas.n | ⊢ 𝑁 ∈ ℕ |
| smndex1ibas.i | ⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁)) |
| smndex1ibas.g | ⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛)) |
| smndex1mgm.b | ⊢ 𝐵 = ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) |
| Ref | Expression |
|---|---|
| smndex1basss | ⊢ 𝐵 ⊆ (Base‘𝑀) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | smndex1mgm.b | . . . . . 6 ⊢ 𝐵 = ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) | |
| 2 | 1 | eleq2i 2820 | . . . . 5 ⊢ (𝑏 ∈ 𝐵 ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)})) |
| 3 | fveq2 6840 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝐺‘𝑛) = (𝐺‘𝑘)) | |
| 4 | 3 | sneqd 4597 | . . . . . . . 8 ⊢ (𝑛 = 𝑘 → {(𝐺‘𝑛)} = {(𝐺‘𝑘)}) |
| 5 | 4 | cbviunv 4999 | . . . . . . 7 ⊢ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)} = ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} |
| 6 | 5 | uneq2i 4124 | . . . . . 6 ⊢ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) = ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) |
| 7 | 6 | eleq2i 2820 | . . . . 5 ⊢ (𝑏 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)})) |
| 8 | 2, 7 | bitri 275 | . . . 4 ⊢ (𝑏 ∈ 𝐵 ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)})) |
| 9 | elun 4112 | . . . 4 ⊢ (𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑏 ∈ {𝐼} ∨ 𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)})) | |
| 10 | velsn 4601 | . . . . 5 ⊢ (𝑏 ∈ {𝐼} ↔ 𝑏 = 𝐼) | |
| 11 | eliun 4955 | . . . . 5 ⊢ (𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)}) | |
| 12 | 10, 11 | orbi12i 914 | . . . 4 ⊢ ((𝑏 ∈ {𝐼} ∨ 𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)})) |
| 13 | 8, 9, 12 | 3bitri 297 | . . 3 ⊢ (𝑏 ∈ 𝐵 ↔ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)})) |
| 14 | smndex1ibas.m | . . . . . 6 ⊢ 𝑀 = (EndoFMnd‘ℕ0) | |
| 15 | smndex1ibas.n | . . . . . 6 ⊢ 𝑁 ∈ ℕ | |
| 16 | smndex1ibas.i | . . . . . 6 ⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁)) | |
| 17 | 14, 15, 16 | smndex1ibas 18809 | . . . . 5 ⊢ 𝐼 ∈ (Base‘𝑀) |
| 18 | eleq1 2816 | . . . . 5 ⊢ (𝑏 = 𝐼 → (𝑏 ∈ (Base‘𝑀) ↔ 𝐼 ∈ (Base‘𝑀))) | |
| 19 | 17, 18 | mpbiri 258 | . . . 4 ⊢ (𝑏 = 𝐼 → 𝑏 ∈ (Base‘𝑀)) |
| 20 | smndex1ibas.g | . . . . . . . 8 ⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛)) | |
| 21 | 14, 15, 16, 20 | smndex1gbas 18811 | . . . . . . 7 ⊢ (𝑘 ∈ (0..^𝑁) → (𝐺‘𝑘) ∈ (Base‘𝑀)) |
| 22 | 21 | adantr 480 | . . . . . 6 ⊢ ((𝑘 ∈ (0..^𝑁) ∧ 𝑏 ∈ {(𝐺‘𝑘)}) → (𝐺‘𝑘) ∈ (Base‘𝑀)) |
| 23 | elsni 4602 | . . . . . . . 8 ⊢ (𝑏 ∈ {(𝐺‘𝑘)} → 𝑏 = (𝐺‘𝑘)) | |
| 24 | 23 | eleq1d 2813 | . . . . . . 7 ⊢ (𝑏 ∈ {(𝐺‘𝑘)} → (𝑏 ∈ (Base‘𝑀) ↔ (𝐺‘𝑘) ∈ (Base‘𝑀))) |
| 25 | 24 | adantl 481 | . . . . . 6 ⊢ ((𝑘 ∈ (0..^𝑁) ∧ 𝑏 ∈ {(𝐺‘𝑘)}) → (𝑏 ∈ (Base‘𝑀) ↔ (𝐺‘𝑘) ∈ (Base‘𝑀))) |
| 26 | 22, 25 | mpbird 257 | . . . . 5 ⊢ ((𝑘 ∈ (0..^𝑁) ∧ 𝑏 ∈ {(𝐺‘𝑘)}) → 𝑏 ∈ (Base‘𝑀)) |
| 27 | 26 | rexlimiva 3126 | . . . 4 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)} → 𝑏 ∈ (Base‘𝑀)) |
| 28 | 19, 27 | jaoi 857 | . . 3 ⊢ ((𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)}) → 𝑏 ∈ (Base‘𝑀)) |
| 29 | 13, 28 | sylbi 217 | . 2 ⊢ (𝑏 ∈ 𝐵 → 𝑏 ∈ (Base‘𝑀)) |
| 30 | 29 | ssriv 3947 | 1 ⊢ 𝐵 ⊆ (Base‘𝑀) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 ∪ cun 3909 ⊆ wss 3911 {csn 4585 ∪ ciun 4951 ↦ cmpt 5183 ‘cfv 6499 (class class class)co 7369 0cc0 11044 ℕcn 12162 ℕ0cn0 12418 ..^cfzo 13591 mod cmo 13807 Basecbs 17155 EndoFMndcefmnd 18777 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9369 df-inf 9370 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-9 12232 df-n0 12419 df-z 12506 df-uz 12770 df-rp 12928 df-fz 13445 df-fzo 13592 df-fl 13730 df-mod 13808 df-struct 17093 df-slot 17128 df-ndx 17140 df-base 17156 df-plusg 17209 df-tset 17215 df-efmnd 18778 |
| This theorem is referenced by: smndex1bas 18815 smndex1mgm 18816 smndex1sgrp 18817 smndex1mnd 18819 smndex1id 18820 |
| Copyright terms: Public domain | W3C validator |