Theorem bdcv 9968

Description: A setvar is a bounded class. (Contributed by BJ, 3-Oct-2019.)

Assertion

Ref	Expression
bdcv	|- BOUNDED x

Proof of Theorem bdcv

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-bdel 9941	. 2 |- BOUNDED y e. x
2	1	bdelir 9967	1 |- BOUNDED x

Syntax hints:  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-gen 1338  ax-bdel 9941

This theorem depends on definitions:  df-bi 110  df-bdc 9961

This theorem is referenced by:  bdvsn  9994  bdcsuc  10000  bdeqsuc  10001  bj-inex  10027  bj-nntrans  10076  bj-omtrans  10081  bj-inf2vn  10099  bj-omex2  10102  bj-nn0sucALT  10103