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

Theorem r19.43 3133
Description: Restricted quantifier version of 19.43 1912. (Contributed by NM, 27-May-1998.) (Proof shortened by Andrew Salmon, 30-May-2011.)
Assertion
Ref Expression
r19.43 (∃𝑥𝐴 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑 ∨ ∃𝑥𝐴 𝜓))

Proof of Theorem r19.43
StepHypRef Expression
1 r19.35 3123 . 2 (∃𝑥𝐴𝜑𝜓) ↔ (∀𝑥𝐴 ¬ 𝜑 → ∃𝑥𝐴 𝜓))
2 df-or 861 . . 3 ((𝜑𝜓) ↔ (¬ 𝜑𝜓))
32rexbii 3112 . 2 (∃𝑥𝐴 (𝜑𝜓) ↔ ∃𝑥𝐴𝜑𝜓))
4 df-or 861 . . 3 ((∃𝑥𝐴 𝜑 ∨ ∃𝑥𝐴 𝜓) ↔ (¬ ∃𝑥𝐴 𝜑 → ∃𝑥𝐴 𝜓))
5 ralnex 3091 . . . 4 (∀𝑥𝐴 ¬ 𝜑 ↔ ¬ ∃𝑥𝐴 𝜑)
65imbi1i 352 . . 3 ((∀𝑥𝐴 ¬ 𝜑 → ∃𝑥𝐴 𝜓) ↔ (¬ ∃𝑥𝐴 𝜑 → ∃𝑥𝐴 𝜓))
74, 6bitr4i 281 . 2 ((∃𝑥𝐴 𝜑 ∨ ∃𝑥𝐴 𝜓) ↔ (∀𝑥𝐴 ¬ 𝜑 → ∃𝑥𝐴 𝜓))
81, 3, 73bitr4i 306 1 (∃𝑥𝐴 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑 ∨ ∃𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wo 860  wral 3079  wrex 3089
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1810  df-ral 3080  df-rex 3090
This theorem is referenced by:  3r19.43  3134  r19.45v  3199  r19.44v  3200  r19.45zv  4469  r19.44zv  4470  iunun  5059  soseq  8151  wemapsolem  9508  pythagtriplem2  16872  pythagtrip  16889  dcubic  27011  addsdilem1  28344  mulsasslem2  28357  legtrid  28860  axcontlem4  29317  erdszelem11  35693  satfvsucsuc  35857  fmla1  35879  seglelin  36608  hashnexinjle  42896  fimgmcyclem  43301  rexor  43400  diophun  43504  rexzrexnn0  43531  nprmmul3  48278  dfvopnbgr2  48618  dfsclnbgr6  48623  ldepslinc  49289
  Copyright terms: Public domain W3C validator