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

Theorem reueq1f 2902
 Description: Equality theorem for restricted uniqueness quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 5-Apr-2004.) (Revised by Andrew Salmon, 11-Jul-2011.)
Hypotheses
Ref Expression
raleq1f.1
raleq1f.2
Assertion
Ref Expression
reueq1f

Proof of Theorem reueq1f
StepHypRef Expression
1 raleq1f.1 . . . 4
2 raleq1f.2 . . . 4
31, 2nfeq 2579 . . 3
4 eleq2 2497 . . . 4
54anbi1d 686 . . 3
63, 5eubid 2288 . 2
7 df-reu 2712 . 2
8 df-reu 2712 . 2
96, 7, 83bitr4g 280 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177   wa 359   wceq 1652   wcel 1725  weu 2281  wnfc 2559  wreu 2707 This theorem is referenced by:  reueq1  2906 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2285  df-cleq 2429  df-clel 2432  df-nfc 2561  df-reu 2712
 Copyright terms: Public domain W3C validator