Theorem bdrabexg 13104

Description: Bounded version of rabexg 4071. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bdrabexg.bd	⊢ BOUNDED 𝜑
bdrabexg.bdc	⊢ BOUNDED 𝐴

Assertion

Ref	Expression
bdrabexg	⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V)

Distinct variable group:   𝑥,𝐴

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

Proof of Theorem bdrabexg

Step	Hyp	Ref	Expression
1		ssrab2 3182	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴
2		bdrabexg.bdc	. . . 4 ⊢ BOUNDED 𝐴
3		bdrabexg.bd	. . . 4 ⊢ BOUNDED 𝜑
4	2, 3	bdcrab 13050	. . 3 ⊢ BOUNDED {𝑥 ∈ 𝐴 ∣ 𝜑}
5	4	bdssexg 13102	. 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V)
6	1, 5	mpan 420	1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V)

Syntax hints:   → wi 4   ∈ wcel 1480  {crab 2420  Vcvv 2686   ⊆ wss 3071  BOUNDED wbd 13010  BOUNDED wbdc 13038

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-bd0 13011  ax-bdan 13013  ax-bdsb 13020  ax-bdsep 13082

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rab 2425  df-v 2688  df-in 3077  df-ss 3084  df-bdc 13039

This theorem is referenced by:  bj-inex  13105