| 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 18728) 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 7420 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐿 + 𝑥) = (𝐿 + 𝑦)) | |
| 7 | id 23 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
| 8 | 6, 7 | eqeq12d 2779 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐿 + 𝑥) = 𝑥 ↔ (𝐿 + 𝑦) = 𝑦)) |
| 9 | 8 | rspcv 3578 | . . 3 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥 → (𝐿 + 𝑦) = 𝑦)) |
| 10 | 5, 9 | mpan9 515 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐿 + 𝑦) = 𝑦) |
| 11 | lidrideqd.ri | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥) | |
| 12 | lidrideqd.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐵) | |
| 13 | 4, 12, 5, 11 | lidrideqd 18728 | . . . 4 ⊢ (𝜑 → 𝐿 = 𝑅) |
| 14 | oveq1 7419 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 + 𝑅) = (𝑦 + 𝑅)) | |
| 15 | 14, 7 | eqeq12d 2779 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑥 + 𝑅) = 𝑥 ↔ (𝑦 + 𝑅) = 𝑦)) |
| 16 | 15 | rspcv 3578 | . . . . . 6 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝑦 + 𝑅) = 𝑦)) |
| 17 | oveq2 7420 | . . . . . . . . 9 ⊢ (𝐿 = 𝑅 → (𝑦 + 𝐿) = (𝑦 + 𝑅)) | |
| 18 | 17 | adantl 486 | . . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝐿) = (𝑦 + 𝑅)) |
| 19 | simpl 487 | . . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝑅) = 𝑦) | |
| 20 | 18, 19 | eqtrd 2798 | . . . . . . 7 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝐿) = 𝑦) |
| 21 | 20 | ex 417 | . . . . . 6 ⊢ ((𝑦 + 𝑅) = 𝑦 → (𝐿 = 𝑅 → (𝑦 + 𝐿) = 𝑦)) |
| 22 | 16, 21 | syl6com 38 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝑦 ∈ 𝐵 → (𝐿 = 𝑅 → (𝑦 + 𝐿) = 𝑦))) |
| 23 | 22 | com23 87 | . . . 4 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝐿 = 𝑅 → (𝑦 ∈ 𝐵 → (𝑦 + 𝐿) = 𝑦))) |
| 24 | 11, 13, 23 | sylc 66 | . . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → (𝑦 + 𝐿) = 𝑦)) |
| 25 | 24 | imp 411 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦 + 𝐿) = 𝑦) |
| 26 | 1, 2, 3, 4, 10, 25 | ismgmid2 18727 | 1 ⊢ (𝜑 → 𝐿 = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 +gcplusg 17311 0gc0g 17493 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6494 df-fun 6540 df-fv 6546 df-riota 7369 df-ov 7415 df-0g 17495 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |