| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > efmndplusg | Structured version Visualization version GIF version | ||
| Description: The group operation of a monoid of endofunctions is the function composition. (Contributed by AV, 27-Jan-2024.) |
| Ref | Expression |
|---|---|
| efmndtset.g | ⊢ 𝐺 = (EndoFMnd‘𝐴) |
| efmndplusg.b | ⊢ 𝐵 = (Base‘𝐺) |
| efmndplusg.p | ⊢ + = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| efmndplusg | ⊢ + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | efmndtset.g | . . . . 5 ⊢ 𝐺 = (EndoFMnd‘𝐴) | |
| 2 | efmndplusg.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | 1, 2 | efmndbas 18896 | . . . . 5 ⊢ 𝐵 = (𝐴 ↑m 𝐴) |
| 4 | eqid 2761 | . . . . 5 ⊢ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) | |
| 5 | eqid 2761 | . . . . 5 ⊢ (∏t‘(𝐴 × {𝒫 𝐴})) = (∏t‘(𝐴 × {𝒫 𝐴})) | |
| 6 | 1, 3, 4, 5 | efmnd 18895 | . . . 4 ⊢ (𝐴 ∈ V → 𝐺 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉}) |
| 7 | 6 | fveq2d 6866 | . . 3 ⊢ (𝐴 ∈ V → (+g‘𝐺) = (+g‘{〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉})) |
| 8 | efmndplusg.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 9 | 2 | fvexi 6876 | . . . . 5 ⊢ 𝐵 ∈ V |
| 10 | 9, 9 | mpoex 8055 | . . . 4 ⊢ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) ∈ V |
| 11 | eqid 2761 | . . . . 5 ⊢ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉} = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉} | |
| 12 | 11 | topgrpplusg 17383 | . . . 4 ⊢ ((𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) ∈ V → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = (+g‘{〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉})) |
| 13 | 10, 12 | ax-mp 5 | . . 3 ⊢ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = (+g‘{〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉}) |
| 14 | 7, 8, 13 | 3eqtr4g 2821 | . 2 ⊢ (𝐴 ∈ V → + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))) |
| 15 | fvprc 6854 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V → (EndoFMnd‘𝐴) = ∅) | |
| 16 | 1, 15 | eqtrid 2808 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → 𝐺 = ∅) |
| 17 | 16 | fveq2d 6866 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (+g‘𝐺) = (+g‘∅)) |
| 18 | plusgid 17304 | . . . . 5 ⊢ +g = Slot (+g‘ndx) | |
| 19 | 18 | str0 17216 | . . . 4 ⊢ ∅ = (+g‘∅) |
| 20 | 17, 8, 19 | 3eqtr4g 2821 | . . 3 ⊢ (¬ 𝐴 ∈ V → + = ∅) |
| 21 | 16 | fveq2d 6866 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V → (Base‘𝐺) = (Base‘∅)) |
| 22 | base0 17241 | . . . . . 6 ⊢ ∅ = (Base‘∅) | |
| 23 | 21, 2, 22 | 3eqtr4g 2821 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → 𝐵 = ∅) |
| 24 | 23 | olcd 885 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅)) |
| 25 | 0mpo0 7474 | . . . 4 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = ∅) | |
| 26 | 24, 25 | syl 17 | . . 3 ⊢ (¬ 𝐴 ∈ V → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = ∅) |
| 27 | 20, 26 | eqtr4d 2799 | . 2 ⊢ (¬ 𝐴 ∈ V → + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))) |
| 28 | 14, 27 | pm2.61i 183 | 1 ⊢ + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∨ wo 858 = wceq 1559 ∈ wcel 2141 Vcvv 3453 ∅c0 4283 𝒫 cpw 4552 {csn 4579 {ctp 4583 〈cop 4585 × cxp 5641 ∘ ccom 5647 ‘cfv 6516 ∈ cmpo 7393 ndxcnx 17220 Basecbs 17236 +gcplusg 17277 TopSetcts 17283 ∏tcpt 17458 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-rep 5224 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 |
| 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-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-tp 4584 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-1o 8431 df-er 8672 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-4 12276 df-5 12277 df-6 12278 df-7 12279 df-8 12280 df-9 12281 df-n0 12476 df-z 12563 df-uz 12834 df-fz 13507 df-struct 17174 df-slot 17209 df-ndx 17221 df-base 17237 df-plusg 17290 df-tset 17296 df-efmnd 18894 |
| This theorem is referenced by: efmndov 18906 submefmnd 18920 symgplusg 19414 efmndtmd 24149 |
| Copyright terms: Public domain | W3C validator |