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

Theorem 4exbidv 1961
Description: Formula-building rule for four existential quantifiers (deduction form). (Contributed by NM, 3-Aug-1995.)
Hypothesis
Ref Expression
4exbidv.1 (𝜑 → (𝜓 ↔ 𝜒))
Assertion
Ref Expression
4exbidv (𝜑 → (∃𝑥∃𝑦∃𝑧∃𝑤𝜓 ↔ ∃𝑥∃𝑦∃𝑧∃𝑤𝜒))
Distinct variable groups:   𝜑,𝑥   𝜑,𝑦   𝜑,𝑧   𝜑,𝑤
Allowed substitution hints:   𝜓(𝑥, 𝑦, 𝑧, 𝑤)   𝜒(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem 4exbidv
StepHypRef Expression
1 4exbidv.1 . . 3 (𝜑 → (𝜓 ↔ 𝜒))
212exbidv 1959 . 2 (𝜑 → (∃𝑧∃𝑤𝜓 ↔ ∃𝑧∃𝑤𝜒))
322exbidv 1959 1 (𝜑 → (∃𝑥∃𝑦∃𝑧∃𝑤𝜓 ↔ ∃𝑥∃𝑦∃𝑧∃𝑤𝜒))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∃wex 1812
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945
This proof depends on definitions:  df-bi 210  df-ex 1813
This theorem is used by:  ceqsex8v  3509  copsex4g  5474  opbrop  5757  ov3  7615  brecop  8869  addsrmo  11197  mulsrmo  11198  addsrpr  11199  mulsrpr  11200  dihopelvalcpre  42571  xihopellsmN  42577  dihopellsm  42578
  Copyright terms: Public domain W3C validator