Metamath Proof Explorer


Theorem idressid

Description: The restriction of a structure with an identity element to a subset containing the identity element has the same identity element. (Contributed by Jeff Madsen, 8-Jun-2010) (Revised by Mario Carneiro, 23-Dec-2013) (Revised by AV, 12-Aug-2026)

Ref Expression
Hypotheses idressidex.b ⊢ B = Base G
idressidex.p ⊢ + ˙ = + G
idressidex.o ⊢ 0 ˙ = 0 G
idressidex.e ⊢ φ → ∃ e ∈ B ∀ x ∈ B e + ˙ x = x ∧ x + ˙ e = x
idressidex.s ⊢ S = G ↾ 𝑠 A
idressidex.a ⊢ φ → A ⊆ B
idressidex.0 ⊢ φ → 0 ˙ ∈ A
Assertion idressid ⊢ φ → 0 S = 0 ˙

Proof

Step Hyp Ref Expression
1 idressidex.b ⊢ B = Base G
2 idressidex.p ⊢ + ˙ = + G
3 idressidex.o ⊢ 0 ˙ = 0 G
4 idressidex.e ⊢ φ → ∃ e ∈ B ∀ x ∈ B e + ˙ x = x ∧ x + ˙ e = x
5 idressidex.s ⊢ S = G ↾ 𝑠 A
6 idressidex.a ⊢ φ → A ⊆ B
7 idressidex.0 ⊢ φ → 0 ˙ ∈ A
8 5 1 ressbas2 ⊢ A ⊆ B → A = Base S
9 6 8 syl ⊢ φ → A = Base S
10 7 9 eleqtrd ⊢ φ → 0 ˙ ∈ Base S
11 1 3 2 4 0gisid ⊢ φ → 0 ˙ ∈ B ∧ ∀ x ∈ B 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x
12 ssralv ⊢ A ⊆ B → ∀ x ∈ B 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x → ∀ x ∈ A 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x
13 6 12 syl ⊢ φ → ∀ x ∈ B 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x → ∀ x ∈ A 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x
14 1 fvexi ⊢ B ∈ V
15 14 a1i ⊢ φ → B ∈ V
16 15 6 ssexd ⊢ φ → A ∈ V
17 5 2 ressplusg ⊢ A ∈ V → + ˙ = + S
18 16 17 syl ⊢ φ → + ˙ = + S
19 18 oveqd ⊢ φ → 0 ˙ + ˙ x = 0 ˙ + S x
20 19 eqeq1d ⊢ φ → 0 ˙ + ˙ x = x ↔ 0 ˙ + S x = x
21 18 oveqd ⊢ φ → x + ˙ 0 ˙ = x + S 0 ˙
22 21 eqeq1d ⊢ φ → x + ˙ 0 ˙ = x ↔ x + S 0 ˙ = x
23 20 22 anbi12d ⊢ φ → 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x ↔ 0 ˙ + S x = x ∧ x + S 0 ˙ = x
24 9 23 raleqbidv ⊢ φ → ∀ x ∈ A 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x ↔ ∀ x ∈ Base S 0 ˙ + S x = x ∧ x + S 0 ˙ = x
25 13 24 sylibd ⊢ φ → ∀ x ∈ B 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x → ∀ x ∈ Base S 0 ˙ + S x = x ∧ x + S 0 ˙ = x
26 25 adantld ⊢ φ → 0 ˙ ∈ B ∧ ∀ x ∈ B 0 ˙ + ˙ x = x ∧ x + ˙ 0 ˙ = x → ∀ x ∈ Base S 0 ˙ + S x = x ∧ x + S 0 ˙ = x
27 11 26 mpd ⊢ φ → ∀ x ∈ Base S 0 ˙ + S x = x ∧ x + S 0 ˙ = x
28 eqid ⊢ Base S = Base S
29 eqid ⊢ 0 S = 0 S
30 eqid ⊢ + S = + S
31 1 2 3 4 5 6 7 28 idressidex0 ⊢ φ → ∃ e ∈ Base S ∀ x ∈ Base S e + ˙ x = x ∧ x + ˙ e = x
32 18 eqcomd ⊢ φ → + S = + ˙
33 32 oveqd ⊢ φ → e + S x = e + ˙ x
34 33 eqeq1d ⊢ φ → e + S x = x ↔ e + ˙ x = x
35 32 oveqd ⊢ φ → x + S e = x + ˙ e
36 35 eqeq1d ⊢ φ → x + S e = x ↔ x + ˙ e = x
37 34 36 anbi12d ⊢ φ → e + S x = x ∧ x + S e = x ↔ e + ˙ x = x ∧ x + ˙ e = x
38 37 ralbidv ⊢ φ → ∀ x ∈ Base S e + S x = x ∧ x + S e = x ↔ ∀ x ∈ Base S e + ˙ x = x ∧ x + ˙ e = x
39 38 rexbidv ⊢ φ → ∃ e ∈ Base S ∀ x ∈ Base S e + S x = x ∧ x + S e = x ↔ ∃ e ∈ Base S ∀ x ∈ Base S e + ˙ x = x ∧ x + ˙ e = x
40 31 39 mpbird ⊢ φ → ∃ e ∈ Base S ∀ x ∈ Base S e + S x = x ∧ x + S e = x
41 28 29 30 40 ismgmid ⊢ φ → 0 ˙ ∈ Base S ∧ ∀ x ∈ Base S 0 ˙ + S x = x ∧ x + S 0 ˙ = x ↔ 0 S = 0 ˙
42 10 27 41 mpbi2and ⊢ φ → 0 S = 0 ˙