Theorem opres 5890

Description: Ordered pair membership in a restriction when the first member belongs to the restricting class. (Contributed by NM, 30-Apr-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Hypothesis

Ref	Expression
opres.1	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
opres	⊢ (𝐴 ∈ 𝐷 → (⟨𝐴, 𝐵⟩ ∈ (𝐶 ↾ 𝐷) ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))

Proof of Theorem opres

Step	Hyp	Ref	Expression
1		opres.1	. . 3 ⊢ 𝐵 ∈ V
2	1	opelresi 5888	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝐶 ↾ 𝐷) ↔ (𝐴 ∈ 𝐷 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
3	2	baib 535	1 ⊢ (𝐴 ∈ 𝐷 → (⟨𝐴, 𝐵⟩ ∈ (𝐶 ↾ 𝐷) ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))

Syntax hints:   → wi 4   ↔ wb 205   ∈ wcel 2108  Vcvv 3422  ⟨cop 4564   ↾ cres 5582

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-opab 5133  df-xp 5586  df-res 5592

This theorem is referenced by:  resieq  5891  2elresin  6537  mdetunilem9  21677