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

Theorem rexim 2571
Description: Theorem 19.22 of [Margaris] p. 90. (Restricted quantifier version.) (Contributed by NM, 22-Nov-1994.) (Proof shortened by Andrew Salmon, 30-May-2011.)
Assertion
Ref Expression
rexim (∀𝑥𝐴 (𝜑𝜓) → (∃𝑥𝐴 𝜑 → ∃𝑥𝐴 𝜓))

Proof of Theorem rexim
StepHypRef Expression
1 df-ral 2460 . . . 4 (∀𝑥𝐴 (𝜑𝜓) ↔ ∀𝑥(𝑥𝐴 → (𝜑𝜓)))
2 simpl 109 . . . . . . 7 ((𝑥𝐴𝜑) → 𝑥𝐴)
32a1i 9 . . . . . 6 ((𝑥𝐴 → (𝜑𝜓)) → ((𝑥𝐴𝜑) → 𝑥𝐴))
4 pm3.31 262 . . . . . 6 ((𝑥𝐴 → (𝜑𝜓)) → ((𝑥𝐴𝜑) → 𝜓))
53, 4jcad 307 . . . . 5 ((𝑥𝐴 → (𝜑𝜓)) → ((𝑥𝐴𝜑) → (𝑥𝐴𝜓)))
65alimi 1455 . . . 4 (∀𝑥(𝑥𝐴 → (𝜑𝜓)) → ∀𝑥((𝑥𝐴𝜑) → (𝑥𝐴𝜓)))
71, 6sylbi 121 . . 3 (∀𝑥𝐴 (𝜑𝜓) → ∀𝑥((𝑥𝐴𝜑) → (𝑥𝐴𝜓)))
8 exim 1599 . . 3 (∀𝑥((𝑥𝐴𝜑) → (𝑥𝐴𝜓)) → (∃𝑥(𝑥𝐴𝜑) → ∃𝑥(𝑥𝐴𝜓)))
97, 8syl 14 . 2 (∀𝑥𝐴 (𝜑𝜓) → (∃𝑥(𝑥𝐴𝜑) → ∃𝑥(𝑥𝐴𝜓)))
10 df-rex 2461 . 2 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
11 df-rex 2461 . 2 (∃𝑥𝐴 𝜓 ↔ ∃𝑥(𝑥𝐴𝜓))
129, 10, 113imtr4g 205 1 (∀𝑥𝐴 (𝜑𝜓) → (∃𝑥𝐴 𝜑 → ∃𝑥𝐴 𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1351  wex 1492  wcel 2148  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-ial 1534
This theorem depends on definitions:  df-bi 117  df-ral 2460  df-rex 2461
This theorem is referenced by:  reximia  2572  reximdai  2575  r19.29  2614  reupick2  3422  ss2iun  3902  chfnrn  5628
  Copyright terms: Public domain W3C validator