| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpidinv2 | 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 13637 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ( 0 + 𝐴) = 𝐴) |
| 5 | 1, 2, 3 | grprid 13638 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → (𝐴 + 0 ) = 𝐴) |
| 6 | 1, 2, 3 | grplrinv 13663 | . . 3 ⊢ (𝐺 ∈ Grp → ∀𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 )) |
| 7 | oveq2 6031 | . . . . . . 7 ⊢ (𝑧 = 𝐴 → (𝑦 + 𝑧) = (𝑦 + 𝐴)) | |
| 8 | 7 | eqeq1d 2239 | . . . . . 6 ⊢ (𝑧 = 𝐴 → ((𝑦 + 𝑧) = 0 ↔ (𝑦 + 𝐴) = 0 )) |
| 9 | oveq1 6030 | . . . . . . 7 ⊢ (𝑧 = 𝐴 → (𝑧 + 𝑦) = (𝐴 + 𝑦)) | |
| 10 | 9 | eqeq1d 2239 | . . . . . 6 ⊢ (𝑧 = 𝐴 → ((𝑧 + 𝑦) = 0 ↔ (𝐴 + 𝑦) = 0 )) |
| 11 | 8, 10 | anbi12d 473 | . . . . 5 ⊢ (𝑧 = 𝐴 → (((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| 12 | 11 | rexbidv 2532 | . . . 4 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| 13 | 12 | rspcv 2905 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (∀𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) → ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| 14 | 6, 13 | mpan9 281 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )) |
| 15 | 4, 5, 14 | jca31 309 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦 ∈ 𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2201 ∀wral 2509 ∃wrex 2510 ‘cfv 5328 (class class class)co 6023 Basecbs 13105 +gcplusg 13183 0gc0g 13362 Grpcgrp 13606 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-cnex 8128 ax-resscn 8129 ax-1re 8131 ax-addrcl 8134 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-inn 9149 df-2 9207 df-ndx 13108 df-slot 13109 df-base 13111 df-plusg 13196 df-0g 13364 df-mgm 13462 df-sgrp 13508 df-mnd 13523 df-grp 13609 df-minusg 13610 |
| This theorem is referenced by: grpidinv 13665 |
| Copyright terms: Public domain | W3C validator |