Metamath Proof Explorer


Theorem idressidex

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
Assertion idressidex φ e A x A 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 eqid Base S = Base S
9 1 2 3 4 5 6 7 8 idressidex0 φ e Base S x Base S e + ˙ x = x x + ˙ e = x
10 5 1 ressbas2 A B A = Base S
11 id A = Base S A = Base S
12 raleq A = Base S x A e + ˙ x = x x + ˙ e = x x Base S e + ˙ x = x x + ˙ e = x
13 11 12 rexeqbidv A = Base S e A x A e + ˙ x = x x + ˙ e = x e Base S x Base S e + ˙ x = x x + ˙ e = x
14 6 10 13 3syl φ e A x A e + ˙ x = x x + ˙ e = x e Base S x Base S e + ˙ x = x x + ˙ e = x
15 9 14 mpbird φ e A x A e + ˙ x = x x + ˙ e = x