Metamath Proof Explorer


Theorem mdbr

Description: Binary relation expressing <. A , B >. is a modular pair. Definition 1.1 of MaedaMaeda p. 1. (Contributed by NM, 14-Jun-2004) (New usage is discouraged.)

Ref Expression
Assertion mdbr ACBCA𝑀BxCxBxAB=xAB

Proof

Step Hyp Ref Expression
1 eleq1 y=AyCAC
2 1 anbi1d y=AyCzCACzC
3 oveq2 y=Axy=xA
4 3 ineq1d y=Axyz=xAz
5 ineq1 y=Ayz=Az
6 5 oveq2d y=Axyz=xAz
7 4 6 eqeq12d y=Axyz=xyzxAz=xAz
8 7 imbi2d y=Axzxyz=xyzxzxAz=xAz
9 8 ralbidv y=AxCxzxyz=xyzxCxzxAz=xAz
10 2 9 anbi12d y=AyCzCxCxzxyz=xyzACzCxCxzxAz=xAz
11 eleq1 z=BzCBC
12 11 anbi2d z=BACzCACBC
13 sseq2 z=BxzxB
14 ineq2 z=BxAz=xAB
15 ineq2 z=BAz=AB
16 15 oveq2d z=BxAz=xAB
17 14 16 eqeq12d z=BxAz=xAzxAB=xAB
18 13 17 imbi12d z=BxzxAz=xAzxBxAB=xAB
19 18 ralbidv z=BxCxzxAz=xAzxCxBxAB=xAB
20 12 19 anbi12d z=BACzCxCxzxAz=xAzACBCxCxBxAB=xAB
21 df-md 𝑀=yz|yCzCxCxzxyz=xyz
22 10 20 21 brabg ACBCA𝑀BACBCxCxBxAB=xAB
23 22 bianabs ACBCA𝑀BxCxBxAB=xAB