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

Theorem r19.29r 2615
Description: Variation of Theorem 19.29 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 31-Aug-1999.)
Assertion
Ref Expression
r19.29r ((∃𝑥𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓) → ∃𝑥𝐴 (𝜑𝜓))

Proof of Theorem r19.29r
StepHypRef Expression
1 r19.29 2614 . 2 ((∀𝑥𝐴 𝜓 ∧ ∃𝑥𝐴 𝜑) → ∃𝑥𝐴 (𝜓𝜑))
2 ancom 266 . 2 ((∃𝑥𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓) ↔ (∀𝑥𝐴 𝜓 ∧ ∃𝑥𝐴 𝜑))
3 ancom 266 . . 3 ((𝜑𝜓) ↔ (𝜓𝜑))
43rexbii 2484 . 2 (∃𝑥𝐴 (𝜑𝜓) ↔ ∃𝑥𝐴 (𝜓𝜑))
51, 2, 43imtr4i 201 1 ((∃𝑥𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓) → ∃𝑥𝐴 (𝜑𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wral 2455  wrex 2456
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-4 1510  ax-17 1526  ax-ial 1534
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-ral 2460  df-rex 2461
This theorem is referenced by:  r19.29af2  2617  lmss  13379  metcnp3  13644
  Copyright terms: Public domain W3C validator