Theorem bdinex1 15391

Description: Bounded version of inex1 4163. (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 15338	. . . . 5 ⊢ BOUNDED 𝑦 ∈ 𝐵
4	3	bdzfauscl 15382	. . . 4 ⊢ (𝐴 ∈ V → ∃𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
5	1, 4	ax-mp 5	. . 3 ⊢ ∃𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
6		dfcleq 2187	. . . . 5 ⊢ (𝑥 = (𝐴 ∩ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝑥 ↔ 𝑦 ∈ (𝐴 ∩ 𝐵)))
7		elin 3342	. . . . . . 7 ⊢ (𝑦 ∈ (𝐴 ∩ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
8	7	bibi2i 227	. . . . . 6 ⊢ ((𝑦 ∈ 𝑥 ↔ 𝑦 ∈ (𝐴 ∩ 𝐵)) ↔ (𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
9	8	albii 1481	. . . . 5 ⊢ (∀𝑦(𝑦 ∈ 𝑥 ↔ 𝑦 ∈ (𝐴 ∩ 𝐵)) ↔ ∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
10	6, 9	bitri 184	. . . 4 ⊢ (𝑥 = (𝐴 ∩ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
11	10	exbii 1616	. . 3 ⊢ (∃𝑥 𝑥 = (𝐴 ∩ 𝐵) ↔ ∃𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
12	5, 11	mpbir 146	. 2 ⊢ ∃𝑥 𝑥 = (𝐴 ∩ 𝐵)
13	12	issetri 2769	1 ⊢ (𝐴 ∩ 𝐵) ∈ V

Syntax hints:   ∧ wa 104   ↔ wb 105  ∀wal 1362   = wceq 1364  ∃wex 1503   ∈ wcel 2164  Vcvv 2760   ∩ cin 3152  BOUNDED wbdc 15332

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175  ax-bdsep 15376

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-in 3159  df-bdc 15333

This theorem is referenced by:  bdinex2  15392  bdinex1g  15393  bdpeano5  15435