Metamath Proof Explorer


Theorem cleqf

Description: Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions as in dfcleq . See also cleqh . (Contributed by NM, 26-May-1993) (Revised by Mario Carneiro, 7-Oct-2016) (Proof shortened by Wolf Lammen, 17-Nov-2019) Avoid ax-13 . (Revised by Wolf Lammen, 10-May-2023) Avoid ax-10 . (Revised by Gino Giotto, 20-Aug-2023)

Ref Expression
Hypotheses cleqf.1 _xA
cleqf.2 _xB
Assertion cleqf A=BxxAxB

Proof

Step Hyp Ref Expression
1 cleqf.1 _xA
2 cleqf.2 _xB
3 dfcleq A=ByyAyB
4 nfv yxAxB
5 1 nfcri xyA
6 2 nfcri xyB
7 5 6 nfbi xyAyB
8 eleq1w x=yxAyA
9 eleq1w x=yxByB
10 8 9 bibi12d x=yxAxByAyB
11 4 7 10 cbvalv1 xxAxByyAyB
12 3 11 bitr4i A=BxxAxB