Theorem bdcint 13872

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 13816	. . . . 5 |- BOUNDED y e. z
2	1	ax-bdal 13813	. . . 4 |- BOUNDED A. z e. x y e. z
3		df-ral 2453	. . . 4 |- ( A. z e. x y e. z <-> A. z ( z e. x -> y e. z ) )
4	2, 3	bd0 13819	. . 3 |- BOUNDED A. z ( z e. x -> y e. z )
5	4	bdcab 13844	. 2 |- BOUNDED { y | A. z ( z e. x -> y e. z ) }
6		df-int 3830	. 2 |- |^| x = { y | A. z ( z e. x -> y e. z ) }
7	5, 6	bdceqir 13839	1 |- BOUNDED |^| x

Syntax hints:   -> wi 4   A.wal 1346   {cab 2156   A.wral 2448   |^|cint 3829  BOUNDED wbdc 13835

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 1440  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-4 1503  ax-17 1519  ax-ial 1527  ax-ext 2152  ax-bd0 13808  ax-bdal 13813  ax-bdel 13816  ax-bdsb 13817

This theorem depends on definitions:  df-bi 116  df-clab 2157  df-cleq 2163  df-clel 2166  df-ral 2453  df-int 3830  df-bdc 13836

This theorem is referenced by: (None)