| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfgrp2e | GIF version | ||
| Description: Alternate definition of a group as a set with a closed, associative operation, a left identity and a left inverse for each element. Alternate definition in [Lang] p. 7. (Contributed by NM, 10-Oct-2006.) (Revised by AV, 28-Aug-2021.) |
| Ref | Expression |
|---|---|
| dfgrp2.b | ⊢ 𝐵 = (Base‘𝐺) |
| dfgrp2.p | ⊢ + = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| dfgrp2e | ⊢ (𝐺 ∈ Grp ↔ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ∧ ∃𝑛 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑛 + 𝑥) = 𝑥 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑥) = 𝑛))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfgrp2.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | dfgrp2.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 3 | 1, 2 | dfgrp2 13597 | . 2 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑛 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑛 + 𝑥) = 𝑥 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑥) = 𝑛))) |
| 4 | rexm 3592 | . . . 4 ⊢ (∃𝑛 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑛 + 𝑥) = 𝑥 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑥) = 𝑛) → ∃𝑛 𝑛 ∈ 𝐵) | |
| 5 | 1 | basmex 13129 | . . . . 5 ⊢ (𝑛 ∈ 𝐵 → 𝐺 ∈ V) |
| 6 | 5 | exlimiv 1644 | . . . 4 ⊢ (∃𝑛 𝑛 ∈ 𝐵 → 𝐺 ∈ V) |
| 7 | 1, 2 | issgrpv 13474 | . . . 4 ⊢ (𝐺 ∈ V → (𝐺 ∈ Smgrp ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))))) |
| 8 | 4, 6, 7 | 3syl 17 | . . 3 ⊢ (∃𝑛 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑛 + 𝑥) = 𝑥 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑥) = 𝑛) → (𝐺 ∈ Smgrp ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))))) |
| 9 | 8 | pm5.32ri 455 | . 2 ⊢ ((𝐺 ∈ Smgrp ∧ ∃𝑛 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑛 + 𝑥) = 𝑥 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑥) = 𝑛)) ↔ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ∧ ∃𝑛 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑛 + 𝑥) = 𝑥 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑥) = 𝑛))) |
| 10 | 3, 9 | bitri 184 | 1 ⊢ (𝐺 ∈ Grp ↔ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 + 𝑦) ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) ∧ ∃𝑛 ∈ 𝐵 ∀𝑥 ∈ 𝐵 ((𝑛 + 𝑥) = 𝑥 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑥) = 𝑛))) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1395 ∃wex 1538 ∈ wcel 2200 ∀wral 2508 ∃wrex 2509 Vcvv 2800 ‘cfv 5322 (class class class)co 6011 Basecbs 13069 +gcplusg 13147 Smgrpcsgrp 13471 Grpcgrp 13570 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4203 ax-pow 4260 ax-pr 4295 ax-un 4526 ax-cnex 8111 ax-resscn 8112 ax-1re 8114 ax-addrcl 8117 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3890 df-int 3925 df-br 4085 df-opab 4147 df-mpt 4148 df-id 4386 df-xp 4727 df-rel 4728 df-cnv 4729 df-co 4730 df-dm 4731 df-rn 4732 df-res 4733 df-iota 5282 df-fun 5324 df-fn 5325 df-fv 5330 df-riota 5964 df-ov 6014 df-inn 9132 df-2 9190 df-ndx 13072 df-slot 13073 df-base 13075 df-plusg 13160 df-0g 13328 df-mgm 13426 df-sgrp 13472 df-mnd 13487 df-grp 13573 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |