Theorem bdssexi 13101

Description: Bounded version of ssexi 4066. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bdssexi.bd	|- BOUNDED A
bdssexi.1	|- B e. _V
bdssexi.2	|- A C_ B

Assertion

Ref	Expression
bdssexi	|- A e. _V

Proof of Theorem bdssexi

Step	Hyp	Ref	Expression
1		bdssexi.2	. 2 |- A C_ B
2		bdssexi.bd	. . 3 |- BOUNDED A
3		bdssexi.1	. . 3 |- B e. _V
4	2, 3	bdssex 13100	. 2 |- ( A C_ B -> A e. _V )
5	1, 4	ax-mp 5	1 |- A e. _V

Syntax hints:   e. wcel 1480   _Vcvv 2686   C_ wss 3071  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-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-v 2688  df-in 3077  df-ss 3084  df-bdc 13039

This theorem is referenced by: (None)