Theorem resoprab 5914

Description: Restriction of an operation class abstraction. (Contributed by NM, 10-Feb-2007.)

Assertion

Ref	Expression
resoprab	⊢ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↾ (𝐴 × 𝐵)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)}

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

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem resoprab

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		resopab 4909	. . 3 ⊢ ({⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↾ (𝐴 × 𝐵)) = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))}
2		19.42vv 1891	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
3		an12 551	. . . . . . 7 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)))
4		eleq1 2220	. . . . . . . . . 10 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑤 ∈ (𝐴 × 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
5		opelxp 4615	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
6	4, 5	bitrdi 195	. . . . . . . . 9 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑤 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
7	6	anbi1d 461	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
8	7	pm5.32i 450	. . . . . . 7 ⊢ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
9	3, 8	bitri 183	. . . . . 6 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
10	9	2exbii 1586	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
11	2, 10	bitr3i 185	. . . 4 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
12	11	opabbii 4031	. . 3 ⊢ {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑))}
13	1, 12	eqtri 2178	. 2 ⊢ ({⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↾ (𝐴 × 𝐵)) = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑))}
14		dfoprab2 5865	. . 3 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
15	14	reseq1i 4861	. 2 ⊢ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↾ (𝐴 × 𝐵)) = ({⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↾ (𝐴 × 𝐵))
16		dfoprab2 5865	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑))}
17	13, 15, 16	3eqtr4i 2188	1 ⊢ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↾ (𝐴 × 𝐵)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)}

Syntax hints:   ∧ wa 103   = wceq 1335  ∃wex 1472   ∈ wcel 2128  ⟨cop 3563  {copab 4024   × cxp 4583   ↾ cres 4587  {coprab 5822

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4135  ax-pr 4169

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-v 2714  df-un 3106  df-in 3108  df-ss 3115  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-opab 4026  df-xp 4591  df-rel 4592  df-res 4597  df-oprab 5825

This theorem is referenced by:  resoprab2  5915