Theorem axprlem1 5385

Description: Lemma for axpr 5389. 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.

Step	Hyp	Ref	Expression
1		ax-pow 5327	. 2 ⊢ ∃𝑥∀𝑦(∀𝑧(𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑤) → 𝑦 ∈ 𝑥)
2		pm2.21 124	. . . . 5 ⊢ (¬ 𝑧 ∈ 𝑦 → (𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑤))
3	2	alimi 1844	. . . 4 ⊢ (∀𝑧 ¬ 𝑧 ∈ 𝑦 → ∀𝑧(𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑤))
4	3	imim1i 64	. . 3 ⊢ ((∀𝑧(𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑤) → 𝑦 ∈ 𝑥) → (∀𝑧 ¬ 𝑧 ∈ 𝑦 → 𝑦 ∈ 𝑥))
5	4	alimi 1844	. 2 ⊢ (∀𝑦(∀𝑧(𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑤) → 𝑦 ∈ 𝑥) → ∀𝑦(∀𝑧 ¬ 𝑧 ∈ 𝑦 → 𝑦 ∈ 𝑥))
6	1, 5	eximii 1870	1 ⊢ ∃𝑥∀𝑦(∀𝑧 ¬ 𝑧 ∈ 𝑦 → 𝑦 ∈ 𝑥)

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 5327

This proof depends on definitions:  df-bi 210  df-ex 1813

This theorem is used by:  axprlem2  5386  axpr  5389  axpowg2  35788  axpowg3  35789