Theorem resoprab 6184

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 5107	. . 3 ⊢ ({⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↾ (𝐴 × 𝐵)) = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))}
2		19.42vv 1967	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
3		an12 567	. . . . . . 7 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)))
4		eleq1 2301	. . . . . . . . . 10 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑤 ∈ (𝐴 × 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
5		opelxp 4804	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
6	4, 5	bitrdi 196	. . . . . . . . 9 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑤 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
7	6	anbi1d 469	. . . . . . . 8 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
8	7	pm5.32i 458	. . . . . . 7 ⊢ ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
9	3, 8	bitri 184	. . . . . 6 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
10	9	2exbii 1659	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
11	2, 10	bitr3i 186	. . . 4 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)))
12	11	opabbii 4198	. . 3 ⊢ {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑))}
13	1, 12	eqtri 2259	. 2 ⊢ ({⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↾ (𝐴 × 𝐵)) = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑))}
14		dfoprab2 6135	. . 3 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
15	14	reseq1i 5059	. 2 ⊢ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↾ (𝐴 × 𝐵)) = ({⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↾ (𝐴 × 𝐵))
16		dfoprab2 6135	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑))}
17	13, 15, 16	3eqtr4i 2269	1 ⊢ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↾ (𝐴 × 𝐵)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)}

This proof depends on syntax axioms:   ∧ wa 104   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ⟨cop 3712  {copab 4191   × cxp 4772   ↾ cres 4776  {coprab 6086

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-opab 4193  df-xp 4780  df-rel 4781  df-res 4786  df-oprab 6089

This theorem is used by:  resoprab2  6185