Metamath Proof Explorer


Theorem dfgrp2e

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
Hypotheses dfgrp2.b ⊢ B = Base G
dfgrp2.p ⊢ + ˙ = + G
Assertion dfgrp2e ⊢ G ∈ Grp ↔ ∀ x ∈ B ∀ y ∈ B x + ˙ y ∈ B ∧ ∀ z ∈ B x + ˙ y + ˙ z = x + ˙ y + ˙ z ∧ ∃ n ∈ B ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n

Proof

Step Hyp Ref Expression
1 dfgrp2.b ⊢ B = Base G
2 dfgrp2.p ⊢ + ˙ = + G
3 1 2 dfgrp2 ⊢ G ∈ Grp ↔ G ∈ Smgrp ∧ ∃ n ∈ B ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n
4 ax-1 ⊢ G ∈ V → n ∈ B → G ∈ V
5 fvprc ⊢ ¬ G ∈ V → Base G = ∅
6 1 eleq2i ⊢ n ∈ B ↔ n ∈ Base G
7 eleq2 ⊢ Base G = ∅ → n ∈ Base G ↔ n ∈ ∅
8 noel ⊢ ¬ n ∈ ∅
9 8 pm2.21i ⊢ n ∈ ∅ → G ∈ V
10 7 9 biimtrdi ⊢ Base G = ∅ → n ∈ Base G → G ∈ V
11 6 10 biimtrid ⊢ Base G = ∅ → n ∈ B → G ∈ V
12 5 11 syl ⊢ ¬ G ∈ V → n ∈ B → G ∈ V
13 4 12 pm2.61i ⊢ n ∈ B → G ∈ V
14 13 a1d ⊢ n ∈ B → ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n → G ∈ V
15 14 rexlimiv ⊢ ∃ n ∈ B ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n → G ∈ V
16 1 2 issgrpv ⊢ G ∈ V → G ∈ Smgrp ↔ ∀ x ∈ B ∀ y ∈ B x + ˙ y ∈ B ∧ ∀ z ∈ B x + ˙ y + ˙ z = x + ˙ y + ˙ z
17 15 16 syl ⊢ ∃ n ∈ B ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n → G ∈ Smgrp ↔ ∀ x ∈ B ∀ y ∈ B x + ˙ y ∈ B ∧ ∀ z ∈ B x + ˙ y + ˙ z = x + ˙ y + ˙ z
18 17 pm5.32ri ⊢ G ∈ Smgrp ∧ ∃ n ∈ B ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n ↔ ∀ x ∈ B ∀ y ∈ B x + ˙ y ∈ B ∧ ∀ z ∈ B x + ˙ y + ˙ z = x + ˙ y + ˙ z ∧ ∃ n ∈ B ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n
19 3 18 bitri ⊢ G ∈ Grp ↔ ∀ x ∈ B ∀ y ∈ B x + ˙ y ∈ B ∧ ∀ z ∈ B x + ˙ y + ˙ z = x + ˙ y + ˙ z ∧ ∃ n ∈ B ∀ x ∈ B n + ˙ x = x ∧ ∃ i ∈ B i + ˙ x = n