Theorem eqvinot 5456

Description: A variable introduction law for ordered triples, analogous to eqvinop 5455. (Contributed by BTernaryTau, 8-Sep-2026.)

Hypotheses

Ref	Expression
eqvinot.1	⊢ 𝐵 ∈ V
eqvinot.2	⊢ 𝐶 ∈ V
eqvinot.3	⊢ 𝐷 ∈ V

Assertion

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

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

Proof of Theorem eqvinot

Step	Hyp	Ref	Expression
1		19.42v 1985	. . . 4 ⊢ (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩)) ↔ (𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩)))
2		19.42v 1985	. . . . . . 7 ⊢ (∃𝑧((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ (𝑧 = 𝐷 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)) ↔ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ ∃𝑧(𝑧 = 𝐷 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)))
3		vex 3454	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
4		vex 3454	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
5		vex 3454	. . . . . . . . . . 11 ⊢ 𝑧 ∈ V
6	3, 4, 5	otth 5452	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩ ↔ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶 ∧ 𝑧 = 𝐷))
7	6	anbi2i 635	. . . . . . . . 9 ⊢ ((𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩) ↔ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶 ∧ 𝑧 = 𝐷)))
8		ancom 466	. . . . . . . . 9 ⊢ ((𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶 ∧ 𝑧 = 𝐷)) ↔ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶 ∧ 𝑧 = 𝐷) ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩))
9		3an4anass 1122	. . . . . . . . 9 ⊢ (((𝑥 = 𝐵 ∧ 𝑦 = 𝐶 ∧ 𝑧 = 𝐷) ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩) ↔ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ (𝑧 = 𝐷 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)))
10	7, 8, 9	3bitrri 301	. . . . . . . 8 ⊢ (((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ (𝑧 = 𝐷 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)) ↔ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩))
11	10	exbii 1880	. . . . . . 7 ⊢ (∃𝑧((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ (𝑧 = 𝐷 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)) ↔ ∃𝑧(𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩))
12		eqvinot.3	. . . . . . . . 9 ⊢ 𝐷 ∈ V
13		oteq3 4861	. . . . . . . . . 10 ⊢ (𝑧 = 𝐷 → ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝑥, 𝑦, 𝐷⟩)
14	13	eqeq2d 2771	. . . . . . . . 9 ⊢ (𝑧 = 𝐷 → (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ↔ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩))
15	12, 14	ceqsexv 3498	. . . . . . . 8 ⊢ (∃𝑧(𝑧 = 𝐷 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩) ↔ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩)
16	15	anbi2i 635	. . . . . . 7 ⊢ (((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ ∃𝑧(𝑧 = 𝐷 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝑧⟩)) ↔ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩))
17	2, 11, 16	3bitr3i 304	. . . . . 6 ⊢ (∃𝑧(𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩) ↔ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩))
18		anass 474	. . . . . 6 ⊢ (((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩)))
19	17, 18	bitr2i 279	. . . . 5 ⊢ ((𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩)) ↔ ∃𝑧(𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩))
20	19	exbii 1880	. . . 4 ⊢ (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩)) ↔ ∃𝑦∃𝑧(𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩))
21		eqvinot.2	. . . . . 6 ⊢ 𝐶 ∈ V
22		oteq2 4860	. . . . . . 7 ⊢ (𝑦 = 𝐶 → ⟨𝑥, 𝑦, 𝐷⟩ = ⟨𝑥, 𝐶, 𝐷⟩)
23	22	eqeq2d 2771	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝐴 = ⟨𝑥, 𝑦, 𝐷⟩ ↔ 𝐴 = ⟨𝑥, 𝐶, 𝐷⟩))
24	21, 23	ceqsexv 3498	. . . . 5 ⊢ (∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩) ↔ 𝐴 = ⟨𝑥, 𝐶, 𝐷⟩)
25	24	anbi2i 635	. . . 4 ⊢ ((𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶 ∧ 𝐴 = ⟨𝑥, 𝑦, 𝐷⟩)) ↔ (𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶, 𝐷⟩))
26	1, 20, 25	3bitr3i 304	. . 3 ⊢ (∃𝑦∃𝑧(𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩) ↔ (𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶, 𝐷⟩))
27	26	exbii 1880	. 2 ⊢ (∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩) ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶, 𝐷⟩))
28		eqvinot.1	. . 3 ⊢ 𝐵 ∈ V
29		oteq1 4859	. . . 4 ⊢ (𝑥 = 𝐵 → ⟨𝑥, 𝐶, 𝐷⟩ = ⟨𝐵, 𝐶, 𝐷⟩)
30	29	eqeq2d 2771	. . 3 ⊢ (𝑥 = 𝐵 → (𝐴 = ⟨𝑥, 𝐶, 𝐷⟩ ↔ 𝐴 = ⟨𝐵, 𝐶, 𝐷⟩))
31	28, 30	ceqsexv 3498	. 2 ⊢ (∃𝑥(𝑥 = 𝐵 ∧ 𝐴 = ⟨𝑥, 𝐶, 𝐷⟩) ↔ 𝐴 = ⟨𝐵, 𝐶, 𝐷⟩)
32	27, 31	bitr2i 279	1 ⊢ (𝐴 = ⟨𝐵, 𝐶, 𝐷⟩ ↔ ∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ ∧ ⟨𝑥, 𝑦, 𝑧⟩ = ⟨𝐵, 𝐶, 𝐷⟩))

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

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-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-ot 4858

This theorem is used by:  cotsexgw  5462