| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mnd1id | Structured version Visualization version GIF version | ||
| Description: The singleton element of a trivial monoid is its identity element. (Contributed by FL, 21-Jun-2010.) (Revised by AV, 23-Jan-2020.) |
| Ref | Expression |
|---|---|
| mnd1.m | ⊢ 𝑀 = {〈(Base‘ndx), {𝐼}〉, 〈(+g‘ndx), {〈〈𝐼, 𝐼〉, 𝐼〉}〉} |
| Ref | Expression |
|---|---|
| mnd1id | ⊢ (𝐼 ∈ 𝑉 → (0g‘𝑀) = 𝐼) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snex 5397 | . . . 4 ⊢ {𝐼} ∈ V | |
| 2 | mnd1.m | . . . . 5 ⊢ 𝑀 = {〈(Base‘ndx), {𝐼}〉, 〈(+g‘ndx), {〈〈𝐼, 𝐼〉, 𝐼〉}〉} | |
| 3 | 2 | grpbase 17453 | . . . 4 ⊢ ({𝐼} ∈ V → {𝐼} = (Base‘𝑀)) |
| 4 | 1, 3 | ax-mp 5 | . . 3 ⊢ {𝐼} = (Base‘𝑀) |
| 5 | eqid 2761 | . . 3 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 6 | snex 5397 | . . . 4 ⊢ {〈〈𝐼, 𝐼〉, 𝐼〉} ∈ V | |
| 7 | 2 | grpplusg 17454 | . . . 4 ⊢ ({〈〈𝐼, 𝐼〉, 𝐼〉} ∈ V → {〈〈𝐼, 𝐼〉, 𝐼〉} = (+g‘𝑀)) |
| 8 | 6, 7 | ax-mp 5 | . . 3 ⊢ {〈〈𝐼, 𝐼〉, 𝐼〉} = (+g‘𝑀) |
| 9 | snidg 4621 | . . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐼 ∈ {𝐼}) | |
| 10 | velsn 4600 | . . . . 5 ⊢ (𝑎 ∈ {𝐼} ↔ 𝑎 = 𝐼) | |
| 11 | df-ov 7421 | . . . . . . 7 ⊢ (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = ({〈〈𝐼, 𝐼〉, 𝐼〉}‘〈𝐼, 𝐼〉) | |
| 12 | opex 5432 | . . . . . . . 8 ⊢ 〈𝐼, 𝐼〉 ∈ V | |
| 13 | fvsng 7183 | . . . . . . . 8 ⊢ ((〈𝐼, 𝐼〉 ∈ V ∧ 𝐼 ∈ 𝑉) → ({〈〈𝐼, 𝐼〉, 𝐼〉}‘〈𝐼, 𝐼〉) = 𝐼) | |
| 14 | 12, 13 | mpan 703 | . . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → ({〈〈𝐼, 𝐼〉, 𝐼〉}‘〈𝐼, 𝐼〉) = 𝐼) |
| 15 | 11, 14 | eqtrid 2808 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = 𝐼) |
| 16 | oveq2 7426 | . . . . . . 7 ⊢ (𝑎 = 𝐼 → (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝑎) = (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼)) | |
| 17 | id 23 | . . . . . . 7 ⊢ (𝑎 = 𝐼 → 𝑎 = 𝐼) | |
| 18 | 16, 17 | eqeq12d 2777 | . . . . . 6 ⊢ (𝑎 = 𝐼 → ((𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝑎) = 𝑎 ↔ (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = 𝐼)) |
| 19 | 15, 18 | syl5ibrcom 250 | . . . . 5 ⊢ (𝐼 ∈ 𝑉 → (𝑎 = 𝐼 → (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝑎) = 𝑎)) |
| 20 | 10, 19 | biimtrid 245 | . . . 4 ⊢ (𝐼 ∈ 𝑉 → (𝑎 ∈ {𝐼} → (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝑎) = 𝑎)) |
| 21 | 20 | imp 412 | . . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑎 ∈ {𝐼}) → (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝑎) = 𝑎) |
| 22 | oveq1 7425 | . . . . . . 7 ⊢ (𝑎 = 𝐼 → (𝑎{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼)) | |
| 23 | 22, 17 | eqeq12d 2777 | . . . . . 6 ⊢ (𝑎 = 𝐼 → ((𝑎{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = 𝑎 ↔ (𝐼{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = 𝐼)) |
| 24 | 15, 23 | syl5ibrcom 250 | . . . . 5 ⊢ (𝐼 ∈ 𝑉 → (𝑎 = 𝐼 → (𝑎{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = 𝑎)) |
| 25 | 10, 24 | biimtrid 245 | . . . 4 ⊢ (𝐼 ∈ 𝑉 → (𝑎 ∈ {𝐼} → (𝑎{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = 𝑎)) |
| 26 | 25 | imp 412 | . . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑎 ∈ {𝐼}) → (𝑎{〈〈𝐼, 𝐼〉, 𝐼〉}𝐼) = 𝑎) |
| 27 | 4, 5, 8, 9, 21, 26 | ismgmid2 18842 | . 2 ⊢ (𝐼 ∈ 𝑉 → 𝐼 = (0g‘𝑀)) |
| 28 | 27 | eqcomd 2767 | 1 ⊢ (𝐼 ∈ 𝑉 → (0g‘𝑀) = 𝐼) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 {csn 4584 {cpr 4586 〈cop 4590 ‘cfv 6537 (class class class)co 7418 ndxcnx 17364 Basecbs 17380 +gcplusg 17421 0gc0g 17603 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-n0 12600 df-z 12687 df-uz 12959 df-fz 13633 df-struct 17318 df-slot 17353 df-ndx 17365 df-base 17381 df-plusg 17434 df-0g 17605 |
| This theorem is used by: grp1 19250 |
| Copyright terms: Public domain | W3C validator |