Theorem bdzfauscl 13925

Description: Closed form of the version of zfauscl 4109 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 2234	. . . . . 6 ⊢ (𝑧 = 𝐴 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝐴))
2	1	anbi1d 462	. . . . 5 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))
3	2	bibi2d 231	. . . 4 ⊢ (𝑧 = 𝐴 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
4	3	albidv 1817	. . 3 ⊢ (𝑧 = 𝐴 → (∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
5	4	exbidv 1818	. 2 ⊢ (𝑧 = 𝐴 → (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))))
6		bdzfauscl.bd	. . 3 ⊢ BOUNDED 𝜑
7	6	bdsep1 13920	. 2 ⊢ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
8	5, 7	vtoclg 2790	1 ⊢ (𝐴 ∈ 𝑉 → ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1346   = wceq 1348  ∃wex 1485   ∈ wcel 2141  BOUNDED wbd 13847

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-bdsep 13919

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732

This theorem is referenced by:  bdinex1  13934