Theorem eqvinop 5455

Description: A variable introduction law for ordered pairs. Analogue of Lemma 15 of [Monk2] p. 109. (Contributed by NM, 28-May-1995.)

Hypotheses

Ref	Expression
eqvinop.1	⊢ 𝐵 ∈ V
eqvinop.2	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
eqvinop	⊢ (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem eqvinop

Step	Hyp	Ref	Expression
1		eqvinop.1	. . . . . . . 8 ⊢ 𝐵 ∈ V
2		eqvinop.2	. . . . . . . 8 ⊢ 𝐶 ∈ V
3	1, 2	opth2 5448	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩ ↔ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶))
4	3	anbi2i 635	. . . . . 6 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)))
5		ancom 466	. . . . . 6 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)) ↔ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
6		anass 474	. . . . . 6 ⊢ (((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
7	4, 5, 6	3bitri 300	. . . . 5 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
8	7	exbii 1880	. . . 4 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
9		19.42v 1985	. . . 4 ⊢ (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
10		opeq2 4833	. . . . . . 7 ⊢ (𝑦 = 𝐶 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝐶⟩)
11	10	eqeq2d 2771	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝐶⟩))
12	2, 11	ceqsexv 3498	. . . . 5 ⊢ (∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ 𝐴 = ⟨𝑥, 𝐶⟩)
13	12	anbi2i 635	. . . 4 ⊢ ((𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩))
14	8, 9, 13	3bitri 300	. . 3 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩))
15	14	exbii 1880	. 2 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩))
16		opeq1 4832	. . . 4 ⊢ (𝑥 = 𝐵 → ⟨𝑥, 𝐶⟩ = ⟨𝐵, 𝐶⟩)
17	16	eqeq2d 2771	. . 3 ⊢ (𝑥 = 𝐵 → (𝐴 = ⟨𝑥, 𝐶⟩ ↔ 𝐴 = ⟨𝐵, 𝐶⟩))
18	1, 17	ceqsexv 3498	. 2 ⊢ (∃𝑥(𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩) ↔ 𝐴 = ⟨𝐵, 𝐶⟩)
19	15, 18	bitr2i 279	1 ⊢ (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  Vcvv 3450  ⟨cop 4589

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  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590

This theorem is used by:  copsexgw  5459  copsexgwOLD  5460  copsexg  5461  ralxpf  5823  oprabidw  7451  oprabid  7452