Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  cleqf Unicode version

Theorem cleqf 2456
 Description: Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 7-Oct-2016.)
Hypotheses
Ref Expression
cleqf.1
cleqf.2
Assertion
Ref Expression
cleqf

Proof of Theorem cleqf
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 dfcleq 2290 . 2
2 nfv 1609 . . 3
3 cleqf.1 . . . . 5
43nfcri 2426 . . . 4
5 cleqf.2 . . . . 5
65nfcri 2426 . . . 4
74, 6nfbi 1784 . . 3
8 eleq1 2356 . . . 4
9 eleq1 2356 . . . 4
108, 9bibi12d 312 . . 3
112, 7, 10cbval 1937 . 2
121, 11bitr4i 243 1
 Colors of variables: wff set class Syntax hints:   wb 176  wal 1530   wceq 1632   wcel 1696  wnfc 2419 This theorem is referenced by:  abid2f  2457  n0f  3476  iunab  3964  iinab  3979  sniota  5262  mbfposr  19023  mbfinf  19036  itg1climres  19085  eqriv2  25050  sgplpte21a  26236  compab  27747  rfcnpre1  27793  rfcnpre2  27805  bnj1366  29178 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-cleq 2289  df-clel 2292  df-nfc 2421
 Copyright terms: Public domain W3C validator