Theorem bdciin 16917

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

Hypothesis

Ref	Expression
bdciun.1	|- BOUNDED A

Assertion

Ref	Expression
bdciin	|- BOUNDED |^|_ x e. y A

Distinct variable group:   x, y

Allowed substitution hints:   A( x, y)

Proof of Theorem bdciin

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bdciun.1	. . . . 5 |- BOUNDED A
2	1	bdeli 16884	. . . 4 |- BOUNDED z e. A
3	2	ax-bdal 16856	. . 3 |- BOUNDED A. x e. y z e. A
4	3	bdcab 16887	. 2 |- BOUNDED { z | A. x e. y z e. A }
5		df-iin 4015	. 2 |- |^|_ x e. y A = { z | A. x e. y z e. A }
6	4, 5	bdceqir 16882	1 |- BOUNDED |^|_ x e. y A

This proof depends on syntax axioms:   e. wcel 2209   {cab 2224   A.wral 2528   |^|_ciin 4013  BOUNDED wbdc 16878

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-4 1563  ax-17 1579  ax-ial 1587  ax-ext 2220  ax-bd0 16851  ax-bdal 16856  ax-bdsb 16860

This proof depends on definitions:  df-bi 117  df-clab 2225  df-cleq 2231  df-clel 2234  df-iin 4015  df-bdc 16879

This theorem is used by: (None)