Theorem eqvinop 5460

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 5453	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩ ↔ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶))
4	3	anbi2i 635	. . . . . 6 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)))
5		ancom 466	. . . . . 6 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)) ↔ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
6		anass 474	. . . . . 6 ⊢ (((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
7	4, 5, 6	3bitri 300	. . . . 5 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
8	7	exbii 1881	. . . 4 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
9		19.42v 1988	. . . 4 ⊢ (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)))
10		opeq2 4844	. . . . . . 7 ⊢ (𝑦 = 𝐶 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝐶⟩)
11	10	eqeq2d 2774	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝐶⟩))
12	2, 11	ceqsexv 3502	. . . . 5 ⊢ (∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ 𝐴 = ⟨𝑥, 𝐶⟩)
13	12	anbi2i 635	. . . 4 ⊢ ((𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩))
14	8, 9, 13	3bitri 300	. . 3 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩))
15	14	exbii 1881	. 2 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩))
16		opeq1 4843	. . . 4 ⊢ (𝑥 = 𝐵 → ⟨𝑥, 𝐶⟩ = ⟨𝐵, 𝐶⟩)
17	16	eqeq2d 2774	. . 3 ⊢ (𝑥 = 𝐵 → (𝐴 = ⟨𝑥, 𝐶⟩ ↔ 𝐴 = ⟨𝐵, 𝐶⟩))
18	1, 17	ceqsexv 3502	. 2 ⊢ (∃𝑥(𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶⟩) ↔ 𝐴 = ⟨𝐵, 𝐶⟩)
19	15, 18	bitr2i 279	1 ⊢ (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454  ⟨cop 4838

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839

This theorem is used by:  copsexgw  5464  copsexgwOLD  5465  copsexg  5466  ralxpf  5829  oprabidw  7471  oprabid  7472