| 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 19024 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ( 0 + 𝐴) = 𝐴) |
| 5 | 1, 2, 3 | grprid 19025 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → (𝐴 + 0 ) = 𝐴) |
| 6 | 1, 2, 3 | grplrinv 19053 | . . 3 ⊢ (𝐺 ∈ Grp → ∀𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 )) |
| 7 | oveq2 7408 | . . . . . . 7 ⊢ (𝑧 = 𝐴 → (𝑦 + 𝑧) = (𝑦 + 𝐴)) | |
| 8 | 7 | eqeq1d 2767 | . . . . . 6 ⊢ (𝑧 = 𝐴 → ((𝑦 + 𝑧) = 0 ↔ (𝑦 + 𝐴) = 0 )) |
| 9 | oveq1 7407 | . . . . . . 7 ⊢ (𝑧 = 𝐴 → (𝑧 + 𝑦) = (𝐴 + 𝑦)) | |
| 10 | 9 | eqeq1d 2767 | . . . . . 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 3580 | . . 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 1563 ∈ wcel 2145 ∀wral 3079 ∃wrex 3089 ‘cfv 6525 (class class class)co 7400 Basecbs 17259 +gcplusg 17300 0gc0g 17482 Grpcgrp 18990 |
| 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 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 |
| 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-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-fv 6533 df-riota 7357 df-ov 7403 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 |
| This theorem is referenced by: grpidinv 19055 |
| Copyright terms: Public domain | W3C validator |