Theorem bdinex1 15545

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

Hypotheses

Ref	Expression
bdinex1.bd	⊢ BOUNDED 𝐵
bdinex1.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
bdinex1	⊢ (𝐴 ∩ 𝐵) ∈ V

Proof of Theorem bdinex1

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bdinex1.1	. . . 4 ⊢ 𝐴 ∈ V
2		bdinex1.bd	. . . . . 6 ⊢ BOUNDED 𝐵
3	2	bdeli 15492	. . . . 5 ⊢ BOUNDED 𝑦 ∈ 𝐵
4	3	bdzfauscl 15536	. . . 4 ⊢ (𝐴 ∈ V → ∃𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
5	1, 4	ax-mp 5	. . 3 ⊢ ∃𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
6		dfcleq 2190	. . . . 5 ⊢ (𝑥 = (𝐴 ∩ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝑥 ↔ 𝑦 ∈ (𝐴 ∩ 𝐵)))
7		elin 3346	. . . . . . 7 ⊢ (𝑦 ∈ (𝐴 ∩ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
8	7	bibi2i 227	. . . . . 6 ⊢ ((𝑦 ∈ 𝑥 ↔ 𝑦 ∈ (𝐴 ∩ 𝐵)) ↔ (𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
9	8	albii 1484	. . . . 5 ⊢ (∀𝑦(𝑦 ∈ 𝑥 ↔ 𝑦 ∈ (𝐴 ∩ 𝐵)) ↔ ∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
10	6, 9	bitri 184	. . . 4 ⊢ (𝑥 = (𝐴 ∩ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
11	10	exbii 1619	. . 3 ⊢ (∃𝑥 𝑥 = (𝐴 ∩ 𝐵) ↔ ∃𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
12	5, 11	mpbir 146	. 2 ⊢ ∃𝑥 𝑥 = (𝐴 ∩ 𝐵)
13	12	issetri 2772	1 ⊢ (𝐴 ∩ 𝐵) ∈ V

Syntax hints:   ∧ wa 104   ↔ wb 105  ∀wal 1362   = wceq 1364  ∃wex 1506   ∈ wcel 2167  Vcvv 2763   ∩ cin 3156  BOUNDED wbdc 15486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178  ax-bdsep 15530

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765  df-in 3163  df-bdc 15487

This theorem is referenced by:  bdinex2  15546  bdinex1g  15547  bdpeano5  15589