Theorem bdsepnfALT 16829

Description: Alternate proof of bdsepnf 16828, not using bdsepnft 16827. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bdsepnf.nf	⊢ Ⅎ𝑏𝜑
bdsepnf.1	⊢ BOUNDED 𝜑

Assertion

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

Distinct variable group:   𝑎,𝑏,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑎,𝑏)

Proof of Theorem bdsepnfALT

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bdsepnf.1	. . 3 ⊢ BOUNDED 𝜑
2	1	bdsep2 16826	. 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))
3		nfv 1581	. . . . 5 ⊢ Ⅎ𝑏 𝑥 ∈ 𝑦
4		nfv 1581	. . . . . 6 ⊢ Ⅎ𝑏 𝑥 ∈ 𝑎
5		bdsepnf.nf	. . . . . 6 ⊢ Ⅎ𝑏𝜑
6	4, 5	nfan 1618	. . . . 5 ⊢ Ⅎ𝑏(𝑥 ∈ 𝑎 ∧ 𝜑)
7	3, 6	nfbi 1642	. . . 4 ⊢ Ⅎ𝑏(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))
8	7	nfal 1629	. . 3 ⊢ Ⅎ𝑏∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))
9		nfv 1581	. . 3 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))
10		elequ2 2214	. . . . 5 ⊢ (𝑦 = 𝑏 → (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑏))
11	10	bibi1d 233	. . . 4 ⊢ (𝑦 = 𝑏 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))))
12	11	albidv 1877	. . 3 ⊢ (𝑦 = 𝑏 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))))
13	8, 9, 12	cbvex 1809	. 2 ⊢ (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑)) ↔ ∃𝑏∀𝑥(𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑)))
14	2, 13	mpbi 145	1 ⊢ ∃𝑏∀𝑥(𝑥 ∈ 𝑏 ↔ (𝑥 ∈ 𝑎 ∧ 𝜑))

Syntax hints:   ∧ wa 104   ↔ wb 105  ∀wal 1400  Ⅎwnf 1513  ∃wex 1545  BOUNDED wbd 16752

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-bdsep 16824

This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-cleq 2231  df-clel 2234

This theorem is referenced by: (None)