MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  exbid Structured version   Visualization version   GIF version

Theorem exbid 2231
Description: Formula-building rule for existential quantifier (deduction form). (Contributed by Mario Carneiro, 24-Sep-2016.)
Hypotheses
Ref Expression
albid.1 𝑥𝜑
albid.2 (𝜑 → (𝜓𝜒))
Assertion
Ref Expression
exbid (𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒))

Proof of Theorem exbid
StepHypRef Expression
1 albid.1 . . 3 𝑥𝜑
21nf5ri 2203 . 2 (𝜑 → ∀𝑥𝜑)
3 albid.2 . 2 (𝜑 → (𝜓𝜒))
42, 3exbidh 1869 1 (𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wex 1781  wnf 1785
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-12 2185
This theorem depends on definitions:  df-bi 207  df-ex 1782  df-nf 1786
This theorem is referenced by:  nfbidf  2232  drex2  2447  rexbida  3249  rexeqfOLD  3328  opabbid  5164  zfrepclf  5237  dfid3  5523  oprabbid  7425  axrepndlem1  10507  axrepndlem2  10508  axrepnd  10509  axpowndlem2  10513  axpowndlem3  10514  axpowndlem4  10515  axregnd  10519  axinfndlem1  10520  axinfnd  10521  axacndlem4  10525  axacndlem5  10526  axacnd  10527  opabdm  32692  opabrn  32693  pm14.122b  44731  pm14.123b  44734  modelaxreplem3  45288
  Copyright terms: Public domain W3C validator