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

Theorem 2rexbidva 2746
 Description: Formula-building rule for restricted existential quantifiers (deduction rule). (Contributed by NM, 15-Dec-2004.)
Hypothesis
Ref Expression
2ralbidva.1
Assertion
Ref Expression
2rexbidva
Distinct variable groups:   ,,   ,
Allowed substitution hints:   (,)   (,)   ()   (,)

Proof of Theorem 2rexbidva
StepHypRef Expression
1 2ralbidva.1 . . . 4
21anassrs 630 . . 3
32rexbidva 2722 . 2
43rexbidva 2722 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177   wa 359   wcel 1725  wrex 2706 This theorem is referenced by:  bezoutlem2  13039  bezoutlem4  13041  vdwmc2  13347  lsmcom2  15289  lsmass  15302  lsmcomx  15471  lsmspsn  16156  hausdiag  17677  imasf1oxms  18519  shscom  22821  axeuclid  25902  2reu4a  27943  el2wlksot  28347  el2pthsot  28348  usg2spot2nb  28454  3dim0  30254  islpln5  30332  islvol5  30376  isline2  30571  isline3  30573  paddcom  30610  cdlemg2cex  31388 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-11 1761 This theorem depends on definitions:  df-bi 178  df-an 361  df-ex 1551  df-nf 1554  df-rex 2711
 Copyright terms: Public domain W3C validator