| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpidinv2 | Structured version Visualization version GIF version | ||
| Description: A group's properties using the explicit identity element. (Contributed by NM, 5-Feb-2010.) (Revised by AV, 1-Sep-2021.) |
| Ref | Expression |
|---|---|
| grplrinv.b | ⊢ 𝐵 = (Base‘𝐺) |
| grplrinv.p | ⊢ + = (+g‘𝐺) |
| grplrinv.i | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| grpidinv2 | ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grplrinv.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | grplrinv.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 3 | grplrinv.i | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 4 | 1, 2, 3 | grplid 19035 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ( 0 + 𝐴) = 𝐴) |
| 5 | 1, 2, 3 | grprid 19036 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → (𝐴 + 0 ) = 𝐴) |
| 6 | 1, 2, 3 | grplrinv 19064 | . . 3 ⊢ (𝐺 ∈ Grp → ∀𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 )) |
| 7 | oveq2 7420 | . . . . . . 7 ⊢ (𝑧 = 𝐴 → (𝑦 + 𝑧) = (𝑦 + 𝐴)) | |
| 8 | 7 | eqeq1d 2765 | . . . . . 6 ⊢ (𝑧 = 𝐴 → ((𝑦 + 𝑧) = 0 ↔ (𝑦 + 𝐴) = 0 )) |
| 9 | oveq1 7419 | . . . . . . 7 ⊢ (𝑧 = 𝐴 → (𝑧 + 𝑦) = (𝐴 + 𝑦)) | |
| 10 | 9 | eqeq1d 2765 | . . . . . 6 ⊢ (𝑧 = 𝐴 → ((𝑧 + 𝑦) = 0 ↔ (𝐴 + 𝑦) = 0 )) |
| 11 | 8, 10 | anbi12d 643 | . . . . 5 ⊢ (𝑧 = 𝐴 → (((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| 12 | 11 | rexbidv 3189 | . . . 4 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| 13 | 12 | rspcv 3578 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (∀𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) → ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| 14 | 6, 13 | mpan9 515 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )) |
| 15 | 4, 5, 14 | jca31 523 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 ∃wrex 3089 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 +gcplusg 17311 0gc0g 17493 Grpcgrp 19001 |
| 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-pow 5338 ax-pr 5406 ax-un 7734 |
| 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-pw 4565 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-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-riota 7369 df-ov 7415 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-grp 19004 df-minusg 19005 |
| This theorem is referenced by: grpidinv 19066 |
| Copyright terms: Public domain | W3C validator |