| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lidrididd | Structured version Visualization version GIF version | ||
| Description: If there is a left and right identity element for any binary operation (group operation) +, the left identity element (and therefore also the right identity element according to lidrideqd 18635) is equal to the two-sided identity element. (Contributed by AV, 26-Dec-2023.) |
| Ref | Expression |
|---|---|
| lidrideqd.l | ⊢ (𝜑 → 𝐿 ∈ 𝐵) |
| lidrideqd.r | ⊢ (𝜑 → 𝑅 ∈ 𝐵) |
| lidrideqd.li | ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥) |
| lidrideqd.ri | ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥) |
| lidrideqd.b | ⊢ 𝐵 = (Base‘𝐺) |
| lidrideqd.p | ⊢ + = (+g‘𝐺) |
| lidrididd.o | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| lidrididd | ⊢ (𝜑 → 𝐿 = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lidrideqd.b | . 2 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | lidrididd.o | . 2 ⊢ 0 = (0g‘𝐺) | |
| 3 | lidrideqd.p | . 2 ⊢ + = (+g‘𝐺) | |
| 4 | lidrideqd.l | . 2 ⊢ (𝜑 → 𝐿 ∈ 𝐵) | |
| 5 | lidrideqd.li | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥) | |
| 6 | oveq2 7371 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐿 + 𝑥) = (𝐿 + 𝑦)) | |
| 7 | id 22 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
| 8 | 6, 7 | eqeq12d 2756 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐿 + 𝑥) = 𝑥 ↔ (𝐿 + 𝑦) = 𝑦)) |
| 9 | 8 | rspcv 3563 | . . 3 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥 → (𝐿 + 𝑦) = 𝑦)) |
| 10 | 5, 9 | mpan9 511 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐿 + 𝑦) = 𝑦) |
| 11 | lidrideqd.ri | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥) | |
| 12 | lidrideqd.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐵) | |
| 13 | 4, 12, 5, 11 | lidrideqd 18635 | . . . 4 ⊢ (𝜑 → 𝐿 = 𝑅) |
| 14 | oveq1 7370 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 + 𝑅) = (𝑦 + 𝑅)) | |
| 15 | 14, 7 | eqeq12d 2756 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑥 + 𝑅) = 𝑥 ↔ (𝑦 + 𝑅) = 𝑦)) |
| 16 | 15 | rspcv 3563 | . . . . . 6 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝑦 + 𝑅) = 𝑦)) |
| 17 | oveq2 7371 | . . . . . . . . 9 ⊢ (𝐿 = 𝑅 → (𝑦 + 𝐿) = (𝑦 + 𝑅)) | |
| 18 | 17 | adantl 482 | . . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝐿) = (𝑦 + 𝑅)) |
| 19 | simpl 483 | . . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝑅) = 𝑦) | |
| 20 | 18, 19 | eqtrd 2775 | . . . . . . 7 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝐿) = 𝑦) |
| 21 | 20 | ex 413 | . . . . . 6 ⊢ ((𝑦 + 𝑅) = 𝑦 → (𝐿 = 𝑅 → (𝑦 + 𝐿) = 𝑦)) |
| 22 | 16, 21 | syl6com 37 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝑦 ∈ 𝐵 → (𝐿 = 𝑅 → (𝑦 + 𝐿) = 𝑦))) |
| 23 | 22 | com23 86 | . . . 4 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝐿 = 𝑅 → (𝑦 ∈ 𝐵 → (𝑦 + 𝐿) = 𝑦))) |
| 24 | 11, 13, 23 | sylc 65 | . . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → (𝑦 + 𝐿) = 𝑦)) |
| 25 | 24 | imp 407 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦 + 𝐿) = 𝑦) |
| 26 | 1, 2, 3, 4, 10, 25 | ismgmid2 18634 | 1 ⊢ (𝜑 → 𝐿 = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3054 ‘cfv 6492 (class class class)co 7363 Basecbs 17177 +gcplusg 17218 0gc0g 17400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6448 df-fun 6494 df-fv 6500 df-riota 7320 df-ov 7366 df-0g 17402 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |