ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  r19.29 GIF version

Theorem r19.29 2569
Description: Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.) (Proof shortened by Andrew Salmon, 30-May-2011.)
Assertion
Ref Expression
r19.29 ((∀𝑥𝐴 𝜑 ∧ ∃𝑥𝐴 𝜓) → ∃𝑥𝐴 (𝜑𝜓))

Proof of Theorem r19.29
StepHypRef Expression
1 pm3.2 138 . . . 4 (𝜑 → (𝜓 → (𝜑𝜓)))
21ralimi 2495 . . 3 (∀𝑥𝐴 𝜑 → ∀𝑥𝐴 (𝜓 → (𝜑𝜓)))
3 rexim 2526 . . 3 (∀𝑥𝐴 (𝜓 → (𝜑𝜓)) → (∃𝑥𝐴 𝜓 → ∃𝑥𝐴 (𝜑𝜓)))
42, 3syl 14 . 2 (∀𝑥𝐴 𝜑 → (∃𝑥𝐴 𝜓 → ∃𝑥𝐴 (𝜑𝜓)))
54imp 123 1 ((∀𝑥𝐴 𝜑 ∧ ∃𝑥𝐴 𝜓) → ∃𝑥𝐴 (𝜑𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wral 2416  wrex 2417
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-ial 1514
This theorem depends on definitions:  df-bi 116  df-ral 2421  df-rex 2422
This theorem is referenced by:  r19.29r  2570  r19.29d2r  2576  r19.35-1  2581  triun  4039  ralxfrd  4383  elrnmptg  4791  fun11iun  5388  fmpt  5570  fliftfun  5697  epttop  12268  tgcnp  12387  lmtopcnp  12428  txlm  12457  metss  12672  bj-findis  13230
  Copyright terms: Public domain W3C validator