Theorem bdzfauscl 14913

Description: Closed form of the version of zfauscl 4135 for bounded formulas using bounded separation. (Contributed by BJ, 13-Nov-2019.)

Hypothesis

Ref	Expression
bdzfauscl.bd	⊢ BOUNDED 𝜑

Assertion

Ref	Expression
bdzfauscl	⊢ (𝐴 ∈ 𝑉 → ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem bdzfauscl

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2251	. . . . . 6 ⊢ (𝑧 = 𝐴 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝐴))
2	1	anbi1d 465	. . . . 5 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))
3	2	bibi2d 232	. . . 4 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
4	3	albidv 1834	. . 3 ⊢ (𝑧 = 𝐴 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
5	4	exbidv 1835	. 2 ⊢ (𝑧 = 𝐴 → (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
6		bdzfauscl.bd	. . 3 ⊢ BOUNDED 𝜑
7	6	bdsep1 14908	. 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
8	5, 7	vtoclg 2809	1 ⊢ (𝐴 ∈ 𝑉 → ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1361   = wceq 1363  ∃wex 1502   ∈ wcel 2158  BOUNDED wbd 14835

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-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2169  ax-bdsep 14907

This theorem depends on definitions:  df-bi 117  df-tru 1366  df-nf 1471  df-sb 1773  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-v 2751

This theorem is referenced by:  bdinex1  14922