Metamath Proof Explorer


Theorem ineccnvmo

Description: Equivalence of a double restricted universal quantification and a restricted "at most one" inside a universal quantification. (Contributed by Peter Mazsa, 2-Sep-2021)

Ref Expression
Assertion ineccnvmo yBzBy=zyF-1zF-1=x*yBxFy

Proof

Step Hyp Ref Expression
1 relcnv RelF-1
2 id y=zy=z
3 2 inecmo RelF-1yBzBy=zyF-1zF-1=x*yByF-1x
4 1 3 ax-mp yBzBy=zyF-1zF-1=x*yByF-1x
5 brcnvg yVxVyF-1xxFy
6 5 el2v yF-1xxFy
7 6 rmobii *yByF-1x*yBxFy
8 7 albii x*yByF-1xx*yBxFy
9 4 8 bitri yBzBy=zyF-1zF-1=x*yBxFy