Theorem bdcint 13064

Description: The intersection of a setvar is a bounded class. (Contributed by BJ, 16-Oct-2019.)

Assertion

Ref	Expression
bdcint	|- BOUNDED |^| x

Proof of Theorem bdcint

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-bdel 13008	. . . . 5 |- BOUNDED y e. z
2	1	ax-bdal 13005	. . . 4 |- BOUNDED A. z e. x y e. z
3		df-ral 2419	. . . 4 |- ( A. z e. x y e. z <-> A. z ( z e. x -> y e. z ) )
4	2, 3	bd0 13011	. . 3 |- BOUNDED A. z ( z e. x -> y e. z )
5	4	bdcab 13036	. 2 |- BOUNDED { y | A. z ( z e. x -> y e. z ) }
6		df-int 3767	. 2 |- |^| x = { y | A. z ( z e. x -> y e. z ) }
7	5, 6	bdceqir 13031	1 |- BOUNDED |^| x

Syntax hints:   -> wi 4   A.wal 1329   {cab 2123   A.wral 2414   |^|cint 3766  BOUNDED wbdc 13027

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-5 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-17 1506  ax-ial 1514  ax-ext 2119  ax-bd0 13000  ax-bdal 13005  ax-bdel 13008  ax-bdsb 13009

This theorem depends on definitions:  df-bi 116  df-clab 2124  df-cleq 2130  df-clel 2133  df-ral 2419  df-int 3767  df-bdc 13028

This theorem is referenced by: (None)