| 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 18715) 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 7408 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝐿 + 𝑥) = (𝐿 + 𝑦)) | |
| 7 | id 23 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
| 8 | 6, 7 | eqeq12d 2781 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝐿 + 𝑥) = 𝑥 ↔ (𝐿 + 𝑦) = 𝑦)) |
| 9 | 8 | rspcv 3580 | . . 3 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥 → (𝐿 + 𝑦) = 𝑦)) |
| 10 | 5, 9 | mpan9 515 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐿 + 𝑦) = 𝑦) |
| 11 | lidrideqd.ri | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥) | |
| 12 | lidrideqd.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐵) | |
| 13 | 4, 12, 5, 11 | lidrideqd 18715 | . . . 4 ⊢ (𝜑 → 𝐿 = 𝑅) |
| 14 | oveq1 7407 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 + 𝑅) = (𝑦 + 𝑅)) | |
| 15 | 14, 7 | eqeq12d 2781 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑥 + 𝑅) = 𝑥 ↔ (𝑦 + 𝑅) = 𝑦)) |
| 16 | 15 | rspcv 3580 | . . . . . 6 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝑦 + 𝑅) = 𝑦)) |
| 17 | oveq2 7408 | . . . . . . . . 9 ⊢ (𝐿 = 𝑅 → (𝑦 + 𝐿) = (𝑦 + 𝑅)) | |
| 18 | 17 | adantl 486 | . . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝐿) = (𝑦 + 𝑅)) |
| 19 | simpl 487 | . . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝑅) = 𝑦) | |
| 20 | 18, 19 | eqtrd 2800 | . . . . . . 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 18714 | 1 ⊢ (𝜑 → 𝐿 = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∀wral 3079 ‘cfv 6525 (class class class)co 7400 Basecbs 17257 +gcplusg 17298 0gc0g 17480 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6481 df-fun 6527 df-fv 6533 df-riota 7357 df-ov 7403 df-0g 17482 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |