Theorem bdsep1 13767

Description: Version of ax-bdsep 13766 without initial universal quantifier. (Contributed by BJ, 5-Oct-2019.)

Hypothesis

Ref	Expression
bdsep1.1	⊢ BOUNDED 𝜑

Assertion

Ref	Expression
bdsep1	⊢ ∃𝑏∀𝑥(𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))

Distinct variable groups:   𝑎,𝑏,𝑥   𝜑,𝑎,𝑏

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem bdsep1

Step	Hyp	Ref	Expression
1		bdsep1.1	. . 3 ⊢ BOUNDED 𝜑
2	1	ax-bdsep 13766	. 2 ⊢ ∀𝑎∃𝑏∀𝑥(𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))
3	2	spi 1524	1 ⊢ ∃𝑏∀𝑥(𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))

Syntax hints:   ∧ wa 103   ↔ wb 104  ∀wal 1341  ∃wex 1480  BOUNDED wbd 13694

This theorem was proved from axioms:  ax-mp 5  ax-4 1498  ax-bdsep 13766

This theorem is referenced by:  bdsep2  13768  bdzfauscl  13772  bdbm1.3ii  13773  bj-axemptylem  13774  bj-nalset  13777