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 3107
Description: Restricted quantifier version of 19.43 1889. (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 3097 . 2 (∃𝑥𝐴𝜑𝜓) ↔ (∀𝑥𝐴 ¬ 𝜑 → ∃𝑥𝐴 𝜓))
2 df-or 854 . . 3 ((𝜑𝜓) ↔ (¬ 𝜑𝜓))
32rexbii 3086 . 2 (∃𝑥𝐴 (𝜑𝜓) ↔ ∃𝑥𝐴𝜑𝜓))
4 df-or 854 . . 3 ((∃𝑥𝐴 𝜑 ∨ ∃𝑥𝐴 𝜓) ↔ (¬ ∃𝑥𝐴 𝜑 → ∃𝑥𝐴 𝜓))
5 ralnex 3065 . . . 4 (∀𝑥𝐴 ¬ 𝜑 ↔ ¬ ∃𝑥𝐴 𝜑)
65imbi1i 350 . . 3 ((∀𝑥𝐴 ¬ 𝜑 → ∃𝑥𝐴 𝜓) ↔ (¬ ∃𝑥𝐴 𝜑 → ∃𝑥𝐴 𝜓))
74, 6bitr4i 279 . 2 ((∃𝑥𝐴 𝜑 ∨ ∃𝑥𝐴 𝜓) ↔ (∀𝑥𝐴 ¬ 𝜑 → ∃𝑥𝐴 𝜓))
81, 3, 73bitr4i 304 1 (∃𝑥𝐴 (𝜑𝜓) ↔ (∃𝑥𝐴 𝜑 ∨ ∃𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wo 853  wral 3053  wrex 3063
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-ex 1787  df-ral 3054  df-rex 3064
This theorem is referenced by:  3r19.43  3108  r19.45v  3173  r19.44v  3174  r19.45zv  4436  r19.44zv  4437  iunun  5022  soseq  8099  wemapsolem  9455  pythagtriplem2  16779  pythagtrip  16796  dcubic  26828  addsdilem1  28161  mulsasslem2  28174  legtrid  28677  axcontlem4  29054  erdszelem11  35429  satfvsucsuc  35593  fmla1  35615  seglelin  36344  hashnexinjle  42614  fimgmcyclem  43019  rexor  43118  diophun  43222  rexzrexnn0  43249  nprmmul3  48004  dfvopnbgr2  48344  dfsclnbgr6  48349  ldepslinc  49000
  Copyright terms: Public domain W3C validator