Theorem bdop 15085

Description: The ordered pair of two setvars is a bounded class. (Contributed by BJ, 21-Nov-2019.)

Assertion

Ref	Expression
bdop	⊢ BOUNDED ⟨𝑥, 𝑦⟩

Proof of Theorem bdop

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bdvsn 15084	. . . 4 ⊢ BOUNDED 𝑧 = {𝑥}
2		bdcpr 15081	. . . . . . 7 ⊢ BOUNDED {𝑥, 𝑦}
3	2	bdss 15074	. . . . . 6 ⊢ BOUNDED 𝑧 ⊆ {𝑥, 𝑦}
4		ax-bdel 15031	. . . . . . . 8 ⊢ BOUNDED 𝑥 ∈ 𝑧
5		ax-bdel 15031	. . . . . . . 8 ⊢ BOUNDED 𝑦 ∈ 𝑧
6	4, 5	ax-bdan 15025	. . . . . . 7 ⊢ BOUNDED (𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧)
7		vex 2755	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
8	7	prid1 3713	. . . . . . . . . 10 ⊢ 𝑥 ∈ {𝑥, 𝑦}
9		ssel 3164	. . . . . . . . . 10 ⊢ ({𝑥, 𝑦} ⊆ 𝑧 → (𝑥 ∈ {𝑥, 𝑦} → 𝑥 ∈ 𝑧))
10	8, 9	mpi 15	. . . . . . . . 9 ⊢ ({𝑥, 𝑦} ⊆ 𝑧 → 𝑥 ∈ 𝑧)
11		vex 2755	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
12	11	prid2 3714	. . . . . . . . . 10 ⊢ 𝑦 ∈ {𝑥, 𝑦}
13		ssel 3164	. . . . . . . . . 10 ⊢ ({𝑥, 𝑦} ⊆ 𝑧 → (𝑦 ∈ {𝑥, 𝑦} → 𝑦 ∈ 𝑧))
14	12, 13	mpi 15	. . . . . . . . 9 ⊢ ({𝑥, 𝑦} ⊆ 𝑧 → 𝑦 ∈ 𝑧)
15	10, 14	jca 306	. . . . . . . 8 ⊢ ({𝑥, 𝑦} ⊆ 𝑧 → (𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧))
16		prssi 3765	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧) → {𝑥, 𝑦} ⊆ 𝑧)
17	15, 16	impbii 126	. . . . . . 7 ⊢ ({𝑥, 𝑦} ⊆ 𝑧 ↔ (𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧))
18	6, 17	bd0r 15035	. . . . . 6 ⊢ BOUNDED {𝑥, 𝑦} ⊆ 𝑧
19	3, 18	ax-bdan 15025	. . . . 5 ⊢ BOUNDED (𝑧 ⊆ {𝑥, 𝑦} ∧ {𝑥, 𝑦} ⊆ 𝑧)
20		eqss 3185	. . . . 5 ⊢ (𝑧 = {𝑥, 𝑦} ↔ (𝑧 ⊆ {𝑥, 𝑦} ∧ {𝑥, 𝑦} ⊆ 𝑧))
21	19, 20	bd0r 15035	. . . 4 ⊢ BOUNDED 𝑧 = {𝑥, 𝑦}
22	1, 21	ax-bdor 15026	. . 3 ⊢ BOUNDED (𝑧 = {𝑥} ∨ 𝑧 = {𝑥, 𝑦})
23		vex 2755	. . . 4 ⊢ 𝑧 ∈ V
24	23, 7, 11	elop 4249	. . 3 ⊢ (𝑧 ∈ ⟨𝑥, 𝑦⟩ ↔ (𝑧 = {𝑥} ∨ 𝑧 = {𝑥, 𝑦}))
25	22, 24	bd0r 15035	. 2 ⊢ BOUNDED 𝑧 ∈ ⟨𝑥, 𝑦⟩
26	25	bdelir 15057	1 ⊢ BOUNDED ⟨𝑥, 𝑦⟩

Syntax hints:   ∧ wa 104   ∨ wo 709   = wceq 1364   ∈ wcel 2160   ⊆ wss 3144  {csn 3607  {cpr 3608  ⟨cop 3610  BOUNDED wbdc 15050

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 2171  ax-bd0 15023  ax-bdan 15025  ax-bdor 15026  ax-bdal 15028  ax-bdeq 15030  ax-bdel 15031  ax-bdsb 15032

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-v 2754  df-un 3148  df-in 3150  df-ss 3157  df-sn 3613  df-pr 3614  df-op 3616  df-bdc 15051

This theorem is referenced by: (None)