Theorem dfopab2 8071

Description: A way to define an ordered-pair class abstraction without using existential quantifiers. (Contributed by NM, 18-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)

Assertion

Ref	Expression
dfopab2	⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∈ (V × V) ∣ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑}

Distinct variable groups:   𝜑,𝑧   𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem dfopab2

Step	Hyp	Ref	Expression
1		nfsbc1v 3761	. . . . 5 ⊢ Ⅎ𝑥[(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑
2	1	19.41 2274	. . . 4 ⊢ (∃𝑥(∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
3		sbcopeq1a 8068	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ([(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑 ↔ 𝜑))
4	3	pm5.32i 585	. . . . . . 7 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
5	4	exbii 1880	. . . . . 6 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
6		nfcv 2925	. . . . . . . 8 ⊢ Ⅎ𝑦(1st ‘𝑧)
7		nfsbc1v 3761	. . . . . . . 8 ⊢ Ⅎ𝑦[(2nd ‘𝑧) / 𝑦]𝜑
8	6, 7	nfsbcw 3763	. . . . . . 7 ⊢ Ⅎ𝑦[(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑
9	8	19.41 2274	. . . . . 6 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
10	5, 9	bitr3i 280	. . . . 5 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
11	10	exbii 1880	. . . 4 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥(∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
12		elvv 5729	. . . . 5 ⊢ (𝑧 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩)
13	12	anbi1i 636	. . . 4 ⊢ ((𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
14	2, 11, 13	3bitr4i 306	. . 3 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
15	14	abbii 2830	. 2 ⊢ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑧 ∣ (𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑)}
16		df-opab 5170	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17		df-rab 3416	. 2 ⊢ {𝑧 ∈ (V × V) ∣ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑} = {𝑧 ∣ (𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑)}
18	15, 16, 17	3eqtr4i 2796	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∈ (V × V) ∣ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑}

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2146  {cab 2741  {crab 3415  Vcvv 3453  [wsbc 3741  ⟨cop 4837  {copab 5169   × cxp 5652  ‘cfv 6546  1^st c1st 8006  2^nd c2nd 8007

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pr 5394  ax-un 7758

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-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-iota 6500  df-fun 6548  df-fv 6554  df-1st 8008  df-2nd 8009

This theorem is used by: (None)