Theorem dfopab2 6208

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 2996	. . . . 5 ⊢ Ⅎ𝑥[(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑
2	1	19.41 1697	. . . 4 ⊢ (∃𝑥(∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
3		sbcopeq1a 6206	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ([(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑 ↔ 𝜑))
4	3	pm5.32i 454	. . . . . . 7 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
5	4	exbii 1616	. . . . . 6 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
6		nfcv 2332	. . . . . . . 8 ⊢ Ⅎ𝑦(1st ‘𝑧)
7		nfsbc1v 2996	. . . . . . . 8 ⊢ Ⅎ𝑦[(2nd ‘𝑧) / 𝑦]𝜑
8	6, 7	nfsbc 2998	. . . . . . 7 ⊢ Ⅎ𝑦[(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑
9	8	19.41 1697	. . . . . 6 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
10	5, 9	bitr3i 186	. . . . 5 ⊢ (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
11	10	exbii 1616	. . . 4 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥(∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
12		elvv 4703	. . . . 5 ⊢ (𝑧 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩)
13	12	anbi1i 458	. . . 4 ⊢ ((𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑) ↔ (∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
14	2, 11, 13	3bitr4i 212	. . 3 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑))
15	14	abbii 2305	. 2 ⊢ {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {𝑧 ∣ (𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑)}
16		df-opab 4080	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17		df-rab 2477	. 2 ⊢ {𝑧 ∈ (V × V) ∣ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑} = {𝑧 ∣ (𝑧 ∈ (V × V) ∧ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑)}
18	15, 16, 17	3eqtr4i 2220	1 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∈ (V × V) ∣ [(1st ‘𝑧) / 𝑥][(2nd ‘𝑧) / 𝑦]𝜑}

Syntax hints:   ∧ wa 104   = wceq 1364  ∃wex 1503   ∈ wcel 2160  {cab 2175  {crab 2472  Vcvv 2752  [wsbc 2977  ⟨cop 3610  {copab 4078   × cxp 4639  ‘cfv 5231  1^st c1st 6157  2^nd c2nd 6158

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4189  ax-pr 4224  ax-un 4448

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-rab 2477  df-v 2754  df-sbc 2978  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4308  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-iota 5193  df-fun 5233  df-fv 5239  df-1st 6159  df-2nd 6160

This theorem is referenced by: (None)