Theorem bdsnss 9993

Description: Inclusion of a singleton of a setvar in a bounded class is a bounded formula. (Contributed by BJ, 16-Oct-2019.)

Hypothesis

Ref	Expression
bdsnss.1	⊢ BOUNDED 𝐴

Assertion

Ref	Expression
bdsnss	⊢ BOUNDED {𝑥} ⊆ 𝐴

Distinct variable group:   𝑥,𝐴

Proof of Theorem bdsnss

Step	Hyp	Ref	Expression
1		bdsnss.1	. . 3 ⊢ BOUNDED 𝐴
2	1	bdeli 9966	. 2 ⊢ BOUNDED 𝑥 ∈ 𝐴
3		vex 2560	. . 3 ⊢ 𝑥 ∈ V
4	3	snss 3494	. 2 ⊢ (𝑥 ∈ 𝐴 ↔ {𝑥} ⊆ 𝐴)
5	2, 4	bd0 9944	1 ⊢ BOUNDED {𝑥} ⊆ 𝐴

Syntax hints:   ∈ wcel 1393   ⊆ wss 2917  {csn 3375  BOUNDED wbd 9932  BOUNDED wbdc 9960

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-bd0 9933

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-in 2924  df-ss 2931  df-sn 3381  df-bdc 9961

This theorem is referenced by:  bdvsn  9994  bdeqsuc  10001