Theorem elvvv 5737

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 5684	. 2 ⊢ (𝐴 ∈ ((V × V) × V) ↔ ∃𝑤∃𝑧(𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)))
2		ancom 465	. . . . . 6 ⊢ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩))
3	2	2exbii 1879	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩))
4		19.42vv 1987	. . . . . 6 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ ∃𝑥∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩))
5		elvv 5736	. . . . . . 7 ⊢ (𝑤 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩)
6	5	anbi2i 634	. . . . . 6 ⊢ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ ∃𝑥∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩))
7		vex 3459	. . . . . . 7 ⊢ 𝑧 ∈ V
8	7	biantru 538	. . . . . 6 ⊢ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ↔ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ∧ 𝑧 ∈ V))
9	4, 6, 8	3bitr2i 302	. . . . 5 ⊢ (∃𝑥∃𝑦(𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 = ⟨𝑥, 𝑦⟩) ↔ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ∧ 𝑧 ∈ V))
10		anass 473	. . . . 5 ⊢ (((𝐴 = ⟨𝑤, 𝑧⟩ ∧ 𝑤 ∈ (V × V)) ∧ 𝑧 ∈ V) ↔ (𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)))
11	3, 9, 10	3bitrri 301	. . . 4 ⊢ ((𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
12	11	2exbii 1879	. . 3 ⊢ (∃𝑤∃𝑧(𝐴 = ⟨𝑤, 𝑧⟩ ∧ (𝑤 ∈ (V × V) ∧ 𝑧 ∈ V)) ↔ ∃𝑤∃𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
13		exrot4 2201	. . 3 ⊢ (∃𝑥∃𝑦∃𝑤∃𝑧(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑤∃𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
14		excom 2197	. . . . 5 ⊢ (∃𝑤∃𝑧(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑧∃𝑤(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩))
15		opex 5445	. . . . . . 7 ⊢ ⟨𝑥, 𝑦⟩ ∈ V
16		opeq1 4838	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → ⟨𝑤, 𝑧⟩ = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
17	16	eqeq2d 2774	. . . . . . 7 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐴 = ⟨𝑤, 𝑧⟩ ↔ 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩))
18	15, 17	ceqsexv 3503	. . . . . 6 ⊢ (∃𝑤(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
19	18	exbii 1878	. . . . 5 ⊢ (∃𝑧∃𝑤(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
20	14, 19	bitri 278	. . . 4 ⊢ (∃𝑤∃𝑧(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝐴 = ⟨𝑤, 𝑧⟩) ↔ ∃𝑧 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
21	20	2exbii 1879	. . 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 400   = wceq 1570  ∃wex 1809   ∈ wcel 2143  Vcvv 3455  ⟨cop 4595   × cxp 5659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5174  df-xp 5667

This theorem is used by:  ssrelrel  5782  dftpos3  8236