Metamath Proof Explorer


Theorem ress0g

Description: 0g is unaffected by restriction. This is a bit more generic than submnd0 . (Contributed by Thierry Arnoux, 23-Oct-2017) (Proof shortened by AV, 12-Aug-2026)

Ref Expression
Hypotheses ress0g.s ⊢ S = R ↾ 𝑠 A
ress0g.b ⊢ B = Base R
ress0g.0 ⊢ 0 ˙ = 0 R
Assertion ress0g ⊢ R ∈ Mnd ∧ 0 ˙ ∈ A ∧ A ⊆ B → 0 ˙ = 0 S

Proof

Step Hyp Ref Expression
1 ress0g.s ⊢ S = R ↾ 𝑠 A
2 ress0g.b ⊢ B = Base R
3 ress0g.0 ⊢ 0 ˙ = 0 R
4 eqid ⊢ + R = + R
5 2 4 mndid ⊢ R ∈ Mnd → ∃ u ∈ B ∀ x ∈ B u + R x = x ∧ x + R u = x
6 5 3ad2ant1 ⊢ R ∈ Mnd ∧ 0 ˙ ∈ A ∧ A ⊆ B → ∃ u ∈ B ∀ x ∈ B u + R x = x ∧ x + R u = x
7 simp3 ⊢ R ∈ Mnd ∧ 0 ˙ ∈ A ∧ A ⊆ B → A ⊆ B
8 simp2 ⊢ R ∈ Mnd ∧ 0 ˙ ∈ A ∧ A ⊆ B → 0 ˙ ∈ A
9 2 4 3 6 1 7 8 idressid ⊢ R ∈ Mnd ∧ 0 ˙ ∈ A ∧ A ⊆ B → 0 S = 0 ˙
10 9 eqcomd ⊢ R ∈ Mnd ∧ 0 ˙ ∈ A ∧ A ⊆ B → 0 ˙ = 0 S