| 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 18787 | . . . . 5 ⊢ 𝐵 = (𝐴 ↑m 𝐴) |
| 4 | eqid 2733 | . . . . 5 ⊢ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) | |
| 5 | eqid 2733 | . . . . 5 ⊢ (∏t‘(𝐴 × {𝒫 𝐴})) = (∏t‘(𝐴 × {𝒫 𝐴})) | |
| 6 | 1, 3, 4, 5 | efmnd 18786 | . . . 4 ⊢ (𝐴 ∈ V → 𝐺 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉}) |
| 7 | 6 | fveq2d 6835 | . . 3 ⊢ (𝐴 ∈ V → (+g‘𝐺) = (+g‘{〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉})) |
| 8 | efmndplusg.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 9 | 2 | fvexi 6845 | . . . . 5 ⊢ 𝐵 ∈ V |
| 10 | 9, 9 | mpoex 8020 | . . . 4 ⊢ (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) ∈ V |
| 11 | eqid 2733 | . . . . 5 ⊢ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉} = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))〉, 〈(TopSet‘ndx), (∏t‘(𝐴 × {𝒫 𝐴}))〉} | |
| 12 | 11 | topgrpplusg 17274 | . . . 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 2793 | . 2 ⊢ (𝐴 ∈ V → + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))) |
| 15 | fvprc 6823 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V → (EndoFMnd‘𝐴) = ∅) | |
| 16 | 1, 15 | eqtrid 2780 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → 𝐺 = ∅) |
| 17 | 16 | fveq2d 6835 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (+g‘𝐺) = (+g‘∅)) |
| 18 | plusgid 17195 | . . . . 5 ⊢ +g = Slot (+g‘ndx) | |
| 19 | 18 | str0 17107 | . . . 4 ⊢ ∅ = (+g‘∅) |
| 20 | 17, 8, 19 | 3eqtr4g 2793 | . . 3 ⊢ (¬ 𝐴 ∈ V → + = ∅) |
| 21 | 16 | fveq2d 6835 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V → (Base‘𝐺) = (Base‘∅)) |
| 22 | base0 17132 | . . . . . 6 ⊢ ∅ = (Base‘∅) | |
| 23 | 21, 2, 22 | 3eqtr4g 2793 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → 𝐵 = ∅) |
| 24 | 23 | olcd 874 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅)) |
| 25 | 0mpo0 7438 | . . . 4 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = ∅) | |
| 26 | 24, 25 | syl 17 | . . 3 ⊢ (¬ 𝐴 ∈ V → (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) = ∅) |
| 27 | 20, 26 | eqtr4d 2771 | . 2 ⊢ (¬ 𝐴 ∈ V → + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔))) |
| 28 | 14, 27 | pm2.61i 182 | 1 ⊢ + = (𝑓 ∈ 𝐵, 𝑔 ∈ 𝐵 ↦ (𝑓 ∘ 𝑔)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∨ wo 847 = wceq 1541 ∈ wcel 2113 Vcvv 3437 ∅c0 4282 𝒫 cpw 4551 {csn 4577 {ctp 4581 〈cop 4583 × cxp 5619 ∘ ccom 5625 ‘cfv 6489 ∈ cmpo 7357 ndxcnx 17111 Basecbs 17127 +gcplusg 17168 TopSetcts 17174 ∏tcpt 17349 EndoFMndcefmnd 18784 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8631 df-map 8761 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-nn 12137 df-2 12199 df-3 12200 df-4 12201 df-5 12202 df-6 12203 df-7 12204 df-8 12205 df-9 12206 df-n0 12393 df-z 12480 df-uz 12743 df-fz 13415 df-struct 17065 df-slot 17100 df-ndx 17112 df-base 17128 df-plusg 17181 df-tset 17187 df-efmnd 18785 |
| This theorem is referenced by: efmndov 18797 submefmnd 18811 symgplusg 19303 efmndtmd 24036 |
| Copyright terms: Public domain | W3C validator |