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

Theorem exdistrf 2337
Description: Distribution of existential quantifiers, with a bound-variable hypothesis saying that 𝑦 is not free in 𝜑, but 𝑥 can be free in 𝜑 (and there is no distinct variable condition on 𝑥 and 𝑦). (Contributed by Mario Carneiro, 20-Mar-2013.) (Proof shortened by Wolf Lammen, 14-May-2018.)
Hypothesis
Ref Expression
exdistrf.1 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑)
Assertion
Ref Expression
exdistrf (∃𝑥𝑦(𝜑𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))

Proof of Theorem exdistrf
StepHypRef Expression
1 nfe1 2029 . 2 𝑥𝑥(𝜑 ∧ ∃𝑦𝜓)
2 19.8a 2054 . . . . . 6 (𝜓 → ∃𝑦𝜓)
32anim2i 592 . . . . 5 ((𝜑𝜓) → (𝜑 ∧ ∃𝑦𝜓))
43eximi 1759 . . . 4 (∃𝑦(𝜑𝜓) → ∃𝑦(𝜑 ∧ ∃𝑦𝜓))
5 biidd 252 . . . . 5 (∀𝑥 𝑥 = 𝑦 → ((𝜑 ∧ ∃𝑦𝜓) ↔ (𝜑 ∧ ∃𝑦𝜓)))
65drex1 2331 . . . 4 (∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝜑 ∧ ∃𝑦𝜓) ↔ ∃𝑦(𝜑 ∧ ∃𝑦𝜓)))
74, 6syl5ibr 236 . . 3 (∀𝑥 𝑥 = 𝑦 → (∃𝑦(𝜑𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓)))
8 19.40 1796 . . . 4 (∃𝑦(𝜑𝜓) → (∃𝑦𝜑 ∧ ∃𝑦𝜓))
9 exdistrf.1 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝜑)
10919.9d 2073 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑦𝜑𝜑))
1110anim1d 587 . . . 4 (¬ ∀𝑥 𝑥 = 𝑦 → ((∃𝑦𝜑 ∧ ∃𝑦𝜓) → (𝜑 ∧ ∃𝑦𝜓)))
12 19.8a 2054 . . . 4 ((𝜑 ∧ ∃𝑦𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
138, 11, 12syl56 36 . . 3 (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑦(𝜑𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓)))
147, 13pm2.61i 176 . 2 (∃𝑦(𝜑𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
151, 14exlimi 2089 1 (∃𝑥𝑦(𝜑𝜓) → ∃𝑥(𝜑 ∧ ∃𝑦𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  wal 1478  wex 1701  wnf 1705
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-10 2021  ax-12 2049  ax-13 2250
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ex 1702  df-nf 1707
This theorem is referenced by:  oprabid  6632
  Copyright terms: Public domain W3C validator