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

Theorem axprlem1 5399
Description: Lemma for axpr 5403. There exists a set to which all empty sets belong. (Contributed by Rohan Ridenour, 10-Aug-2023.) (Revised by BJ, 13-Aug-2023.) (Proof shortened by Matthew House, 6-Apr-2026.)
Assertion
Ref Expression
axprlem1 𝑥𝑦(∀𝑧 ¬ 𝑧𝑦𝑦𝑥)
Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem axprlem1
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 ax-pow 5341 . 2 𝑥𝑦(∀𝑧(𝑧𝑦𝑧𝑤) → 𝑦𝑥)
2 pm2.21 124 . . . . 5 𝑧𝑦 → (𝑧𝑦𝑧𝑤))
32alimi 1844 . . . 4 (∀𝑧 ¬ 𝑧𝑦 → ∀𝑧(𝑧𝑦𝑧𝑤))
43imim1i 64 . . 3 ((∀𝑧(𝑧𝑦𝑧𝑤) → 𝑦𝑥) → (∀𝑧 ¬ 𝑧𝑦𝑦𝑥))
54alimi 1844 . 2 (∀𝑦(∀𝑧(𝑧𝑦𝑧𝑤) → 𝑦𝑥) → ∀𝑦(∀𝑧 ¬ 𝑧𝑦𝑦𝑥))
61, 5eximii 1870 1 𝑥𝑦(∀𝑧 ¬ 𝑧𝑦𝑦𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wal 1568  wex 1812
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-pow 5341
This proof depends on definitions:  df-bi 210  df-ex 1813
This theorem is used by:  axprlem2  5400  axpr  5403  axprlem4OLD  5406  axpowg2  35584  axpowg3  35585
  Copyright terms: Public domain W3C validator