Metamath Proof Explorer


Theorem preleq

Description: Equality of two unordered pairs when one member of each pair contains the other member. (Contributed by NM, 16-Oct-1996) (Revised by AV, 15-Jun-2022)

Ref Expression
Hypothesis preleq.b BV
Assertion preleq ABCDAB=CDA=CB=D

Proof

Step Hyp Ref Expression
1 preleq.b BV
2 preleqg ABBVCDAB=CDA=CB=D
3 1 2 mp3anl2 ABCDAB=CDA=CB=D