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

Theorem opelres 5942
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 5634 . . 3 (𝑅𝐴) = (𝑅 ∩ (𝐴 × V))
21elin2 4153 . 2 (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)))
3 opelxp 5658 . . . 4 (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ (𝐵𝐴𝐶 ∈ V))
4 elex 3459 . . . . 5 (𝐶𝑉𝐶 ∈ V)
54biantrud 531 . . . 4 (𝐶𝑉 → (𝐵𝐴 ↔ (𝐵𝐴𝐶 ∈ V)))
63, 5bitr4id 290 . . 3 (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ 𝐵𝐴))
76anbi1cd 635 . 2 (𝐶𝑉 → ((⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
82, 7bitrid 283 1 (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wcel 2113  Vcvv 3438  cop 4584   × cxp 5620  cres 5624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-opab 5159  df-xp 5628  df-res 5634
This theorem is referenced by:  brres  5943  opelresi  5944  opelidres  5948  h2hlm  31004  setsnidel  47565
  Copyright terms: Public domain W3C validator