Metamath Proof Explorer


Theorem idressidex0

Description: The restriction of a structure with an identity element to a subset containing the identity element has an identity element. (Contributed by Jeff Madsen, 8-Jun-2010) (Revised by Mario Carneiro, 23-Dec-2013) (Revised by AV, 11-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
idressidex0.c C = Base S
Assertion idressidex0 φ e C x C e + ˙ x = x x + ˙ e = x

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 idressidex0.c C = Base S
9 1 3 2 4 0gisid φ 0 ˙ B x B 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x
10 5 1 ressbas2 A B A = Base S
11 6 10 syl φ A = Base S
12 8 11 eqtr4id φ C = A
13 7 12 eleqtrrd φ 0 ˙ C
14 5 1 ressbasss Base S B
15 8 14 eqsstri C B
16 ssralv C B x B 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x x C 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x
17 15 16 mp1i φ x B 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x x C 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x
18 17 adantld φ 0 ˙ B x B 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x x C 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x
19 18 adantr φ e = 0 ˙ 0 ˙ B x B 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x x C 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x
20 oveq1 e = 0 ˙ e + ˙ x = 0 ˙ + ˙ x
21 20 eqeq1d e = 0 ˙ e + ˙ x = x 0 ˙ + ˙ x = x
22 21 ovanraleqv e = 0 ˙ x C e + ˙ x = x x + ˙ e = x x C 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x
23 22 adantl φ e = 0 ˙ x C e + ˙ x = x x + ˙ e = x x C 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x
24 19 23 sylibrd φ e = 0 ˙ 0 ˙ B x B 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x x C e + ˙ x = x x + ˙ e = x
25 13 24 rspcimedv φ 0 ˙ B x B 0 ˙ + ˙ x = x x + ˙ 0 ˙ = x e C x C e + ˙ x = x x + ˙ e = x
26 9 25 mpd φ e C x C e + ˙ x = x x + ˙ e = x