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

Theorem axunndlem1 10633
Description: Lemma for the Axiom of Union with no distinct variable conditions. Usage of this theorem is discouraged because it depends on ax-13 2375. (Contributed by NM, 2-Jan-2002.) (New usage is discouraged.)
Assertion
Ref Expression
axunndlem1 𝑥𝑦(∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥)
Distinct variable groups:   𝑥,𝑦   𝑥,𝑧

Proof of Theorem axunndlem1
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 en2lp 9644 . . . . . . . 8 ¬ (𝑦𝑥𝑥𝑦)
2 elequ2 2121 . . . . . . . . 9 (𝑦 = 𝑧 → (𝑥𝑦𝑥𝑧))
32anbi2d 630 . . . . . . . 8 (𝑦 = 𝑧 → ((𝑦𝑥𝑥𝑦) ↔ (𝑦𝑥𝑥𝑧)))
41, 3mtbii 326 . . . . . . 7 (𝑦 = 𝑧 → ¬ (𝑦𝑥𝑥𝑧))
54sps 2183 . . . . . 6 (∀𝑦 𝑦 = 𝑧 → ¬ (𝑦𝑥𝑥𝑧))
65nexdv 1934 . . . . 5 (∀𝑦 𝑦 = 𝑧 → ¬ ∃𝑥(𝑦𝑥𝑥𝑧))
76pm2.21d 121 . . . 4 (∀𝑦 𝑦 = 𝑧 → (∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥))
87axc4i 2321 . . 3 (∀𝑦 𝑦 = 𝑧 → ∀𝑦(∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥))
9819.8ad 2180 . 2 (∀𝑦 𝑦 = 𝑧 → ∃𝑥𝑦(∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥))
10 zfun 7755 . . 3 𝑥𝑤(∃𝑥(𝑤𝑥𝑥𝑧) → 𝑤𝑥)
11 nfnae 2437 . . . . 5 𝑦 ¬ ∀𝑦 𝑦 = 𝑧
12 nfnae 2437 . . . . . . 7 𝑥 ¬ ∀𝑦 𝑦 = 𝑧
13 nfvd 1913 . . . . . . . 8 (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦 𝑤𝑥)
14 nfcvf 2930 . . . . . . . . 9 (¬ ∀𝑦 𝑦 = 𝑧𝑦𝑧)
1514nfcrd 2897 . . . . . . . 8 (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦 𝑥𝑧)
1613, 15nfand 1895 . . . . . . 7 (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦(𝑤𝑥𝑥𝑧))
1712, 16nfexd 2328 . . . . . 6 (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦𝑥(𝑤𝑥𝑥𝑧))
1817, 13nfimd 1892 . . . . 5 (¬ ∀𝑦 𝑦 = 𝑧 → Ⅎ𝑦(∃𝑥(𝑤𝑥𝑥𝑧) → 𝑤𝑥))
19 elequ1 2113 . . . . . . . . 9 (𝑤 = 𝑦 → (𝑤𝑥𝑦𝑥))
2019anbi1d 631 . . . . . . . 8 (𝑤 = 𝑦 → ((𝑤𝑥𝑥𝑧) ↔ (𝑦𝑥𝑥𝑧)))
2120exbidv 1919 . . . . . . 7 (𝑤 = 𝑦 → (∃𝑥(𝑤𝑥𝑥𝑧) ↔ ∃𝑥(𝑦𝑥𝑥𝑧)))
2221, 19imbi12d 344 . . . . . 6 (𝑤 = 𝑦 → ((∃𝑥(𝑤𝑥𝑥𝑧) → 𝑤𝑥) ↔ (∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥)))
2322a1i 11 . . . . 5 (¬ ∀𝑦 𝑦 = 𝑧 → (𝑤 = 𝑦 → ((∃𝑥(𝑤𝑥𝑥𝑧) → 𝑤𝑥) ↔ (∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥))))
2411, 18, 23cbvald 2410 . . . 4 (¬ ∀𝑦 𝑦 = 𝑧 → (∀𝑤(∃𝑥(𝑤𝑥𝑥𝑧) → 𝑤𝑥) ↔ ∀𝑦(∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥)))
2524exbidv 1919 . . 3 (¬ ∀𝑦 𝑦 = 𝑧 → (∃𝑥𝑤(∃𝑥(𝑤𝑥𝑥𝑧) → 𝑤𝑥) ↔ ∃𝑥𝑦(∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥)))
2610, 25mpbii 233 . 2 (¬ ∀𝑦 𝑦 = 𝑧 → ∃𝑥𝑦(∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥))
279, 26pm2.61i 182 1 𝑥𝑦(∃𝑥(𝑦𝑥𝑥𝑧) → 𝑦𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1535  wex 1776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-13 2375  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754  ax-reg 9630
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-eprel 5589  df-fr 5641
This theorem is referenced by:  axunnd  10634
  Copyright terms: Public domain W3C validator