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

Theorem axprlem1 5360
Description: Lemma for axpr 5364. 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 5302 . 2 𝑥𝑦(∀𝑧(𝑧𝑦𝑧𝑤) → 𝑦𝑥)
2 pm2.21 123 . . . . 5 𝑧𝑦 → (𝑧𝑦𝑧𝑤))
32alimi 1813 . . . 4 (∀𝑧 ¬ 𝑧𝑦 → ∀𝑧(𝑧𝑦𝑧𝑤))
43imim1i 63 . . 3 ((∀𝑧(𝑧𝑦𝑧𝑤) → 𝑦𝑥) → (∀𝑧 ¬ 𝑧𝑦𝑦𝑥))
54alimi 1813 . 2 (∀𝑦(∀𝑧(𝑧𝑦𝑧𝑤) → 𝑦𝑥) → ∀𝑦(∀𝑧 ¬ 𝑧𝑦𝑦𝑥))
61, 5eximii 1839 1 𝑥𝑦(∀𝑧 ¬ 𝑧𝑦𝑦𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1540  wex 1781
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-pow 5302
This theorem depends on definitions:  df-bi 207  df-ex 1782
This theorem is referenced by:  axprlem2  5361  axpr  5364  axprlem4OLD  5367
  Copyright terms: Public domain W3C validator