Theorem unopab 5184

Description: Union of two ordered pair class abstractions. (Contributed by NM, 30-Sep-2002.)

Assertion

Ref	Expression
unopab	⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ∪ {⟨𝑥, 𝑦⟩ ∣ 𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∨ 𝜓)}

Proof of Theorem unopab

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2764	. . . . . 6 ⊢ (𝑧 = 𝑤 → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ 𝑤 = ⟨𝑥, 𝑦⟩))
2	1	anbi1d 643	. . . . 5 ⊢ (𝑧 = 𝑤 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
3	2	2exbidv 1956	. . . 4 ⊢ (𝑧 = 𝑤 → (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
4	1	anbi1d 643	. . . . 5 ⊢ (𝑧 = 𝑤 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
5	4	2exbidv 1956	. . . 4 ⊢ (𝑧 = 𝑤 → (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
6	3, 5	unabw 4252	. . 3 ⊢ ({𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ∪ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}) = {𝑤 ∣ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))}
7		19.43 1914	. . . . 5 ⊢ (∃𝑥(∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
8		andi 1025	. . . . . . . 8 ⊢ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓)) ↔ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
9	8	exbii 1880	. . . . . . 7 ⊢ (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓)) ↔ ∃𝑦((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
10		19.43 1914	. . . . . . 7 ⊢ (∃𝑦((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)))
11	9, 10	bitr2i 279	. . . . . 6 ⊢ ((∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓)))
12	11	exbii 1880	. . . . 5 ⊢ (∃𝑥(∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓)))
13	7, 12	bitr3i 280	. . . 4 ⊢ ((∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓)))
14	13	abbii 2827	. . 3 ⊢ {𝑤 ∣ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∨ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜓))} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓))}
15	6, 14	eqtri 2783	. 2 ⊢ ({𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ∪ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}) = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓))}
16		df-opab 5167	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17		df-opab 5167	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜓} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
18	16, 17	uneq12i 4165	. 2 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ∪ {⟨𝑥, 𝑦⟩ ∣ 𝜓}) = ({𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ∪ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)})
19		df-opab 5167	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∨ 𝜓)} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝜑 ∨ 𝜓))}
20	15, 18, 19	3eqtr4i 2793	1 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ∪ {⟨𝑥, 𝑦⟩ ∣ 𝜓}) = {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∨ 𝜓)}

This proof depends on syntax axioms:   ∧ wa 401   ∨ wo 861   = wceq 1569  ∃wex 1811  {cab 2738   ∪ cun 4149  ⟨cop 4834  {copab 5166

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-un 4151  df-opab 5167

This theorem is used by:  xpundi  5719  xpundir  5720  cnvun  6132  coundi  6248  coundir  6249  mptun  6685  opsrtoslem1  22369  lgsquadlem3  27714