MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opelres Structured version   Visualization version   GIF version

Theorem opelres 5886
Description: Ordered pair elementhood in a restriction. Exercise 13 of [TakeutiZaring] p. 25. (Contributed by NM, 13-Nov-1995.) (Revised by BJ, 18-Feb-2022.) Commute the consequent. (Revised by Peter Mazsa, 24-Sep-2022.)
Assertion
Ref Expression
opelres (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))

Proof of Theorem opelres
StepHypRef Expression
1 df-res 5592 . . 3 (𝑅𝐴) = (𝑅 ∩ (𝐴 × V))
21elin2 4127 . 2 (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)))
3 opelxp 5616 . . . 4 (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ (𝐵𝐴𝐶 ∈ V))
4 elex 3440 . . . . 5 (𝐶𝑉𝐶 ∈ V)
54biantrud 531 . . . 4 (𝐶𝑉 → (𝐵𝐴 ↔ (𝐵𝐴𝐶 ∈ V)))
63, 5bitr4id 289 . . 3 (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ 𝐵𝐴))
76anbi1cd 633 . 2 (𝐶𝑉 → ((⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
82, 7syl5bb 282 1 (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wcel 2108  Vcvv 3422  cop 4564   × cxp 5578  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:  brres  5887  opelresi  5888  opelidres  5892  h2hlm  29243  setsnidel  44717
  Copyright terms: Public domain W3C validator