Metamath Proof Explorer


Theorem alrmomodm

Description: Equivalence of an "at most one" and an "at most one" restricted to the domain inside a universal quantification. (Contributed by Peter Mazsa, 5-Sep-2021)

Ref Expression
Assertion alrmomodm RelRx*udomRuRxx*uuRx

Proof

Step Hyp Ref Expression
1 df-rmo *udomRuRx*uudomRuRx
2 brres xVuRdomRxudomRuRx
3 2 elv uRdomRxudomRuRx
4 resdm RelRRdomR=R
5 4 breqd RelRuRdomRxuRx
6 3 5 bitr3id RelRudomRuRxuRx
7 6 mobidv RelR*uudomRuRx*uuRx
8 1 7 syl5bb RelR*udomRuRx*uuRx
9 8 albidv RelRx*udomRuRxx*uuRx