Theorem elvvv 5731

Description: Membership in universal class of ordered triples. (Contributed by NM, 17-Dec-2008.)

Assertion

Ref	Expression
elvvv	⊢ (𝐴 ∈ ((V × V) × V) ↔ ∃𝑥∃𝑦∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)

Distinct variable group:   𝑥,𝑦,𝑧,𝐴

Proof of Theorem elvvv

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elxp 5678	. 2 ⊢ (𝐴 ∈ ((V × V) × V) ↔ ∃𝑤∃𝑧(𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)))
2		ancom 466	. . . . . 6 ⊢ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩))
3	2	2exbii 1882	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩))
4		19.42vv 1990	. . . . . 6 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ ∃𝑥∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩))
5		elvv 5730	. . . . . . 7 ⊢ (𝑤 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩)
6	5	anbi2i 635	. . . . . 6 ⊢ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ ∃𝑥∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩))
7		vex 3454	. . . . . . 7 ⊢ 𝑧 ∈ V
8	7	biantru 539	. . . . . 6 ⊢ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ↔ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ∧ 𝑧 ∈ V))
9	4, 6, 8	3bitr2i 302	. . . . 5 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩) ↔ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ∧ 𝑧 ∈ V))
10		anass 474	. . . . 5 ⊢ (((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ∧ 𝑧 ∈ V) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)))
11	3, 9, 10	3bitrri 301	. . . 4 ⊢ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
12	11	2exbii 1882	. . 3 ⊢ (∃𝑤∃𝑧(𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)) ↔ ∃𝑤∃𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
13		exrot4 2203	. . 3 ⊢ (∃𝑥∃𝑦∃𝑤∃𝑧(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑤∃𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
14		excom 2199	. . . . 5 ⊢ (∃𝑤∃𝑧(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑧∃𝑤(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
15		opex 5439	. . . . . . 7 ⊢ ⟨𝑥, 𝑦⟩ ∈ V
16		opeq1 4833	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → ⟨𝑤, 𝑧⟩ = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
17	16	eqeq2d 2771	. . . . . . 7 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐴 = ⟨𝑤, 𝑧⟩ ↔ 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩))
18	15, 17	ceqsexv 3498	. . . . . 6 ⊢ (∃𝑤(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
19	18	exbii 1881	. . . . 5 ⊢ (∃𝑧∃𝑤(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
20	14, 19	bitri 278	. . . 4 ⊢ (∃𝑤∃𝑧(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
21	20	2exbii 1882	. . 3 ⊢ (∃𝑥∃𝑦∃𝑤∃𝑧(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑥∃𝑦∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
22	12, 13, 21	3bitr2i 302	. 2 ⊢ (∃𝑤∃𝑧(𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)) ↔ ∃𝑥∃𝑦∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
23	1, 22	bitri 278	1 ⊢ (𝐴 ∈ ((V × V) × V) ↔ ∃𝑥∃𝑦∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  Vcvv 3450  ⟨cop 4590   × cxp 5653

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2732  ax-sep 5251  ax-pr 5398

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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5661

This theorem is used by:  ssrelrel  5776  dftpos3  8244